Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
Main Authors: | Delahaye, J, Zenil, H |
---|---|
Format: | Journal article |
Published: |
2012
|
Similar Items
-
Algorithmic complexity for short binary strings applied to psychology: a primer
by: Gauvrit, N, et al.
Published: (2013) -
On the Kolmogorov−Chaitin Complexity for short sequences
by: Delahaye, J, et al.
Published: (2007) -
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
by: Soler−Toscano, F, et al.
Published: (2013) -
An Algorithmic Information−theoretic Approach to the Behaviour of Financial Markets
by: Zenil, H, et al.
Published: (2011) -
Particle on the innermost stable circular orbit of a rapidly spinning black hole
by: Gralla, Samuel E., et al.
Published: (2015)