{"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_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_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_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_floor_computer_science", "title": "Computer science — bits, logic, and what can be computed", "shelf": "codex", "surface": "secular", "snippet": "Information is bits (a byte is 2^8 = 256 values); logic gates build from the 16 Boolean functions of two inputs; good algorithms beat bad ones (merge sort's n log n against n^2); and computability and", "authority_tier": "engine_derived", "source": "Narrow Highway — computer science", "readable": false, "generated": false}, {"id": "card_cs_computability", "title": "Computability and complexity — Turing to P vs NP", "shelf": "codex", "surface": "secular", "snippet": "A Turing machine defines what is computable; the universal machine runs any program (the engine, the laptop, the brain's computation). Some problems are undecidable (the halting problem); among the de", "authority_tier": "engine_derived", "source": "Narrow Highway — computer science", "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_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_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_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_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_cs_busy_beaver", "title": "The Busy Beaver function — BB(5) proved, BB(6) open", "shelf": "codex", "surface": "secular", "snippet": "BB(n), the Busy Beaver function (Rado 1962), is the most steps an n-state 2-symbol Turing machine can run before halting. It is UNCOMPUTABLE in general - a value of BB would decide the halting problem", "authority_tier": "engine_derived", "source": "Narrow Highway — computer science", "readable": false, "generated": false}, {"id": "card_chain_cobham_1965", "title": "Cobham 1965 — The intrinsic computational difficulty of functions", "shelf": "codex", "surface": "secular", "snippet": "A. Cobham (1965). The intrinsic computational difficulty of functions. Logic, Methodology and Philosophy of Science (Proc. 1964 Congress), North-Holland, 1965, 24–30. Cited by its record. License as f", "authority_tier": "reference", "source": "A. Cobham (1965), Logic, Methodology and Philosophy of Science (Proc. 1964 Congress), North-Holland, 1965, 24–30", "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_cs_sorting_algorithms", "title": "Sorting algorithms — the roll of eighty-six and the bound none can beat", "shelf": "codex", "surface": "secular", "snippet": "To sort is to find the one order among n! - and a comparison answers one two-valued question, so no comparison sort beats log2 n! comparisons (Knuth, TAOCP vol. 3, 5.3.1). Eight items: 8! = 40,320 ord", "authority_tier": "engine_derived", "source": "Narrow Highway — computer science", "readable": false, "generated": false}, {"id": "card_src_fed_nasa_techdoc_19840019630", "title": "PAN AIR: A computer program for predicting subsonic or supersonic linear potential flows about arbitrary configurations using a high order panel method. Volume 2: User's manual (ve", "shelf": "science", "surface": "secular", "snippet": "PAN AIR: A computer program for predicting subsonic or supersonic linear potential flows about arbitrary configurations using a high order panel method. Volume 2: User's manual (version 1.1). A United", "authority_tier": "reference", "source": "NASA technical documents (PD, 17 USC 105)", "readable": true, "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"}}