scientific article; zbMATH DE number 1418478

zbMath0955.68046MaRDI QIDQ4942040

Gregory J. Chaitin

Publication date: 18 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmic information theoryself-delimiting universal Turing machine

Mathematics Subject Classification ID

Related Items (12)

Is complexity a source of incompleteness? ⋮ EXACT APPROXIMATIONS OF OMEGA NUMBERS ⋮ From Mathesis Universalis to Provability, Computability, and Constructivity ⋮ Recursively enumerable reals and Chaitin \(\Omega\) numbers ⋮ Analog computation beyond the Turing limit ⋮ A characterization of c. e. random reals ⋮ Computing a Glimpse of Randomness ⋮ Formal Proof: Reconciling Correctness and Understanding ⋮ Entropic measures, Markov information sources and complexity ⋮ Information theory, evolution and the origin of life ⋮ A comparison of two approaches to pseudorandomness ⋮ Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.

Uses Software

• Mathematica

This page was built for publication: