scientific article

zbMath1015.00502MaRDI QIDQ3995518

Gregory J. Chaitin

Publication date: 23 January 1993

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Collected or selected works; reprintings or translations of classics (01A75) Information theory (general) (94A15) Recursive functions and relations, subrecursive hierarchies (03D20) Collections of reprinted articles (00B60)

Related Items (36)

Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable ⋮ Complex systems, complexity measures, grammars and model-inferring ⋮ Randomness and reducibility ⋮ Randomness in arithmetic and the decline and fall of reductionism in pure mathematics ⋮ Is complexity a source of incompleteness? ⋮ Natural halting probabilities, partial randomness, and zeta functions ⋮ Randomness and universal machines ⋮ Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn ⋮ Physical versus computational complementarity. I ⋮ Randnomness, computability, and algebraic specifications ⋮ Language-theoretic complexity of disjunctive sequences ⋮ Probabilistic issues in statistical mechanics ⋮ COMPLEXITY, INFORMATION, ENERGY ⋮ Towards an algorithmic theory of adaptation ⋮ Patterns in chaos ⋮ High end complexity ⋮ Epistemic horizons and the foundations of quantum mechanics ⋮ LISP program-size complexity ⋮ Compressibility, laws of nature, initial conditions and complexity ⋮ Information-theoretic incompleteness ⋮ LISP program-size complexity. II ⋮ LISP program-size complexity. III ⋮ LISP program-size complexity. IV ⋮ Computational universes ⋮ Transition matrix analysis of earthquake magnitude sequences ⋮ Predictability: a way to characterize complexity ⋮ The problem of survival from an algorithmic point of view ⋮ Is independence an exception? ⋮ Information: The Algorithmic Paradigm ⋮ From Heisenberg to Gödel via Chaitin ⋮ From Heisenberg to Gödel via Chaitin ⋮ When van Lambalgen’s Theorem fails ⋮ Self-referential noise and the synthesis of three-dimensional space ⋮ Entropic measures, Markov information sources and complexity ⋮ Process physics: Inertia, gravity and the quantum ⋮ Data compression and learning in time sequences analysis

This page was built for publication: