Science Atlas

How We Know What We Know
Sources

On Computable Numbers, with an Application to the Entscheidungsproblem

Proceedings of the London Mathematical Society

Citation Formats

General Reference

APA Style

BibTeX

Alan Turing's 1936 paper, received by the Society in May 1936 and printed in its 1936 to 1937 volume, defining the abstract Turing machine and using it to prove the halting problem undecidable, published in the Proceedings of the London Mathematical Society, series 2, volume 42, pages 230 to 265.

Facts
Author
Alan Turing
Publisher
Proceedings of the London Mathematical Society
Publication Year
1936
Source Type
Journal article
Reliability Tier
1
The primary published paper defining the Turing machine and proving the halting problem, the theory's own foundational source, its volume and page numbers cross-checked against more than one independent citation during research.
Sources
On Computable Numbers, with an Application to the Entscheidungsproblem
Alan Turing, Proceedings of the London Mathematical Society, 1936
Claims Backed By This Source (12 claims)

This source backs 12 claims across the atlas. As facts: 9 well-attested. As cited relationships: 1 holds, 1 connected. Plus 1 entities citing it as a general reference with no single fact or relationship attached.

Disposition By Topic

  • Sources, 6 claims: 6 well-attested.
  • Theories, 5 claims: 3 well-attested, 1 connected, 1 general references.
  • Scientists, 1 claims: 1 holds.

Holds

1

Scientists

Connected

1

General References

1
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.

View At A Past Year

The atlas records no dated fact of its own for this entry, so there is no other year to choose.