SWhat changed
Church connected effective calculation with formal notions of definability and established an undecidability result in elementary number theory. This helped turn the limits of computation into mathematical questions with explicit definitions.
Scientific scope
Church connected effective calculation with formal notions of definability and established an undecidability result in elementary number theory. This helped turn the limits of computation into mathematical questions with explicit definitions. Scope limitation: The formal undecidability theorem is distinct from the Church–Turing thesis identifying informal effective computation with a formal model. This source is a separate contribution from Turing’s machine-based work, not a second count of that paper.
Evidence
Assessment uses the catalogue-linked source evidence for the stated contribution. The formal undecidability theorem is distinct from the Church–Turing thesis identifying informal effective computation with a formal model. This source is a separate contribution from Turing’s machine-based work, not a second count of that paper.
Contributors
- Alonzo Church · SCIENCE: Named source contributor; exact labor shares are not measured.
- An Unsolvable Problem of Elementary Number Theory
- An Unsolvable Problem of Elementary Number Theory — deposited bibliography
- Church, An Unsolvable Problem of Elementary Number Theory
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction