{"query": "Turing 1953 — Some calculations of the Riemann zeta-function", "count": 18, "results": [{"id": "card_chain_turing_1953", "title": "Turing 1953 — Some calculations of the Riemann zeta-function", "shelf": "codex", "surface": "secular", "snippet": "A. M. Turing (1953). Some calculations of the Riemann zeta-function. Proc. London Math. Soc. (3) 3 (1953) 99–117. DOI 10.1112/plms/s3-3.1.99. Canonical: https://doi.org/10.1112/plms/s3-3.1.99. Cited b", "authority_tier": "reference", "source": "A. M. Turing (1953), Proc. London Math. Soc. (3) 3 (1953) 99–117", "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_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_bridge_theory_structural_generative_linguistics__church_turing_thesis_computability", "title": "Bridge: Structural & generative linguistics (Saussure, Chomsky)  ↔  Church–Turing thesis / computability", "shelf": "bridges", "surface": "secular", "snippet": "Structural & generative linguistics (Saussure, Chomsky) and Church–Turing thesis / computability are the same form in different domains. the Chomsky hierarchy IS a computability hierarchy: regular, co", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "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_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_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_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_bridge_master_diffusion_equation", "title": "Master equation: du/dt = D * laplacian(u)", "shelf": "bridges", "surface": "secular", "snippet": "spreading by random walk — first in time, second in space. ONE equation, 8 domains, connected by a change of variable: thermodynamics [u = temperature, D = thermal diffusivity]; chemistry [u = concent", "authority_tier": "reference", "source": "The Bridges — cross-domain isomorphisms", "readable": false, "generated": false}, {"id": "card_builder_alan_turing", "title": "Alan Turing", "shelf": "builders", "surface": "secular", "snippet": "Alan Turing (1912–1954 AD) — mathematics. The gift: the theory of computation — the Turing machine defined what an algorithm is and founded computer science; his codebreaking helped end a war. Where i", "authority_tier": "reference", "source": "The builders of the Floor — credited with love, calibrated to the plumb-line", "readable": false, "generated": false}, {"id": "card_calc_reaction_diffusion", "title": "Reaction-diffusion (Turing patterns)", "shelf": "calculations", "surface": "secular", "snippet": "Reaction-diffusion (Turing patterns) — biology. Formula: du/dt = D u_xx + f(u). Canonical FORM: diffusion (du/dt = D * laplacian(u)) — spots and stripes emerge where diffusion meets reaction. Same for", "authority_tier": "reference", "source": "The Calculation Map — every calculation, mapped by form", "readable": false, "generated": false}, {"id": "card_src_word_turing", "title": "turing", "shelf": "dictionary", "surface": "secular", "snippet": "turing: (noun) English mathematician who conceived of the Turing machine and broke German codes during World War II (1912-1954) — syn: Alan Turing, Alan Mathison Turing", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_src_word_alan_turing", "title": "alan turing", "shelf": "dictionary", "surface": "secular", "snippet": "alan turing: (noun) English mathematician who conceived of the Turing machine and broke German codes during World War II (1912-1954) — syn: Turing, Alan Mathison Turing", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_src_word_alan_mathison_turing", "title": "alan mathison turing", "shelf": "dictionary", "surface": "secular", "snippet": "alan mathison turing: (noun) English mathematician who conceived of the Turing machine and broke German codes during World War II (1912-1954) — syn: Turing, Alan Turing", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_src_pron_turing", "title": "turing", "shelf": "pronunciation", "surface": "secular", "snippet": "turing: pronounced (ARPABET) T UH1 R IH0 NG. 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_word_turing_machine", "title": "turing machine", "shelf": "dictionary", "surface": "secular", "snippet": "turing machine: (noun) a hypothetical computer with an infinitely long memory tape", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "readable": false, "generated": false}, {"id": "card_tool_the_engine_among_the_instruments", "title": "Our place — a deterministic instrument you read, not a program you run", "shelf": "codex", "surface": "secular", "snippet": "The slide rule computes on LOG scales; the Smith chart on the COMPLEX PLANE (the Cayley transform); the Turing machine on a STATE TABLE (card_floor_computer_science). Each is low-tech and highly valua", "authority_tier": "engine_derived", "source": "Narrow Highway — the instruments", "readable": false, "generated": false}, {"id": "card_seal_c806a2568ea52793e854cda24096f9af9c64cdf4f654905c1c54f2c51a67bc36", "title": "Receipt c806a2568ea5… — sealed: record", "shelf": "seals", "surface": "secular", "snippet": "{\n \"anchors\": [],\n \"axis_coords\": {\n  \"axis\": \"mathematics\",\n  \"dimensions\": [\n   \"reasoning\"\n  ]\n },\n \"gate_results\": [\n  {\n   \"details\": {\n    \"broken_at\": null,\n    \"confirmed_steps\": 1,\n    \"error", "authority_tier": "engine_derived", "source": "Narrow Highway engine — sealed record", "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_chain_turing_1953"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}