The Limits of Mathematics---Course Outline and Software
G. J. Chaitin
Abstract
A remarkable new definition of a self-delimiting universal Turing machine is presented that is easy to program and runs very quickly. This provides a new foundation for algorithmic information theory. This new universal Turing machine is implemented via software written in Mathematica and C. Using this new software, it is now possible to give a self-contained ``hands on'' mini-course presenting very concretely the latest proofs of the fundamental information-theoretic incompleteness theorems.
Create a lesson
Related papers
Chaotic eigenfunctions in phase space
S. Nonnenmacher, A. Voros
Improved control of delayed measured systems
Jens Christian Claussen, Heinz Georg Schuster
The accurate and comprehensive model of thin fluid flows with inertia on curved substrates
A. J. Roberts, Zhenquan Li
On periodic solutions of a Hamilton-Jacobi equation with periodic forcing
Andrei Sobolevskii
Drifters dispersion in the Adriatic Sea: Lagrangian data and chaotic model
Guglielmo Lacorata, Erik Aurell, Angelo Vulpiani
Generalized multibaker maps for open dissipative systems
Z. Kaufmann, P. Szépfalusy