Project Sherlock

Mathematics · Foundations & Logic

Nonstandard Analysis

A topic within Foundations & Logic, itself one of 12 topics in that field and part of Mathematics.

Reading for Foundations & Logic

1

Go deeper

Primary sources and full treatments.

  • On 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.

    Paper

Other topics in Foundations & Logic