Composite quantum system show correlations that can not be explained by 
any composition of models for individual systems. An often cited indication
for this is the violation of a Bell inequality, which is inherently based on a
statistical argument. Inspired by the idea that the universe may be simulated
by universal computers like Turing machines, we replace statistical tests with
one that estimates the complexity of measurement results. 

We present an algorithmic equivalent of a Bell inequality.
We evaluate the complexity of
a physical system of entangled photon pairs by assessing  the compressibility
of measurement data files using a compression program, and find it exhibits
correlations beyond any "classical" model.

The presented technique, applied to different quantum systems,
may serve to complement the common statistical interpretation of quantum 
physics by an algorithmic one.


Composite quantum systems show correlations that can not be explained by 
any composition of models for individual systems. An often cited 
indication for this is the violation of a Bell inequality, which is 
inherently based on a statistical argument. Inspired by the idea that 
the universe may be simulated by universal computers like Turing 
machines, we replace statistical tests with one that that estimates
the complexity of measurement results.

We present an algorithmic equivalent of a Bell inequality. We evaluate 
the complexity of a physical system of entangled photon pairs by 
assessing the compressibility of measurement data files using a 
compression program, and find it exhibits correlations beyond any 
classical model. 

The presented technique, applied to different quantum systems,
may serve to complement the common statistical interpretation of quantum 
physics by an algorithmic one.