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 give a self-contained “hands on” mini-course presenting very concretely the latest proofs of the fundamental information-theoretic incompleteness theorems. (To obtain this 127-page report in LATEX via e-mail, please contact chaitin at watson.ibm.com.)
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaitin, G.J. (1995). The limits of mathematics course outline and software. In: Andersson, S.I. (eds) Analysis of Dynamical and Cognitive Systems. Lecture Notes in Computer Science, vol 888. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58843-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-58843-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58843-6
Online ISBN: 978-3-540-49113-2
eBook Packages: Springer Book Archive