{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "church-undecidability",
    "title": "Church: a precisely stated problem without an effective general solution",
    "summary": "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.",
    "boundary": "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.",
    "area": "Computability",
    "topic": "Computing & AI",
    "year": 1936,
    "lane": "HUMAN",
    "result": "LIMITATION",
    "package_id": "church-undecidability",
    "target": {
      "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
      "version": 1,
      "content_hash": "sha256:7b27ff316ce9a6f691825b7212605ee3822c1c064f13e39065d2314322b11900"
    },
    "humans": [
      "Alonzo Church"
    ],
    "authors_complete": true,
    "human_role_note": "Source-paper byline retained. This is not a complete roster of a lifetime project or verified unique person identities.",
    "agents": [],
    "related": [
      "turing",
      "godel"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "hf13-paper-church-undecidability",
        "title": "An Unsolvable Problem of Elementary Number Theory",
        "url": "https://doi.org/10.2307/2371045"
      },
      {
        "id": "hf13-metadata-church-undecidability",
        "title": "An Unsolvable Problem of Elementary Number Theory — deposited bibliography",
        "url": "https://api.crossref.org/works/10.2307%2F2371045"
      },
      {
        "id": "hf13-reading-church-undecidability-0",
        "title": "Church, An Unsolvable Problem of Elementary Number Theory",
        "url": "https://doi.org/10.2307/2371045"
      }
    ],
    "geography": {
      "country_codes": [
        "US"
      ],
      "location_basis": "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.",
      "source_url": "https://findingaids.library.upenn.edu/records/PRIN_MUDD_C0948",
      "target": {
        "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
        "version": 1,
        "content_hash": "sha256:7b27ff316ce9a6f691825b7212605ee3822c1c064f13e39065d2314322b11900"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://findingaids.library.upenn.edu/records/PRIN_MUDD_C0948"
        },
        {
          "title": "Attribution source",
          "url": "https://phil415.pbworks.com/f/Church.pdf"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "220000",
    "published_grade": {
      "id": "church-undecidability",
      "entry_id": "church-undecidability",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
        "version": 1,
        "content_hash": "sha256:7b27ff316ce9a6f691825b7212605ee3822c1c064f13e39065d2314322b11900"
      },
      "what_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.",
      "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.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
        "version": 1,
        "content_hash": "sha256:7b27ff316ce9a6f691825b7212605ee3822c1c064f13e39065d2314322b11900"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-09-13T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Alonzo Church",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "An Unsolvable Problem of Elementary Number Theory",
            "url": "https://doi.org/10.2307/2371045"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "An Unsolvable Problem of Elementary Number Theory",
            "url": "https://doi.org/10.2307/2371045"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "An Unsolvable Problem of Elementary Number Theory — deposited bibliography",
            "url": "https://api.crossref.org/works/10.2307%2F2371045"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-2",
          "kind": "source_reference",
          "source": {
            "citation": "Church, An Unsolvable Problem of Elementary Number Theory",
            "url": "https://doi.org/10.2307/2371045"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "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.",
        "domain": "Computability"
      },
      "sources": [
        {
          "citation": "An Unsolvable Problem of Elementary Number Theory",
          "url": "https://doi.org/10.2307/2371045"
        },
        {
          "citation": "An Unsolvable Problem of Elementary Number Theory — deposited bibliography",
          "url": "https://api.crossref.org/works/10.2307%2F2371045"
        },
        {
          "citation": "Church, An Unsolvable Problem of Elementary Number Theory",
          "url": "https://doi.org/10.2307/2371045"
        }
      ],
      "statement": "# Church: a precisely stated problem without an effective general solution\n\nChurch 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.\n\n## Scientific scope\n\nThe 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.\n\n## Reading status\n\nThis 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.\n\n## People and systems\n\nAlonzo Church\n\nSource-paper byline retained. This is not a complete roster of a lifetime project or verified unique person identities.\n\n\n\n## Original sources\n\n- [An Unsolvable Problem of Elementary Number Theory](https://doi.org/10.2307/2371045)\n- [An Unsolvable Problem of Elementary Number Theory — deposited bibliography](https://api.crossref.org/works/10.2307%2F2371045)\n- [Church, An Unsolvable Problem of Elementary Number Theory](https://doi.org/10.2307/2371045)\n",
      "summary": "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.",
      "title": "Church: a precisely stated problem without an effective general solution"
    },
    "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
      "version": 1,
      "content_hash": "sha256:7b27ff316ce9a6f691825b7212605ee3822c1c064f13e39065d2314322b11900"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:1eac19a398274428de9108cfa3bdf19d5acd2fcbc188750cfcec5f28d9fd8f2f"
  },
  "target": {
    "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
    "version": 1,
    "content_hash": "sha256:7b27ff316ce9a6f691825b7212605ee3822c1c064f13e39065d2314322b11900"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "church-undecidability",
    "entry_id": "church-undecidability",
    "revision": 1,
    "title": "Church: a precisely stated problem without an effective general solution",
    "context": "Computability",
    "track": "Scoped scientific or research-capability contribution",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-14",
    "evidence_cutoff": "2026-09-14",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_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.",
    "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_summary": "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.",
    "references": [
      {
        "title": "An Unsolvable Problem of Elementary Number Theory",
        "url": "https://doi.org/10.2307/2371045",
        "locator": "Retained catalogue source evidence; Exact DOI and deposited bibliography; content-reading scope is recorded on the accompanying sources."
      },
      {
        "title": "An Unsolvable Problem of Elementary Number Theory — deposited bibliography",
        "url": "https://api.crossref.org/works/10.2307%2F2371045",
        "locator": "Retained catalogue source evidence; Retained response bytes and source byline; deposits can omit authors and reprint dates differ from original contribution dates."
      },
      {
        "title": "Church, An Unsolvable Problem of Elementary Number Theory",
        "url": "https://doi.org/10.2307/2371045",
        "locator": "Retained catalogue source evidence; Original publication identity and scoped theorem description; full proof and historical priority audit not performed."
      }
    ],
    "roles": [
      {
        "who": "Alonzo Church",
        "credit": "SCIENCE",
        "did": "Named source contributor; exact labor shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:305e45a2-2d7b-4161-a685-d8198b32dd89",
      "version": 1,
      "content_hash": "sha256:7b27ff316ce9a6f691825b7212605ee3822c1c064f13e39065d2314322b11900"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "220000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}