Information: The Algorithmic Paradigm

DOI10.1007/978-3-642-00659-3_4zbMath1239.68035OpenAlexW1538588767WikidataQ57001576 ScholiaQ57001576MaRDI QIDQ3627409

Cristian S. Calude

Publication date: 12 May 2009

Published in: Formal Theories of Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00659-3_4

zbMATH Keywords

algorithmic information theorysurvey paper

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• A Mathematical Theory of Communication
• Natural halting probabilities, partial randomness, and zeta functions
• Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
• Is complexity a source of incompleteness?
• Most programs stop quickly or never halt
• Randomness and Recursive Enumerability
• The 3x + 1 Problem and Its Generalizations
• Algorithmic Information Theory
• A Theory of Program Size Formally Identical to Information Theory
• Information Flow
• CODING WITH MINIMAL PROGRAMS
• From Heisenberg to Gödel via Chaitin
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item