Prior Art — Computation and Complexity
Prior-art cluster pa000002 — Computation and Complexity: 10 representative references and 3 structural-challenge edges curated from the central bibliography.
Cluster ID: pa000002 · 22 bibliography entries in domain
Computation and Complexity
Classical complexity theory, computability, and the foundational catalogue of NP-complete problems. The cluster is intentionally small in the corpus — the program engages computation primarily via the τ-Tower Machine internal model and the τ-internal P=NP collapse theorem, which is explicitly NOT a resolution of the Clay P vs NP problem in the standard Turing-machine model (see Red-team FAQ #4). Reviewers wanting to interrogate the τ-internal computational substrate against the Cook–Levin / Karp / Garey–Johnson lineage should use this cluster as their bibliography starting point.
Representative references
Curated subset (10 of 22 domain entries) — the most-cited and canonical works in this cluster. The full set is enumerable via the Bibliography browse surface.
Where this cluster bears on the program
Construction-spine steps the cluster's prior art most directly engages.
Related structural challenges
Structural Challenge Ledger items where this cluster's prior art is part of the obligation surface. Each link goes to the canonical SCL item; from there, the paired Challenge Response on the Results lane shows the program's current τ response.
SCL items resolve via the Structural Challenge Ledger; the corresponding Challenge Responses live on the Results-side projection.
For fuller editorial comparisons
The cluster surface here is the machine-readable backbone. For narrative comparisons against specific approach families — shared pressure, distinguishing claim, remaining burden — see the Deep Comparison briefing, which carries the editorial work and will continue to expand as more comparisons are authored.
Save or share this page for inspection
Download a portable dossier, copy a reviewer note, or send this page to someone who can inspect it.