What is recorded here?
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.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
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.
Read the original work
- An Unsolvable Problem of Elementary Number Theory
- An Unsolvable Problem of Elementary Number Theory — deposited bibliography
- Church, An Unsolvable Problem of Elementary Number Theory
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Alonzo Church
Source-paper byline retained. This is not a complete roster of a lifetime project or verified unique person identities.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: United States
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
Church: a precisely stated problem without an effective general solution
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
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.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Alonzo Church
Source-paper byline retained. This is not a complete roster of a lifetime project or verified unique person identities.