{"query": "Hartmanis 1965 — On the computational complexity of algorith", "count": 20, "results": [{"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_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_chain_hartmanis_stearns_1965", "title": "Hartmanis 1965 — On the computational complexity of algorithms", "shelf": "codex", "surface": "secular", "snippet": "J. Hartmanis, R. E. Stearns (1965). On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965) 285–306. DOI 10.1090/S0002-9947-1965-0170805-7. Canonical: https://doi.org/10.1090", "authority_tier": "reference", "source": "J. Hartmanis, R. E. Stearns (1965), Trans. Amer. Math. Soc. 117 (1965) 285–306", "readable": false, "generated": false}, {"id": "card_theory_combinatorial_enumeration", "title": "Combinatorial enumeration (permutations, combinations, binomial)", "shelf": "theories", "surface": "secular", "snippet": "Combinatorial enumeration (permutations, combinations, binomial) — an engine domain that can touch it: combinatorics. Calibration: seals. Counting arrangements without listing them. Permutations when ", "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_church_turing_thesis_computability", "title": "Church–Turing thesis / computability", "shelf": "theories", "surface": "secular", "snippet": "Church–Turing thesis / computability — an engine domain that can touch it: computer_science. Calibration: map-only — a thesis, not a theorem. Everything effectively computable is computable by a Turin", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_src_openstax_introduction_computer_science_summary_142dcb23", "title": "Summary — Introduction to Computer Science", "shelf": "reference", "surface": "secular", "snippet": "Summary\n\n2.1\n\nComputational Thinking\n\nComplex problems are situations that are difficult because they involve many different parts or factors.\n\nComputational thinking means breaking these problems int", "authority_tier": "reference", "source": "OpenStax: Introduction to Computer Science (CC-BY 4.0)", "readable": false, "generated": false}, {"id": "card_theory_emergence", "title": "Emergence & self-organization (more is different)", "shelf": "theories", "surface": "secular", "snippet": "Emergence & self-organization (more is different) — an engine domain that can touch it: physics. Calibration: map-only — a structural claim about levels, not a computation. A system has properties non", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_src_mill_troyer_wiese_2005", "title": "M. Troyer 2005 — Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations", "shelf": "millennium", "surface": "secular", "snippet": "M. Troyer, U.-J. Wiese (2005). Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations. Phys. Rev. Lett. 94 (2005) 170201. DOI 10.1103/PhysRevLett.94.170201. ", "authority_tier": "reference", "source": "M. Troyer, U.-J. Wiese (2005), Phys. Rev. Lett. 94 (2005) 170201", "readable": false, "generated": false}, {"id": "card_src_pron_computational", "title": "computational", "shelf": "pronunciation", "surface": "secular", "snippet": "computational: pronounced (ARPABET) K AA2 M P Y UW0 T EY1 SH AH0 N AH0 L. From the CMU Pronouncing Dictionary — the standard machine-readable pronunciations of North American English.", "authority_tier": "reference", "source": "CMU Pronouncing Dictionary (cmudict) — BSD-2-Clause, Carnegie Mellon", "readable": false, "generated": false}, {"id": "card_src_etym_complexity", "title": "complexity", "shelf": "etymology", "surface": "secular", "snippet": "complexity: etymology (Webster 1913) — n.: [Cf. F. complexité.]. From Webster's Revised Unabridged Dictionary (1913), public domain.", "authority_tier": "reference", "source": "Webster's Revised Unabridged Dictionary (1913), Project Gutenberg eBook #29765 — public domain", "readable": true, "generated": false}, {"id": "card_src_mill_fghk_2016", "title": "M. G. Find 2016 — A better-than-3n lower bound for the circuit complexity of an explicit function", "shelf": "millennium", "surface": "secular", "snippet": "M. G. Find, A. Golovnev, E. A. Hirsch, A. S. Kulikov (2016). A better-than-3n lower bound for the circuit complexity of an explicit function. Proc. 57th IEEE FOCS (2016) 89–98; ECCC TR15-166 (2015, re", "authority_tier": "reference", "source": "M. G. Find, A. Golovnev, E. A. Hirsch, A. S. Kulikov (2016), Proc. 57th IEEE FOCS (2016) 89–98; ECCC TR15-166 (2015, revised 2022 as 'Improving 3n circuit complexity lower bounds')", "readable": false, "generated": false}, {"id": "card_bridge_theory_kolmogorov_complexity__church_turing_thesis_computability", "title": "Bridge: Algorithmic information (Kolmogorov complexity)  ↔  Church–Turing thesis / computability", "shelf": "bridges", "surface": "secular", "snippet": "Algorithmic information (Kolmogorov complexity) and Church–Turing thesis / computability are the same form in different domains. its uncomputability is a Turing-halting result in disguise", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_src_pron_complexity", "title": "complexity", "shelf": "pronunciation", "surface": "secular", "snippet": "complexity: pronounced (ARPABET) K AH0 M P L EH1 K S AH0 T IY0; also K AH0 M P L EH1 K S IH0 T IY0. From the CMU Pronouncing Dictionary — the standard machine-readable pronunciations of North American", "authority_tier": "reference", "source": "CMU Pronouncing Dictionary (cmudict) — BSD-2-Clause, Carnegie Mellon", "readable": false, "generated": false}, {"id": "card_src_fed_nasa_techdoc_19820015599", "title": "Computational Aspects of Heat Transfer in Structures", "shelf": "science", "surface": "secular", "snippet": "Computational Aspects of Heat Transfer in Structures. A United States federal publication, public domain (17 USC 105). The full text (984,295 bytes) is held on the ark; waybill sha256 fa07abaecb1cb66d", "authority_tier": "reference", "source": "NASA technical documents (PD, 17 USC 105)", "readable": true, "generated": false}, {"id": "card_src_fed_nasa_techdoc_20040182258", "title": "Fourth Computational Aeroacoustics (CAA) Workshop on Benchmark Problems", "shelf": "science", "surface": "secular", "snippet": "Fourth Computational Aeroacoustics (CAA) Workshop on Benchmark Problems. A United States federal publication, public domain (17 USC 105). The full text (961,191 bytes) is held on the ark; waybill sha2", "authority_tier": "reference", "source": "NASA technical documents (PD, 17 USC 105)", "readable": true, "generated": false}, {"id": "card_calc_v_verify_space_complexity", "title": "Space complexity", "shelf": "calculations", "surface": "secular", "snippet": "Space complexity — computer_science. Formula: S(n) ~ n^k. Canonical FORM: power_law (y = a * x^k) — engine verifier verify_space_complexity — the deterministic check the concordance runs. Same form, d", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_calc_v_verify_runtime_complexity", "title": "Runtime complexity", "shelf": "calculations", "surface": "secular", "snippet": "Runtime complexity — computer_science. Formula: T(n) ~ n^k (log-log fit). Canonical FORM: power_law (y = a * x^k) — engine verifier verify_runtime_complexity — the deterministic check the concordance ", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_sys_oneway_function", "title": "The one-way function — the computational rectifier", "shelf": "systems", "surface": "secular", "snippet": "Some computations are cheap one way and infeasible the reverse. A one-way function is easy to evaluate (polynomial time) but computationally infeasible to invert; a TRAPDOOR one-way function adds a se", "authority_tier": "reference", "source": "The recurring form — the system analogies (standard engineering) + the design they witness to", "readable": false, "generated": false}, {"id": "card_floor_p_vs_np", "title": "The P versus NP chain - from the machine and the circuit to the three barriers", "shelf": "codex", "surface": "secular", "snippet": "Two trees. Computability: Turing's machine (1936), time as a resource (Hartmanis-Stearns 1965), feasible as polynomial in the input's length (Cobham 1965, Edmonds 1965). Circuits: Shannon's count of g", "authority_tier": "engine_derived", "source": "Narrow Highway - a chain on the one map (operator seed)", "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_computational_complexity__p__np__reductions"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}