Foundations & Logic
What mathematics rests on, and the limits of what it can prove about itself.
12 topics · 1 curated work
Topics
Curated reading
1Go deeper
Primary sources and full treatments.
- PaperOn Computable Numbers, with an Application to the EntscheidungsproblemAlan Turing, 1936· 36 pages
Defines the universal machine and proves the halting problem undecidable — the founding document of computer science.