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)
03A05: Philosophical and critical aspects of logic and foundations
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03F30: First-order arithmetic and fragments
94A15: Information theory (general)
Related Items
Predictability: a way to characterize complexity, From Heisenberg to Gödel via Chaitin, From Heisenberg to Gödel via Chaitin, Quantum complementarity and logical indeterminacy, Computational complementarity, A Suppes predicate for general relativity and set-theoretically generic spacetimes, Markov chain network training and conservation law approximations: Linking microscopic and macroscopic models for evolution, Algorithmically independent sequences, Gödel incompleteness and the Black hole information paradox, Incompleteness theorems for random reals, Random problems, Undecidability and incompleteness in classical mechanics, Information-theoretic incompleteness, LISP program-size complexity. II, On interpreting Chaitin's incompleteness theorem, Predictability in deterministic theories, Undecidability and chaos in word-coded symbolic dynamics, What is context for? Syntax in a non-abstract world, Is complexity a source of incompleteness?, More really is different, On explicating the concept `the power of an arithmetical theory', Algorithmically Independent Sequences, Quantum Experiments Can Test Mathematical Undecidability
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
