{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "immerman-szelepcsenyi-space-complementation-1988",
    "title": "Immerman and Szelepcsényi: nondeterministic space is closed under complement",
    "summary": "Immerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages.\n\nA nondeterministic computation accepts when at least one possible branch accepts. Merely swapping accept and reject therefore cannot certify that no accepting branch exists: another branch may reject even when the answer is yes. Inductive counting overcomes this obstacle. In the inspected Immerman argument, the machine repeatedly certifies the exact number of configurations reachable within a growing number of steps. A complete count forces any successful enumeration to include every reachable configuration, so it can establish that none is accepting while reusing small workspace. The result shows that these space-bounded classes admit equally space-bounded recognition of their complements. It settles the complement question for context-sensitive languages without equating nondeterministic and deterministic computation, or solving P versus NP. Immerman and Szelepcsényi published independent papers; this record represents the shared closure theorem once, with separate attribution. The scientific body inspected is an author-hosted seven-page Immerman version, not a byte-matched reproduction of either journal article.",
    "boundary": "The theorem concerns nondeterministic space at least logarithmic under the stated machine/space conventions, including NL=coNL. It does not imply NP=coNP or L=NL. Verified reachable counts and finite configuration encoding are essential; flipping nondeterministic outcomes is unsound. Independent Szelepcsényi credit is source-supported, but his complete proof has not been independently reconstructed here.",
    "area": "Computer science",
    "topic": "Computational complexity",
    "year": 1988,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "immerman-szelepcsenyi-space-complementation-1988",
    "target": {
      "record_id": "urn:uuid:73aa3dbb-243d-47b9-a827-1a31670a989c",
      "version": 1,
      "content_hash": "sha256:66924c4401c03a834329dde355ec2852082f3af198135e2a2f7fcaed2196644c"
    },
    "humans": [
      "Neil Immerman",
      "Róbert Szelepcsényi"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "cook-completeness",
      "shamir-ip-equals-pspace-1992",
      "reingold-undirected-connectivity-2008"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-immerman-szelepcsenyi-space-complementation-1988-immerman-author",
        "title": "Immerman: Nondeterministic Space is Closed Under Complementation — author version",
        "url": "https://people.cs.umass.edu/~immerman/pub/space.pdf"
      },
      {
        "id": "wrs24-immerman-szelepcsenyi-space-complementation-1988-immerman-publisher",
        "title": "Immerman — 1988 SIAM publisher metadata",
        "url": "https://api.crossref.org/works/10.1137%2F0217058"
      },
      {
        "id": "wrs24-immerman-szelepcsenyi-space-complementation-1988-szelepcsenyi-publisher",
        "title": "Szelepcsényi — 1988 Acta Informatica publisher identity and abstract",
        "url": "https://link.springer.com/article/10.1007/BF00299636"
      },
      {
        "id": "wrs24-immerman-szelepcsenyi-space-complementation-1988-independent-credit",
        "title": "ACM-SIGACT: original 1995 Gödel Prize independent-proof citation",
        "url": "https://www.sigact.org/prizes/g%C3%B6del/1995.html"
      }
    ],
    "points": "210000",
    "published_grade": {
      "id": "immerman-szelepcsenyi-space-complementation-1988",
      "entry_id": "immerman-szelepcsenyi-space-complementation-1988",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:73aa3dbb-243d-47b9-a827-1a31670a989c",
        "version": 1,
        "content_hash": "sha256:66924c4401c03a834329dde355ec2852082f3af198135e2a2f7fcaed2196644c"
      },
      "what_changed": "Immerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages.",
      "scope": "Immerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages. The theorem concerns nondeterministic space at least logarithmic under the stated machine/space conventions, including NL=coNL. It does not imply NP=coNP or L=NL. Verified reachable counts and finite configuration encoding are essential; flipping nondeterministic outcomes is unsound. Independent Szelepcsényi credit is source-supported, but his complete proof has not been independently reconstructed here.",
      "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:73aa3dbb-243d-47b9-a827-1a31670a989c",
        "version": 1,
        "content_hash": "sha256:66924c4401c03a834329dde355ec2852082f3af198135e2a2f7fcaed2196644c"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00: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": "Neil Immerman",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Immerman: Nondeterministic Space is Closed Under Complementation — author version",
            "url": "https://people.cs.umass.edu/~immerman/pub/space.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Róbert Szelepcsényi",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Immerman: Nondeterministic Space is Closed Under Complementation — author version",
            "url": "https://people.cs.umass.edu/~immerman/pub/space.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Immerman: Nondeterministic Space is Closed Under Complementation — author version",
            "url": "https://people.cs.umass.edu/~immerman/pub/space.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Immerman — 1988 SIAM publisher metadata",
            "url": "https://api.crossref.org/works/10.1137%2F0217058"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-2",
          "kind": "source_reference",
          "source": {
            "citation": "Szelepcsényi — 1988 Acta Informatica publisher identity and abstract",
            "url": "https://link.springer.com/article/10.1007/BF00299636"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-3",
          "kind": "source_reference",
          "source": {
            "citation": "ACM-SIGACT: original 1995 Gödel Prize independent-proof citation",
            "url": "https://www.sigact.org/prizes/g%C3%B6del/1995.html"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The theorem concerns nondeterministic space at least logarithmic under the stated machine/space conventions, including NL=coNL. It does not imply NP=coNP or L=NL. Verified reachable counts and finite configuration encoding are essential; flipping nondeterministic outcomes is unsound. Independent Szelepcsényi credit is source-supported, but his complete proof has not been independently reconstructed here.",
        "domain": "Computer science"
      },
      "sources": [
        {
          "citation": "Immerman: Nondeterministic Space is Closed Under Complementation — author version",
          "url": "https://people.cs.umass.edu/~immerman/pub/space.pdf"
        },
        {
          "citation": "Immerman — 1988 SIAM publisher metadata",
          "url": "https://api.crossref.org/works/10.1137%2F0217058"
        },
        {
          "citation": "Szelepcsényi — 1988 Acta Informatica publisher identity and abstract",
          "url": "https://link.springer.com/article/10.1007/BF00299636"
        },
        {
          "citation": "ACM-SIGACT: original 1995 Gödel Prize independent-proof citation",
          "url": "https://www.sigact.org/prizes/g%C3%B6del/1995.html"
        }
      ],
      "statement": "# Immerman and Szelepcsényi: nondeterministic space is closed under complement\n\nImmerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages.\n\nA nondeterministic computation accepts when at least one possible branch accepts. Merely swapping accept and reject therefore cannot certify that no accepting branch exists: another branch may reject even when the answer is yes. Inductive counting overcomes this obstacle. In the inspected Immerman argument, the machine repeatedly certifies the exact number of configurations reachable within a growing number of steps. A complete count forces any successful enumeration to include every reachable configuration, so it can establish that none is accepting while reusing small workspace. The result shows that these space-bounded classes admit equally space-bounded recognition of their complements. It settles the complement question for context-sensitive languages without equating nondeterministic and deterministic computation, or solving P versus NP. Immerman and Szelepcsényi published independent papers; this record represents the shared closure theorem once, with separate attribution. The scientific body inspected is an author-hosted seven-page Immerman version, not a byte-matched reproduction of either journal article.\n\n## Scientific scope\n\nThe theorem concerns nondeterministic space at least logarithmic under the stated machine/space conventions, including NL=coNL. It does not imply NP=coNP or L=NL. Verified reachable counts and finite configuration encoding are essential; flipping nondeterministic outcomes is unsound. Independent Szelepcsényi credit is source-supported, but his complete proof has not been independently reconstructed here.\n\n## People and systems\n\nNeil Immerman; Róbert Szelepcsényi\n\n\n\n## Original sources\n\n- [Immerman: Nondeterministic Space is Closed Under Complementation — author version](https://people.cs.umass.edu/~immerman/pub/space.pdf)\n- [Immerman — 1988 SIAM publisher metadata](https://api.crossref.org/works/10.1137%2F0217058)\n- [Szelepcsényi — 1988 Acta Informatica publisher identity and abstract](https://link.springer.com/article/10.1007/BF00299636)\n- [ACM-SIGACT: original 1995 Gödel Prize independent-proof citation](https://www.sigact.org/prizes/g%C3%B6del/1995.html)\n",
      "summary": "Immerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages.\n\nA nondeterministic computation accepts when at least one possible branch accepts. Merely swapping accept and reject therefore cannot certify that no accepting branch exists: another branch may reject even when the answer is yes. Inductive counting overcomes this obstacle. In the inspected Immerman argument, the machine repeatedly certifies the exact number of configurations reachable within a growing number of steps. A complete count forces any successful enumeration to include every reachable configuration, so it can establish that none is accepting while reusing small workspace. The result shows that these space-bounded classes admit equally space-bounded recognition of their complements. It settles the complement question for context-sensitive languages without equating nondeterministic and deterministic computation, or solving P versus NP. Immerman and Szelepcsényi published independent papers; this record represents the shared closure theorem once, with separate attribution. The scientific body inspected is an author-hosted seven-page Immerman version, not a byte-matched reproduction of either journal article.",
      "title": "Immerman and Szelepcsényi: nondeterministic space is closed under complement"
    },
    "record_id": "urn:uuid:73aa3dbb-243d-47b9-a827-1a31670a989c",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:73aa3dbb-243d-47b9-a827-1a31670a989c",
      "version": 1,
      "content_hash": "sha256:66924c4401c03a834329dde355ec2852082f3af198135e2a2f7fcaed2196644c"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:7df68ecc467ec272d1da26d45782d1a87a3d09cff3729297ce7a2f3bd20186f5"
  },
  "target": {
    "record_id": "urn:uuid:73aa3dbb-243d-47b9-a827-1a31670a989c",
    "version": 1,
    "content_hash": "sha256:66924c4401c03a834329dde355ec2852082f3af198135e2a2f7fcaed2196644c"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "immerman-szelepcsenyi-space-complementation-1988",
    "entry_id": "immerman-szelepcsenyi-space-complementation-1988",
    "revision": 1,
    "title": "Immerman and Szelepcsényi: nondeterministic space is closed under complement",
    "context": "Computer science",
    "track": "Computer science",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Immerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages.",
    "scope": "Immerman and Szelepcsényi independently established that nondeterministic space at least logarithmic in input length is closed under complement, including NL = co-NL and complement closure of context-sensitive languages. The theorem concerns nondeterministic space at least logarithmic under the stated machine/space conventions, including NL=coNL. It does not imply NP=coNP or L=NL. Verified reachable counts and finite configuration encoding are essential; flipping nondeterministic outcomes is unsound. Independent Szelepcsényi credit is source-supported, but his complete proof has not been independently reconstructed here.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Immerman: Nondeterministic Space is Closed Under Complementation — author version",
        "url": "https://people.cs.umass.edu/~immerman/pub/space.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Immerman — 1988 SIAM publisher metadata",
        "url": "https://api.crossref.org/works/10.1137%2F0217058",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Szelepcsényi — 1988 Acta Informatica publisher identity and abstract",
        "url": "https://link.springer.com/article/10.1007/BF00299636",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "ACM-SIGACT: original 1995 Gödel Prize independent-proof citation",
        "url": "https://www.sigact.org/prizes/g%C3%B6del/1995.html",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Neil Immerman",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Róbert Szelepcsényi",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:73aa3dbb-243d-47b9-a827-1a31670a989c",
      "version": 1,
      "content_hash": "sha256:66924c4401c03a834329dde355ec2852082f3af198135e2a2f7fcaed2196644c"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "210000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}