{"id": "card_floor_computer_science", "kind": "note", "title": "Computer science — bits, logic, and what can be computed", "body": "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 complexity say what a machine can do at all and how fast (the halting problem undecidable; P vs NP open). Four pillars rest on the instruments (information, logic), P vs NP (complexity), and the mind (which computes). The engine is itself one such machine. The stick (stick_computer_science_bits_logic_and_what_can_be_computed) seals the byte, the Boolean-gate count and the merge-sort comparisons (tools/seed_computer_science.py).", "source": {"label": "Narrow Highway — computer science", "url": "", "authority_tier": "engine_derived", "ref": "stick_computer_science_bits_logic_and_what_can_be_computed"}, "shelf": "codex", "box": "computer_science", "bands": ["floor", "computer science", "computation", "algorithms", "bits", "one map"], "subject": "Computer science — bits, logic, and what can be computed", "connections": [{"to_card_id": "card_cs_bits", "relationship": "has_part", "evidence": "a pillar of computer science (Information is bits)"}, {"to_card_id": "card_cs_logic_gates", "relationship": "has_part", "evidence": "a pillar of computer science (Logic gates)"}, {"to_card_id": "card_cs_algorithms", "relationship": "has_part", "evidence": "a pillar of computer science (Algorithms)"}, {"to_card_id": "card_cs_computability", "relationship": "has_part", "evidence": "a pillar of computer science (Computability and complexity)"}, {"to_card_id": "card_k_floor_of_discovery", "relationship": "part_of", "evidence": "computation on the one map"}, {"to_card_id": "card_logistics_hardness", "relationship": "connects_at", "evidence": "optimization and NP-hardness - the algorithms of logistics"}, {"to_card_id": "card_qc_computation", "relationship": "connects_at", "evidence": "quantum computation - a complexity class of its own"}, {"to_card_id": "card_net_addressing", "relationship": "connects_at", "evidence": "addressing and routing are binary arithmetic - computation"}, {"to_card_id": "card_cs_busy_beaver", "relationship": "has_part", "evidence": "the Busy Beaver function - the concrete uncomputable frontier of computability"}, {"to_card_id": "card_cs_eth", "relationship": "has_part", "evidence": "the Exponential Time Hypothesis - a complexity hardness assumption and its 2026 refutation claim"}, {"to_card_id": "card_tool_the_engine_among_the_instruments", "relationship": "connects_at", "evidence": "the Turing machine's heir - a universal reader of the keeping, deterministic, no generation"}, {"to_card_id": "card_tool_reservoir_computing", "relationship": "connects_at", "evidence": "a fixed substrate plus a trained linear readout is a complete computer (Jaeger 2001; Maass 2002)"}, {"to_card_id": "card_cs_sorting_algorithms", "relationship": "has_part", "evidence": "sorting is the algorithms pillar at depth: the roll of eighty-six and the log2 n! bound"}], "author": "engine", "created_at": 0.0, "updated_at": 0.0, "visibility": "public", "lifecycle_stage": "public", "volatility": "permanent", "surface": "secular", "generated": false, "call": "codex.computer.science", "facets": {"subject": ["algorithms", "bits", "computation", "computer science", "floor", "one map"]}, "presentation": {"glyph": "•", "kind_label": "computer science", "by": "Narrow Highway — computer science", "authority": "engine_derived", "posted": "", "standing": ""}, "neighbors": [{"id": "card_cs_bits", "title": "Information is bits — the byte", "relationship": "has part", "why": "a pillar of computer science (Information is bits)", "href": "/card/card_cs_bits", "resolved": true}, {"id": "card_cs_logic_gates", "title": "Logic gates — the 16 functions of two inputs", "relationship": "has part", "why": "a pillar of computer science (Logic gates)", "href": "/card/card_cs_logic_gates", "resolved": true}, {"id": "card_cs_algorithms", "title": "Algorithms — good beats bad", "relationship": "has part", "why": "a pillar of computer science (Algorithms)", "href": "/card/card_cs_algorithms", "resolved": true}, {"id": "card_cs_computability", "title": "Computability and complexity — Turing to P vs NP", "relationship": "has part", "why": "a pillar of computer science (Computability and complexity)", "href": "/card/card_cs_computability", "resolved": true}, {"id": "card_k_floor_of_discovery", "title": "The Floor of Discovery — one floor, and by its design the fear of God", "relationship": "part of", "why": "computation on the one map", "href": "/card/card_k_floor_of_discovery", "resolved": true}, {"id": "card_logistics_hardness", "title": "Hardness - routing is NP", "relationship": "connects at", "why": "optimization and NP-hardness - the algorithms of logistics", "href": "/card/card_logistics_hardness", "resolved": true}, {"id": "card_qc_computation", "title": "Computation - interference and complexity", "relationship": "connects at", "why": "quantum computation - a complexity class of its own", "href": "/card/card_qc_computation", "resolved": true}, {"id": "card_net_addressing", "title": "Addressing - counting in binary", "relationship": "connects at", "why": "addressing and routing are binary arithmetic - computation", "href": "/card/card_net_addressing", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_floor_computer_science", "next_step": {"do": "follow a connection: what this card rests on, and what rests on it", "door": "FIND", "tool": "card_connections", "params": {"id": "card_floor_computer_science"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}