RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS

DOI10.1142/S0218127494000022MaRDI QIDQ4342261zbMATH OpenFDO

Authors Gregory J. Chaitin

Publication date 27 November 1997

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218127494000022

zbMATH Keywords

algorithmic information theory

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 44959
• scientific article; zbMATH DE number 1163978
• Incompleteness theorems for random reals

Cited in

(14)

• Information-theoretic incompleteness
• LISP program-size complexity. II
• Mathematical metaphysics of randomness
• A random number generator based on unpredictable chaotic functions
• Entropic measures, Markov information sources and complexity
• The indexed theorem
• The definition of mathematics: philosophical and pedagogical aspects
• scientific article; zbMATH DE number 1195809 (Why is no real title available?)
• scientific article; zbMATH DE number 1257650 (Why is no real title available?)
• Responses to ``Theoretical Mathematics: Toward\\ a cultural synthesis of mathematics and\\ theoretical physics, by A. Jaffe and F. Quinn
• scientific article; zbMATH DE number 1163978 (Why is no real title available?)
• scientific article; zbMATH DE number 1834658 (Why is no real title available?)
• Randomness, pseudorandomness and models of arithmetic
• scientific article; zbMATH DE number 969633 (Why is no real title available?)

Describes a project that uses

Uses Software

• Mathematica

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

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