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

DOI10.1016/0960-0779(93)E0017-6MaRDI QIDQ1346397zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Abstract: Lecture given Thursday 22 October 1992 at a Mathematics-Computer Science Colloquium at the University of New Mexico. The lecture was videotaped; this is an edited transcript.

Cited in

(2)

• Asymptotic behavior and halting probability of Turing machines
• Computers as a source of a posteriori knowledge in mathematics

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

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