Information: The Algorithmic Paradigm

DOI10.1007/978-3-642-00659-3_4MaRDI QIDQ3627409zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

survey paperalgorithmic information theory

Mathematics Subject Classification ID

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

Recommendations

• Publication:4133535
• Information theory: A multifaceted model of information
• Theory of information. Fundamentality, diversity and unification.
• Publication:5617439
• Algorithmic approach to dynamic information theory

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 44959 (Why is no real title available?)
• scientific article; zbMATH DE number 49692 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1945067 (Why is no real title available?)
• scientific article; zbMATH DE number 1845043 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 5234254 (Why is no real title available?)
• scientific article; zbMATH DE number 3254847 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• A Mathematical Theory of Communication
• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic Information Theory
• Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
• Coding with minimal programs
• From Heisenberg to Gödel via Chaitin
• Information Flow
• Is complexity a source of incompleteness?
• Most programs stop quickly or never halt
• Natural halting probabilities, partial randomness, and zeta functions
• Randomness and recursive enumerability
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• The 3x + 1 Problem and Its Generalizations

Cited in

(1)

• On sequential structures in incompressible multidimensional networks

This page was built for publication: Information: The Algorithmic Paradigm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627409)