{"query": "Aurelius, Meditations 12.17: No operation whatsoever it he,", "count": 20, "results": [{"id": "card_theory_chemical_engineering", "title": "Chemical engineering (unit operations, balances, and scale-up)", "shelf": "theories", "surface": "secular", "snippet": "Chemical engineering (unit operations, balances, and scale-up) — an engine domain that can touch it: manufacturing. Calibration: seals — mass and energy balances and residence times compute exactly. T", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_game_theory", "title": "Game theory (Nash equilibrium)", "shelf": "theories", "surface": "secular", "snippet": "Game theory (Nash equilibrium) — an engine domain that can touch it: operations_research. Calibration: seals — equilibria of finite games compute. A situation where no player can do better by unilater", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_control_theory___cybernetics__feedback__stability", "title": "Control theory & cybernetics (feedback, stability)", "shelf": "theories", "surface": "secular", "snippet": "Control theory & cybernetics (feedback, stability) — an engine domain that can touch it: operations_research. Calibration: partial — stability criteria and PID responses compute. Steer a system by the", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_queueing_theory", "title": "Queueing theory (Little's law)", "shelf": "theories", "surface": "secular", "snippet": "Queueing theory (Little's law) — an engine domain that can touch it: operations_research. Calibration: seals — Little's law and standard queue formulas compute. L = λW: the average number waiting equa", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_systems_engineering", "title": "Systems engineering (requirements, interfaces, and emergent failure)", "shelf": "theories", "surface": "secular", "snippet": "Systems engineering (requirements, interfaces, and emergent failure) — an engine domain that can touch it: operations_research. Calibration: map-only — a discipline of practice; reliability and margin", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_linear_programming_duality", "title": "Linear programming & duality", "shelf": "theories", "surface": "secular", "snippet": "Linear programming & duality — an engine domain that can touch it: operations_research. Calibration: seals — optimal values and shadow prices compute. Maximise or minimise a linear objective subject t", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_requisite_variety", "title": "Ashby's law of requisite variety (the humility theorem)", "shelf": "theories", "surface": "secular", "snippet": "Ashby's law of requisite variety (the humility theorem) — an engine domain that can touch it: operations_research. Calibration: map-only — a structural bound, stated in variety counts rather than comp", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_explore_exploit", "title": "Explore versus exploit (the multi-armed bandit)", "shelf": "theories", "surface": "secular", "snippet": "Explore versus exploit (the multi-armed bandit) — an engine domain that can touch it: operations_research. Calibration: map-only — regret bounds are asymptotic; specific policies compute. When you mus", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_theory_fundamental_theorem_of_calculus", "title": "Fundamental theorem of calculus", "shelf": "theories", "surface": "secular", "snippet": "Fundamental theorem of calculus — an engine domain that can touch it: mathematics. Calibration: seals. Differentiation and integration are inverse operations. Part one: the derivative of the accumulat", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "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)", "generated": false}, {"id": "card_theory_group_theory", "title": "Group theory & symmetry (the mathematics of what stays the same)", "shelf": "theories", "surface": "secular", "snippet": "Group theory & symmetry (the mathematics of what stays the same) — an engine domain that can touch it: mathematics. Calibration: seals — group orders, subgroup structure and symmetry counts compute. A", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "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)", "generated": false}, {"id": "card_theory_landauer", "title": "Landauer's principle (erasing information costs heat)", "shelf": "theories", "surface": "secular", "snippet": "Landauer's principle (erasing information costs heat) — an engine domain that can touch it: information_theory. Calibration: seals — the energy bound computes exactly. ERASING one bit must dissipate a", "authority_tier": "reference", "source": "The Theory Assay — calibrated, not judged (docs/THEORY_CATALOG.md)", "generated": false}, {"id": "card_n_4058d240a562", "title": "Aurelius, Meditations 12.17: No operation whatsoever it he, ceasing for a while, can be truly said to suff...", "shelf": "classics", "surface": "secular", "snippet": "No operation whatsoever it he, ceasing for a while, can be truly said to suffer any evil, because it is at an end. Neither can he that is the author of that operation; for this very respect, because h", "authority_tier": "external_aligned", "source": "Marcus Aurelius, Meditations (c. AD 170)", "generated": false}, {"id": "card_src_word_consecutive_operation", "title": "consecutive operation", "shelf": "dictionary", "surface": "secular", "snippet": "consecutive operation: (noun) the sequential execution of operations one after another — syn: serial operation, sequential operation", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "generated": false}, {"id": "card_src_word_sequential_operation", "title": "sequential operation", "shelf": "dictionary", "surface": "secular", "snippet": "sequential operation: (noun) the sequential execution of operations one after another — syn: serial operation, consecutive operation", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "generated": false}, {"id": "card_src_word_serial_operation", "title": "serial operation", "shelf": "dictionary", "surface": "secular", "snippet": "serial operation: (noun) the sequential execution of operations one after another — syn: sequential operation, consecutive operation", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "generated": false}, {"id": "card_src_word_operation_code", "title": "operation code", "shelf": "dictionary", "surface": "secular", "snippet": "operation code: (noun) the portion of a set of operation descriptions that specifies the operation to be performed; the set of operations in a computer — syn: order code", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "generated": false}, {"id": "card_src_word_binary_operation", "title": "binary operation", "shelf": "dictionary", "surface": "secular", "snippet": "binary operation: (noun) an operation that follows the rules of Boolean algebra; each operand and the result take one of two values — syn: boolean operation, binary arithmetic operation", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "generated": false}, {"id": "card_src_word_boolean_operation", "title": "boolean operation", "shelf": "dictionary", "surface": "secular", "snippet": "boolean operation: (noun) an operation that follows the rules of Boolean algebra; each operand and the result take one of two values — syn: binary operation, binary arithmetic operation", "authority_tier": "reference", "source": "WordNet 3.0, Princeton University (WordNet License)", "generated": false}]}