The Limits of Mathematics---Course Outline and Software
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.