Gödel's theorem and information
From MaRDI portal
Publication:1811810
DOI10.1007/BF02084159zbMath1016.03501MaRDI QIDQ1811810
Publication date: 16 July 2003
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Philosophical and critical aspects of logic and foundations (03A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) First-order arithmetic and fragments (03F30) Information theory (general) (94A15)
Related Items (29)
Predictability in deterministic theories ⋮ Undecidability and chaos in word-coded symbolic dynamics ⋮ Is complexity a source of incompleteness? ⋮ Incompleteness theorems for random reals ⋮ More really is different ⋮ Random problems ⋮ Open problems in universal induction \& intelligence ⋮ Self-organisation in dynamical systems: a limiting result ⋮ A Suppes predicate for general relativity and set-theoretically generic spacetimes ⋮ Algorithmically Independent Sequences ⋮ Markov chain network training and conservation law approximations: Linking microscopic and macroscopic models for evolution ⋮ Quantum Experiments Can Test Mathematical Undecidability ⋮ Undecidability and incompleteness in classical mechanics ⋮ Epistemic horizons and the foundations of quantum mechanics ⋮ Revisiting Chaitin's incompleteness theorem ⋮ Information-theoretic incompleteness ⋮ LISP program-size complexity. II ⋮ On explicating the concept `the power of an arithmetical theory' ⋮ Algorithmically independent sequences ⋮ Logical independence and quantum randomness ⋮ What is context for? Syntax in a non-abstract world ⋮ Predictability: a way to characterize complexity ⋮ Quantum complementarity and logical indeterminacy ⋮ Gödel incompleteness and the Black hole information paradox ⋮ From Heisenberg to Gödel via Chaitin ⋮ From Heisenberg to Gödel via Chaitin ⋮ On interpreting Chaitin's incompleteness theorem ⋮ Computational complementarity ⋮ Artificial Intelligence Evolved from Random Behaviour: Departure from the State of the Art
Cites Work
- Heuristic Reasoning in the Theory of Numbers
- A Theory of Program Size Formally Identical to Information Theory
- Algorithmic Information Theory
- A note on monte carlo primality tests and algorithmic information theory
- Information-theoretic computation complexity
- Information-Theoretic Limitations of Formal Systems
- Mathematics and Logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Gödel's theorem and information
