On the Kolmogorov−Chaitin Complexity for short sequences
Main Authors: | Delahaye, J, Zenil, H |
---|---|
Format: | Conference item |
Published: |
World Scientific
2007
|
Similar Items
-
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
by: Soler−Toscano, F, et al.
Published: (2014) -
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
by: Delahaye, J, et al.
Published: (2012) -
Second quantized Kolmogorov complexity
by: Rogers, C, et al.
Published: (2008) -
Algorithmic complexity for short binary strings applied to psychology: a primer
by: Gauvrit, N, et al.
Published: (2013) -
On Kolmogorov complexity and the costs of carrying out strategies
Published: (2000)