RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS

DOI10.1142/S0218127494000022zbMath0877.68068MaRDI QIDQ4342261

Gregory J. Chaitin

Publication date: 27 November 1997

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

zbMATH Keywords

algorithmic information theory

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (7)

Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn ⋮ Information-theoretic incompleteness ⋮ LISP program-size complexity. II ⋮ A random number generator based on unpredictable chaotic functions ⋮ The indexed theorem ⋮ The definition of mathematics: philosophical and pedagogical aspects ⋮ Entropic measures, Markov information sources and complexity

Uses Software

• Mathematica

This page was built for publication: RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS