scientific article; zbMATH DE number 5252406

zbMath1138.03036arXivmath/0701164MaRDI QIDQ5448320

Gregory J. Chaitin

Publication date: 20 March 2008

Full work available at URL: https://arxiv.org/abs/math/0701164

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

zbMATH Keywords

algorithmic information theoryincompletenessrandom sequenceprogram-size complexityrandom string

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) History of mathematical logic and foundations (03-03) Applications of computability and recursion theory (03D80) History of computer science (68-03)

Related Items (4)

Unpredictability and Computational Irreducibility ⋮ Martingales in the Study of Randomness ⋮ Algorithmic networks: central time to trigger expected emergent open-endedness ⋮ Thinking with notations: epistemic actions and epistemic activities in mathematical practice

This page was built for publication: