Alan Turing · 1936
On Computable Numbers, with an Application to the Entscheidungsproblem
- Language
- English
- Form
- Periodical
- Text
- In copyright
- English
- English original
- Selected
- Ben Breen, 2026-09-29; suggested by Claude research agents, 29 Sep 2026
- Status
- Arguments unverified; quotations chosen by machine, unchecked
Q10JUDGMENT
Can a fixed procedure for reasoning settle a disagreement when the participants accept the same premises?No. no general decision procedure exists. Proves that no general mechanical procedure can decide, for every statement of first-order logic, whether it follows from given axioms.
Proceedings of the London Mathematical Society s2-42 (submitted Nov 1936, issue dated 1936-37), pp. 230-265 (OUP, Wiley). No public-domain status confirmed, so no link.