Randomness in arithmetic and the decline and fall of reductionism in pure mathematics

DOI10.1016/0960-0779(93)E0017-6zbMath0825.68593arXivchao-dyn/9304002OpenAlexW2093262737WikidataQ127846716 ScholiaQ127846716MaRDI QIDQ1346397

Gregory J. Chaitin

Publication date: 13 November 1995

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/chao-dyn/9304002

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30)

Related Items (2)

Asymptotic behavior and halting probability of Turing machines ⋮ Computers as a Source of A Posteriori Knowledge in Mathematics

Cites Work

• Unnamed Item

This page was built for publication: Randomness in arithmetic and the decline and fall of reductionism in pure mathematics