{"query": "S. A. Cook 1971 — The complexity of theorem-proving procedur", "count": 20, "results": [{"id": "card_theory_g_del_s_incompleteness_theorems", "title": "Gödel's incompleteness theorems", "shelf": "theories", "surface": "secular", "snippet": "Gödel's incompleteness theorems — an engine domain that can touch it: formal_logic. Calibration: map-only — a meta-theorem about systems, not a sealable computation. FIRST (1931): any consistent forma", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_requisite_variety", "title": "Ashby's law of requisite variety (the humility theorem)", "shelf": "theories", "surface": "secular", "snippet": "Ashby's law of requisite variety (the humility theorem) — an engine domain that can touch it: operations_research. Calibration: map-only — a structural bound, stated in variety counts rather than comp", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_fundamental_theorem_of_calculus", "title": "Fundamental theorem of calculus", "shelf": "theories", "surface": "secular", "snippet": "Fundamental theorem of calculus — an engine domain that can touch it: mathematics. Calibration: seals. Differentiation and integration are inverse operations. Part one: the derivative of the accumulat", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_fixed_point_theorems__brouwer__kakutani", "title": "Fixed-point theorems (Brouwer, Kakutani)", "shelf": "theories", "surface": "secular", "snippet": "Fixed-point theorems (Brouwer, Kakutani) — an engine domain that can touch it: mathematics. Calibration: map-only — an existence proof, not a computation. Brouwer: any continuous map of a convex compa", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_kolmogorov_complexity", "title": "Algorithmic information (Kolmogorov complexity)", "shelf": "theories", "surface": "secular", "snippet": "Algorithmic information (Kolmogorov complexity) — an engine domain that can touch it: computer_science. Calibration: map-only — out of scope for sealing — foundational, empirical or interpretive (RESO", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_theory_pythagorean_theorem", "title": "Pythagorean theorem", "shelf": "theories", "surface": "secular", "snippet": "Pythagorean theorem — an engine domain that can touch it: geometry. Calibration: seals. In a right triangle, a² + b² = c². Known in practice to Babylonian and Egyptian builders long before its Greek p", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_fundamental_theorem_of_arithmetic", "title": "Fundamental theorem of arithmetic (unique factorization)", "shelf": "theories", "surface": "secular", "snippet": "Fundamental theorem of arithmetic (unique factorization) — an engine domain that can touch it: number_theory. Calibration: seals. Every integer greater than 1 is a product of primes in exactly one way", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_quantum_error_correction", "title": "Quantum error correction & the threshold theorem", "shelf": "theories", "surface": "secular", "snippet": "Quantum error correction & the threshold theorem — an engine domain that can touch it: quantum_computing. Calibration: partial — specific relations verify; the theory as a whole is not a sealable comp", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_theory_computational_complexity__p__np__reductions", "title": "Computational complexity (P, NP, reductions)", "shelf": "theories", "surface": "secular", "snippet": "Computational complexity (P, NP, reductions) — an engine domain that can touch it: computer_science. Calibration: map-only — P vs NP is open, and this card says so. Not whether a problem can be solved", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_central_limit_theorem", "title": "Central limit theorem", "shelf": "theories", "surface": "secular", "snippet": "Central limit theorem — an engine domain that can touch it: statistics. Calibration: partial — sampling checks verify; the asymptotic claim is map-only. Add up many independent random quantities with ", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_src_word_theorem", "title": "theorem", "shelf": "dictionary", "surface": "secular", "snippet": "1. That which is considered and established as a principle; hence, sometimes, a rule. Not theories, but theorems (Coleridge. By the theorems, Which your polite and terser gallants practice, I re-refin", "authority_tier": "reference", "source": "webster-1913", "readable": false, "generated": false}, {"id": "card_theory_noether_s_theorem__symmetry_and_conservation", "title": "Noether's theorem (symmetry and conservation)", "shelf": "theories", "surface": "secular", "snippet": "Noether's theorem (symmetry and conservation) — an engine domain that can touch it: physics. Calibration: map-only — out of scope for sealing — foundational, empirical or interpretive (RESONANCE); for", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_arrow_impossibility_theorem", "title": "Arrow's impossibility theorem", "shelf": "theories", "surface": "secular", "snippet": "Arrow's impossibility theorem — an engine domain that can touch it: governance. Calibration: map-only — out of scope for sealing — foundational, empirical or interpretive (RESONANCE). No ranked voting", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_theory_fundamental_theorem_of_algebra", "title": "Fundamental theorem of algebra", "shelf": "theories", "surface": "secular", "snippet": "Fundamental theorem of algebra — an engine domain that can touch it: mathematics. Calibration: partial — root counts verify; the existence proof is map-only. Every non-constant polynomial with complex", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_bayes_theorem", "title": "Bayes' theorem", "shelf": "theories", "surface": "secular", "snippet": "Bayes' theorem — an engine domain that can touch it: probability. Calibration: seals. P(H|E) = P(E|H)·P(H) / P(E). How to update a belief when evidence arrives: posterior ∝ likelihood × prior. A trivi", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_group_theory", "title": "Group theory & symmetry (the mathematics of what stays the same)", "shelf": "theories", "surface": "secular", "snippet": "Group theory & symmetry (the mathematics of what stays the same) — an engine domain that can touch it: mathematics. Calibration: seals — group orders, subgroup structure and symmetry counts compute. A", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_src_mill_cook_1971", "title": "S. A. Cook 1971 — The complexity of theorem-proving procedures", "shelf": "millennium", "surface": "secular", "snippet": "S. A. Cook (1971). The complexity of theorem-proving procedures. Proc. 3rd ACM STOC (1971) 151–158. DOI 10.1145/800157.805047. Canonical: https://doi.org/10.1145/800157.805047. Free copy: https://www.", "authority_tier": "reference", "source": "S. A. Cook (1971), Proc. 3rd ACM STOC (1971) 151–158", "readable": false, "generated": false}, {"id": "card_theory_coase_theorem", "title": "The Coase theorem (law & economics)", "shelf": "theories", "surface": "secular", "snippet": "The Coase theorem (law & economics) — an engine domain that can touch it: law. Calibration: partial — specific relations verify; the theory as a whole is not a sealable computation. With clear propert", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_theory_spectral_geometry", "title": "Spectral geometry (can one hear the shape of a drum?)", "shelf": "theories", "surface": "secular", "snippet": "Spectral geometry (can one hear the shape of a drum?) — an engine domain that can touch it: mathematics. Calibration: partial — specific relations verify; the theory as a whole is not a sealable compu", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (lone-domain seeding)", "readable": false, "generated": false}, {"id": "card_theory_shannon_information_theory", "title": "Shannon information theory (entropy, channel capacity)", "shelf": "theories", "surface": "secular", "snippet": "Shannon information theory (entropy, channel capacity) — an engine domain that can touch it: information_theory. Calibration: seals. H = -Σ p log p. Information is measured by how much UNCERTAINTY a m", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_theory_g_del_s_incompleteness_theorems"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}