{"query": "Computer science", "count": 20, "results": [{"id": "card_instr_computer_science", "title": "Computer science", "shelf": "codex", "surface": "secular", "snippet": "The Computer science verifier (src/concordance/verifiers/computer_science.py). Builds on: Boolean algebra — the base of logic. Found from the code's own imports, never invented; the module keeps the l", "authority_tier": "engine_derived", "source": "verifier: computer_science", "readable": false, "generated": false}, {"id": "card_src_word_computer_science", "title": "computer science", "shelf": "dictionary", "surface": "secular", "snippet": "computer science: (noun) the branch of engineering science that studies (with the aid of computers) computable processes and structures — syn: computing", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_theory_digital_analog", "title": "Digital versus analog (why discreteness survives copying)", "shelf": "theories", "surface": "secular", "snippet": "Digital versus analog (why discreteness survives copying) — an engine domain that can touch it: computer_science. Calibration: map-only — sampling rates and bit depth are ordinary arithmetic, and THIS", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_condensed_matter", "title": "Condensed matter & semiconductors (band theory and the transistor)", "shelf": "theories", "surface": "secular", "snippet": "Condensed matter & semiconductors (band theory and the transistor) — an engine domain that can touch it: materials_science. Calibration: map-only — band gaps and carrier concentrations compute; the fi", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "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_theory_quantum_information___entanglement__von_neumann_entr", "title": "Quantum information & entanglement (von Neumann entropy)", "shelf": "theories", "surface": "secular", "snippet": "Quantum information & entanglement (von Neumann entropy) — an engine domain that can touch it: information_theory. Calibration: seals. S = -Tr(ρ log ρ), the entropy of a density matrix, which reduces ", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_theory_error_correcting_codes", "title": "Error-correcting codes (Hamming, Reed–Solomon)", "shelf": "theories", "surface": "secular", "snippet": "Error-correcting codes (Hamming, Reed–Solomon) — an engine domain that can touch it: information_theory. Calibration: seals — code distances, correctable error counts and parity all compute exactly. A", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "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_numerical_analysis", "title": "Numerical analysis (why the computer's answer is not the answer)", "shelf": "theories", "surface": "secular", "snippet": "Numerical analysis (why the computer's answer is not the answer) — an engine domain that can touch it: computer_science. Calibration: map-only — error bounds and condition numbers are computable in pr", "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_boolean_algebra_propositional_logic", "title": "Boolean algebra / propositional logic", "shelf": "theories", "surface": "secular", "snippet": "Boolean algebra / propositional logic — an engine domain that can touch it: formal_logic. Calibration: seals. Two values and three operations — AND, OR, NOT — with laws of their own (De Morgan's, dist", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "readable": false, "generated": false}, {"id": "card_comms_packet_over_handheld", "title": "Text over a handheld — packet radio (AX.25 / APRS) with a sound-card TNC", "shelf": "communications", "surface": "secular", "snippet": "A VHF handheld can carry TEXT: packet radio sends short digital frames (AX.25) as 1200-baud audio tones (AFSK) over the ordinary voice channel. The parts: the handheld, a cable to a sound-card interfa", "authority_tier": "reference", "source": "FCC Part 97 — Amateur Radio Service (U.S. regulation, public domain)", "readable": false, "generated": false}, {"id": "card_bridge_master_boolean_algebra", "title": "Master equation: (a AND b), (a OR b), NOT a  —  the two-valued algebra", "shelf": "bridges", "surface": "secular", "snippet": "the law of thought made algebra: the same AND/OR/NOT structure is propositional logic, a network of switches, and the algebra of sets. Boole titled it The Laws of Thought; Shannon showed a circuit IS ", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_bridge_master_boltzmann_factor", "title": "Master equation: n ~ e^(-E / kT)", "shelf": "bridges", "surface": "secular", "snippet": "the fraction of a system with energy E falls off exponentially against thermal energy kT. ONE equation, 5 domains, connected by a change of variable: meteorology [E = m g h — the barometric formula is", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_alm_connection_reality_is_mappable", "title": "Almanac: Reality is mappable: the same verified structure recurs across every domain", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  Across this whole moat -- physics, computer science, music, genetics -- the engine kept finding the SAME structures wearing different clothes, and this grand capstone confirms it by drawin", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_alm_assessment_turing_universal_machine", "title": "Almanac: The universal machine and the wall of undecidability -- the mind reduced to mechanism", "shelf": "almanac", "surface": "secular", "snippet": "SITUATION\n  THE KERNEL (sealed): Turing gave the world its deepest account of WHAT CAN BE COMPUTED. A single universal machine, given an encoding, can simulate any other machine -- the foundation of e", "authority_tier": "reference", "source": "The Almanac — verified-only practical wisdom (sealed)", "readable": false, "generated": false}, {"id": "card_calc_euler_integration", "title": "Euler's method (ODE stepping)", "shelf": "calculations", "surface": "secular", "snippet": "Euler's method (ODE stepping) — computer_science. Formula: y_{n+1} = y_n + h f(y_n). Canonical FORM: recursion (x_{n+1} = f(x_n)) — solve a differential equation by stepping the rate forward. Same for", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_chain_turing_1936", "title": "Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem", "shelf": "codex", "surface": "secular", "snippet": "A. M. Turing (1936). On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. (2) 42 (1937) 230–265. DOI 10.1112/plms/s2-42.1.230. Canonical: https://doi.org/10.", "authority_tier": "reference", "source": "A. M. Turing (1936), Proc. London Math. Soc. (2) 42 (1937) 230–265", "readable": false, "generated": false}, {"id": "card_calc_softmax", "title": "Softmax", "shelf": "calculations", "surface": "secular", "snippet": "Softmax — computer_science. Formula: p_i = e^(z_i) / sum_j e^(z_j). Canonical FORM: decay (y = y0 e^(-kt)) — a network's class probabilities ARE a Boltzmann distribution over scores (temperature = 1).", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_bridge_form_logarithmic", "title": "Bridge: the logarithmic form across 18 domains", "shelf": "bridges", "surface": "secular", "snippet": "The canonical form logarithmic (y = k * log(x / x0)) is the SAME computation in 18 different domains — acoustics, astronomy, chemistry, computer_science, cybersecurity, ecology, economics, electrochem", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "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_instr_computer_science"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}