About the work
Computing the incomputable has always been a challenge. For example, in finding the busiest Turing machines (Rado) given a number of symbols and states (whimsically called busy beavers). This means either finding Turing machines that, starting from an empty input, produce more non-blank symbols in their output tapes before halting than any other Turing machine [...]
Print work information
Work information
Title Calculating a Universal Distribution to Approximate Kolmogorov-Chaitin Complexity
Computing the incomputable has always been a challenge. For example, in finding the busiest Turing machines (Rado) given a number of symbols and states (whimsically called busy beavers). This means either finding Turing machines that, starting from an empty input, produce more non-blank symbols in their output tapes before halting than any other Turing machine [...]
Work type Article
Tags complexity, algorithmic information theory, computability, foundations of computation, new ideas, universality and unsolvability, computer science
-------------------------
Registry info in Safe Creative
Identifier 1212123657910
Entry date Dec 12, 2012, 1:45 AM UTC
License Creative Commons Attribution Non-commercial No Derivatives 3.0
-------------------------
Copyright registered declarations
Author. Holder Hector Zenil Chavez. Date Dec 12, 2012.
Information available at https://www.safecreative.org/work/1212123657910-calculating-a-universal-distribution-to-approximate-kolmogorov-chaitin-complexity
/
Registration: 1212123657910
