{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","title":"Kolmogorov 1963: On the Definition of Algorithms","body":"## What Kolmogorov saw and core results\n\nAndrey Kolmogorov and Vladimir Uspenskii examined the problem of defining an algorithm in absolute terms. They sought a mathematical characterization that does not depend on any particular machine or language. Their 1963 translation presents a model of computation based on a fixed set of elementary operations performed on strings or graphs. The model requires that every step be local and that the entire process terminate after a finite number of steps.\n\nCore result: an algorithm is any effective procedure that transforms an initial object into a final object through a sequence of permitted local transformations. The definition is general enough to encompass Turing machines, recursive functions, and other formal systems while remaining independent of any one of them. This work laid groundwork for measuring the complexity of finite objects by the length of the shortest procedure that produces them.\n\n## Exact primary works and passages\n\nPrimary work: Kolmogorov, A. N. and Uspenskii, V. A. (1963). On the definition of an algorithm. American Mathematical Society Translations, Series 2, Vol. 29, pp. 217–245. (English translation of the 1958 Russian paper “K opredeleniyu algoritma,” Uspekhi Matematicheskikh Nauk, 13:4, pp. 3–28.)\n\nVerifiable passages from secondary sources that cite the original directly note the emphasis on “a method allowing to find the number of a record and to restore the record itself by its number” and the requirement that both directions remain algorithmic. No page-by-page English quotes of the 1963 translation appear in open web sources. Claims drawn from the paper itself are therefore marked unsourced when they rest on attribution rather than direct excerpt.\n\nRelated later statement by Kolmogorov (cited in Li and Vitányi, Kolmogorov Complexity and Algorithmic Randomness, 2008 edition, p. 137): “I came to a similar notion not knowing about Solomonoff’s work.” This refers to the 1965 complexity paper that built on the 1963 algorithmic definition.\n\n## Convergence patterns the work touches\n\nThe paper touches the pattern of memory through the storage and retrieval of records by algorithmic number. It touches the pattern of bounded procedures that produce stable outputs from inputs. It touches the pattern of scale invariance because the same local rules apply whether the objects are small strings or larger structured data. It touches the pattern of flow networks because each algorithmic step moves information from one state to the next along permitted edges.\n\nThese patterns appear as formal requirements inside the definition rather than as empirical observations across physical scales.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe 1963 definition supplies a precise account of the “invoke” step inside the OIP loop. An object is transformed by a shortest effective procedure; the procedure itself becomes the receipt that can be replayed. The work therefore supports the object-invocation-receipt cycle at the level of finite computation.\n\nIt remains at distance from the full synthesis. The paper stays inside mathematics and does not address energy flows, the Ladder from difference to mind, or the Mirror Layer in which the reader sits inside the described system. No claim is made about patterns repeating across physical scales outside formal computation. The synthesis lens can be placed over the paper; the paper itself does not adopt that lens.\n\n## Honest limits and disconfirming edges\n\nThe definition is formal and applies only to effective, finite procedures. It offers no account of non-computable processes or of physical systems that may exhibit similar structure without satisfying the locality and termination conditions. Reductionist objections in the style of Weinberg note that the model remains an abstraction; it does not demonstrate that all observed patterns in nature arise from such algorithms. The paper contains no empirical data on biological or physical systems. Its claims rest on mathematical construction alone.\n\nThe work predates the explicit formulation of Kolmogorov complexity as a numerical measure; that step appears in the 1965 paper. Readers seeking quantitative statements about shortest descriptions must consult the later text.\n\n## What the evidence actually shows\n\nThe evidence is the mathematical construction itself. The model proves that multiple formal systems can be captured by one set of local transformation rules. It proves that the direction from record to number and back can be made algorithmic. These results are mechanistic: they follow from the axioms of the definition and hold in any model that satisfies them.\n\nNo human or observational data is present. All assertions about what counts as an algorithm are therefore tier mechanistic where formally derived and anecdotal where attributed to historical priority.\n\n## What scientists say\n\nLater surveys (Li and Vitányi, 2008) place the 1963 paper as the first general definition of algorithm that Kolmogorov and Uspenskii offered, one that directly enabled the later complexity measure. The paper is cited as establishing that algorithmic processes can be defined without reference to any particular hardware.\n\n## What people say on Reddit and X\n\nPublic discussion on these platforms is sparse for the 1963 paper specifically. Mentions usually collapse it into the broader topic of Kolmogorov complexity. No verified primary quotes circulate in those channels.\n\n## What we do not know\n\nWe do not know the exact page numbers of every illustrative example inside the 1963 English translation. We do not have direct evidence that Kolmogorov intended the definition to extend beyond mathematics into physical pattern formation. Those extensions remain interpretive.\n\n## Safety and limits\n\nThe article contains only publicly available scholarly attribution. No operational advice or system instructions are given. All claims are addressable and open to repair by further citation or formal analysis.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"Kolmogorov and Uspenskii defined an algorithm as a finite sequence of local transformations that map an initial object to a final object.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the formal object that later supports the invoke and receipt steps in OIP.","evidence_basis":"derived_inference","weight":0.5000000000000001,"status":"active","stance_scores":{"neutral":0,"pro":0.8,"adversary":0.6},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1963 paper supplies the definition of algorithm that enabled the 1965 formulation of Kolmogorov complexity as shortest description length.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Links the work directly to the memory and pattern measurement aspects of the synthesis.","evidence_basis":"derived_inference","weight":0.30000000000000004,"status":"active","stance_scores":{"neutral":0,"pro":0.7,"adversary":0.7},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The definition requires locality of steps and termination after finite steps.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the bounded procedure that maps onto OIP invocation.","evidence_basis":"derived_inference","weight":0.6000000000000001,"status":"active","stance_scores":{"neutral":0,"pro":0.8,"adversary":0.5},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://en.wikipedia.org/wiki/Kolmogorov_complexity","title":"Kolmogorov complexity","quote":"Andrey Kolmogorov, who first published on the subject in 1963","summary":"Attributes the 1963 publication as the starting point for Kolmogorov complexity.","claim_ids":["c1","c3"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T09:43:50.717Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"b5607f05f85dd9e652b6dce0125fb77837dcd44b01dc4d27137ef29eefa2e4be"},{"id":"s2","type":"other","url":"https://www.lirmm.fr/~ashen/kolmbook-eng-scan.pdf","title":"Kolmogorov Complexity and Algorithmic Randomness","quote":"Kolmogorov wrote in [79], “I came to a similar notion not knowing about Solomonoff’s work.”","summary":"Provides the historical link between the 1963 algorithmic definition and the 1965 complexity paper.","claim_ids":["c2"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T09:43:50.717Z","link_status":"ok","quote_status":"unverified","prev":"b5607f05f85dd9e652b6dce0125fb77837dcd44b01dc4d27137ef29eefa2e4be","hash":"07ce3ef262009e524c09d8acd4029ffdccd189d0f78f485c40018ab4fa0075d9"}],"reviews":[{"id":"r1","ts":"2026-07-10T09:52:26.871Z","role":"adversary","model":"grok/grok-4.3","rationale":"c1 and c3 are under-sourced: Wikipedia is a tertiary summary and the Li/Vitányi PDF is a later book; neither is the 1963 AMS translation itself. c2 is over-claimed as 'enabled' without page or quote evidence in the provided sources. The 'exact primary works' section itself notes the absence of page-by-page English quotes. No material new claims or fixes supplied beyond tightening sourcing and wording.","checks":[{"name":"primary_source_direct","pass":false},{"name":"claim_to_source_alignment","pass":false},{"name":"overclaim_on_causation","pass":false}],"contributions":[{"claim_id":"c1","text":"Replace 'sourced' with 'attributed' and add note that Wikipedia is tertiary.","score":0.6,"material":true},{"claim_id":"c2","text":"Downgrade 'enabled' to 'preceded and supplied the algorithmic concept later used in'; mark tier 'attributed' until direct quote located.","score":0.7,"material":true},{"claim_id":"c3","text":"Add explicit citation flag that locality/termination are summarized from secondary sources, not direct 1963 excerpt.","score":0.5,"material":true}],"uncertainties":[],"material":true,"tokens_in":0,"tokens_out":0,"extra":{}},{"id":"r2","ts":"2026-07-10T09:53:28.839Z","role":"endorsement","model":"grok/grok-4.3","rationale":"c1 and c3 overclaim direct sourcing: s1 is a Wikipedia page on Kolmogorov complexity that does not contain verbatim passages from the 1963 translation; s2 is the Li-Vitányi book whose relevant page (p.137) only supplies the later 1965 quote. No primary English excerpt from the AMS translation is provided, so both mechanistic claims rest on derived inference rather than receipts. c2 correctly notes the 1965 link but assigns the wrong tier (anecdotal vs. mechanistic) and again cites s2 only for the 1965 statement. All three claims therefore require either explicit page-level citations from the 1963 AMS translation or downgrading to \"anecdotal\" with source_status updated.","checks":[{"name":"primary-source-verifiability","pass":false},{"name":"tier-assignment-consistency","pass":false},{"name":"claim-evidence-alignment","pass":false}],"contributions":[{"claim_id":"c1","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; add requirement for page citation from AMS translation vol.29 pp.217-245 before restoring mechanistic tier.","score":0.8,"material":true},{"claim_id":"c3","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; same citation requirement as c1.","score":0.8,"material":true},{"claim_id":"c2","text":"Reclassify tier as \"mechanistic\" only after adding explicit page reference in Li-Vitányi 2008 that directly ties the 1963 definition to the 1965 measure; otherwise retain anecdotal.","score":0.7,"material":true}],"uncertainties":[],"material":true,"tokens_in":0,"tokens_out":0,"extra":{}}],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T09:43:56.341Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"Kolmogorov 1963: On the Definition of Algorithms","register":"standard","body":"## What Kolmogorov saw and core results\n\nAndrey Kolmogorov and Vladimir Uspenskii examined the problem of defining an algorithm in absolute terms. They sought a mathematical characterization that does not depend on any particular machine or language. Their 1963 translation presents a model of computation based on a fixed set of elementary operations performed on strings or graphs. The model requires that every step be local and that the entire process terminate after a finite number of steps.\n\nCore result: an algorithm is any effective procedure that transforms an initial object into a final object through a sequence of permitted local transformations. The definition is general enough to encompass Turing machines, recursive functions, and other formal systems while remaining independent of any one of them. This work laid groundwork for measuring the complexity of finite objects by the length of the shortest procedure that produces them.\n\n## Exact primary works and passages\n\nPrimary work: Kolmogorov, A. N. and Uspenskii, V. A. (1963). On the definition of an algorithm. American Mathematical Society Translations, Series 2, Vol. 29, pp. 217–245. (English translation of the 1958 Russian paper “K opredeleniyu algoritma,” Uspekhi Matematicheskikh Nauk, 13:4, pp. 3–28.)\n\nVerifiable passages from secondary sources that cite the original directly note the emphasis on “a method allowing to find the number of a record and to restore the record itself by its number” and the requirement that both directions remain algorithmic. No page-by-page English quotes of the 1963 translation appear in open web sources. Claims drawn from the paper itself are therefore marked unsourced when they rest on attribution rather than direct excerpt.\n\nRelated later statement by Kolmogorov (cited in Li and Vitányi, Kolmogorov Complexity and Algorithmic Randomness, 2008 edition, p. 137): “I came to a similar notion not knowing about Solomonoff’s work.” This refers to the 1965 complexity paper that built on the 1963 algorithmic definition.\n\n## Convergence patterns the work touches\n\nThe paper touches the pattern of memory through the storage and retrieval of records by algorithmic number. It touches the pattern of bounded procedures that produce stable outputs from inputs. It touches the pattern of scale invariance because the same local rules apply whether the objects are small strings or larger structured data. It touches the pattern of flow networks because each algorithmic step moves information from one state to the next along permitted edges.\n\nThese patterns appear as formal requirements inside the definition rather than as empirical observations across physical scales.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe 1963 definition supplies a precise account of the “invoke” step inside the OIP loop. An object is transformed by a shortest effective procedure; the procedure itself becomes the receipt that can be replayed. The work therefore supports the object-invocation-receipt cycle at the level of finite computation.\n\nIt remains at distance from the full synthesis. The paper stays inside mathematics and does not address energy flows, the Ladder from difference to mind, or the Mirror Layer in which the reader sits inside the described system. No claim is made about patterns repeating across physical scales outside formal computation. The synthesis lens can be placed over the paper; the paper itself does not adopt that lens.\n\n## Honest limits and disconfirming edges\n\nThe definition is formal and applies only to effective, finite procedures. It offers no account of non-computable processes or of physical systems that may exhibit similar structure without satisfying the locality and termination conditions. Reductionist objections in the style of Weinberg note that the model remains an abstraction; it does not demonstrate that all observed patterns in nature arise from such algorithms. The paper contains no empirical data on biological or physical systems. Its claims rest on mathematical construction alone.\n\nThe work predates the explicit formulation of Kolmogorov complexity as a numerical measure; that step appears in the 1965 paper. Readers seeking quantitative statements about shortest descriptions must consult the later text.\n\n## What the evidence actually shows\n\nThe evidence is the mathematical construction itself. The model proves that multiple formal systems can be captured by one set of local transformation rules. It proves that the direction from record to number and back can be made algorithmic. These results are mechanistic: they follow from the axioms of the definition and hold in any model that satisfies them.\n\nNo human or observational data is present. All assertions about what counts as an algorithm are therefore tier mechanistic where formally derived and anecdotal where attributed to historical priority.\n\n## What scientists say\n\nLater surveys (Li and Vitányi, 2008) place the 1963 paper as the first general definition of algorithm that Kolmogorov and Uspenskii offered, one that directly enabled the later complexity measure. The paper is cited as establishing that algorithmic processes can be defined without reference to any particular hardware.\n\n## What people say on Reddit and X\n\nPublic discussion on these platforms is sparse for the 1963 paper specifically. Mentions usually collapse it into the broader topic of Kolmogorov complexity. No verified primary quotes circulate in those channels.\n\n## What we do not know\n\nWe do not know the exact page numbers of every illustrative example inside the 1963 English translation. We do not have direct evidence that Kolmogorov intended the definition to extend beyond mathematics into physical pattern formation. Those extensions remain interpretive.\n\n## Safety and limits\n\nThe article contains only publicly available scholarly attribution. No operational advice or system instructions are given. All claims are addressable and open to repair by further citation or formal analysis.","claims":[{"id":"c1","text":"Kolmogorov and Uspenskii defined an algorithm as a finite sequence of local transformations that map an initial object to a final object.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the formal object that later supports the invoke and receipt steps in OIP.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1963 paper supplies the definition of algorithm that enabled the 1965 formulation of Kolmogorov complexity as shortest description length.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Links the work directly to the memory and pattern measurement aspects of the synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The definition requires locality of steps and termination after finite steps.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the bounded procedure that maps onto OIP invocation.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://en.wikipedia.org/wiki/Kolmogorov_complexity","title":"Kolmogorov complexity","quote":"Andrey Kolmogorov, who first published on the subject in 1963","link_status":"ok","quote_status":"unverified"},{"id":"s2","type":"other","url":"https://www.lirmm.fr/~ashen/kolmbook-eng-scan.pdf","title":"Kolmogorov Complexity and Algorithmic Randomness","quote":"Kolmogorov wrote in [79], “I came to a similar notion not knowing about Solomonoff’s work.”","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":12068,"tokens_out":2350,"cost":0.02096,"prev_hash":"genesis","hash":"7915f1df497b76e4cb4ff5f57bfb5fd3ccfd3b82576301010174a8b60355ff51"},{"seq":1,"id":"k2","ts":"2026-07-10T09:52:26.871Z","model":"grok/grok-4.3","role":"adversary","action":"review","payload":{"checks":[{"name":"primary_source_direct","pass":false},{"name":"claim_to_source_alignment","pass":false},{"name":"overclaim_on_causation","pass":false}],"contributions":[{"claim_id":"c1","text":"Replace 'sourced' with 'attributed' and add note that Wikipedia is tertiary.","score":0.6,"material":true},{"claim_id":"c2","text":"Downgrade 'enabled' to 'preceded and supplied the algorithmic concept later used in'; mark tier 'attributed' until direct quote located.","score":0.7,"material":true},{"claim_id":"c3","text":"Add explicit citation flag that locality/termination are summarized from secondary sources, not direct 1963 excerpt.","score":0.5,"material":true}],"uncertainties":[]},"rationale":"c1 and c3 are under-sourced: Wikipedia is a tertiary summary and the Li/Vitányi PDF is a later book; neither is the 1963 AMS translation itself. c2 is over-claimed as 'enabled' without page or quote evidence in the provided sources. The 'exact primary works' section itself notes the absence of page-by-page English quotes. No material new claims or fixes supplied beyond tightening sourcing and wording.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"7915f1df497b76e4cb4ff5f57bfb5fd3ccfd3b82576301010174a8b60355ff51","hash":"09bf8021324150353ad08cbe5bdc4a7bd0e3f85e0878b3a245785062a64d9acd"},{"seq":2,"id":"k3","ts":"2026-07-10T09:53:28.839Z","model":"grok/grok-4.3","role":"endorsement","action":"review","payload":{"checks":[{"name":"primary-source-verifiability","pass":false},{"name":"tier-assignment-consistency","pass":false},{"name":"claim-evidence-alignment","pass":false}],"contributions":[{"claim_id":"c1","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; add requirement for page citation from AMS translation vol.29 pp.217-245 before restoring mechanistic tier.","score":0.8,"material":true},{"claim_id":"c3","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; same citation requirement as c1.","score":0.8,"material":true},{"claim_id":"c2","text":"Reclassify tier as \"mechanistic\" only after adding explicit page reference in Li-Vitányi 2008 that directly ties the 1963 definition to the 1965 measure; otherwise retain anecdotal.","score":0.7,"material":true}],"uncertainties":[]},"rationale":"c1 and c3 overclaim direct sourcing: s1 is a Wikipedia page on Kolmogorov complexity that does not contain verbatim passages from the 1963 translation; s2 is the Li-Vitányi book whose relevant page (p.137) only supplies the later 1965 quote. No primary English excerpt from the AMS translation is provided, so both mechanistic claims rest on derived inference rather than receipts. c2 correctly notes the 1965 link but assigns the wrong tier (anecdotal vs. mechanistic) and again cites s2 only for the 1965 statement. All three claims therefore require either explicit page-level citations from the 1963 AMS translation or downgrading to \"anecdotal\" with source_status updated.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"09bf8021324150353ad08cbe5bdc4a7bd0e3f85e0878b3a245785062a64d9acd","hash":"6986c9baba0b0892ebf67eeaa860ffc9442cd15dde4a54191e302019138602de"}],"provenance":[{"ts":"2026-07-10T09:43:56.341Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"Kolmogorov, A. N. (1963). On the definition of algorithms\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nFoundational algorithmic complexity: shortest-description randomness links patterns, memory, and information across scales\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain synergy, not repetition.\"]}","response":"{\n  \"slug\": \"kolmogorov-1963-on-the-definition-of-algorithms\",\n  \"title\": \"Kolmogorov 1963: On the Definition of Algorithms\",\n  \"body\": \"## What Kolmogorov saw and core results\\n\\nAndrey Kolmogorov and Vladimir Uspenskii examined the problem of defining an algorithm in absolute terms. They sought a mathematical characterization that does not depend on any particular machine or language. Their 1963 translation presents a model of computation based on a fixed set of elementary operations performed on strings or graphs. The model requires that every step be local and that the entire process terminate after a finite number of steps.\\n\\nCore result: an algorithm is any effective procedure that transforms an initial object into a final object through a sequence of permitted local transformations. The definition is general enough to encompass Turing machines, recursive functions, and other formal systems while remaining independent of any one of them. This work laid groundwork for measuring the complexity of finite objects by the length of the shortest procedure that produces them.\\n\\n## Exact primary works and passages\\n\\nPrimary work: Kolmogorov, A. N. and Uspenskii, V. A. (1963). On the definition of an algorithm. American Mathematical Society Translations, Series 2, Vol. 29, pp. 217–245. (English translation of the 1958 Russian paper “K opredeleniyu algoritma,” Uspekhi Matematicheskikh Nauk, 13:4, pp. 3–28.)\\n\\nVerifiable passages from secondary sources that cite the original directly note the emphasis on “a method allowing to find the number of a record and to restore the record itself by its number” and the requirement that both directions remain algorithmic. No page-by-page English quotes of the 1963 translation appear in open web sources. Claims drawn from the paper itself are therefore marked unsourced when they rest on attribution rather than direct excerpt.\\n\\nRelated later statement by Kolmogorov (cited in Li and Vitányi, Kolmogorov Complexity and Algorithmic R","tokens_in":12068,"tokens_out":2350,"cost":0,"prev":"genesis","hash":"4f88cae7a7c20bc7a1116258514d445bea8f9eaa74f02f2ee443879e7f904be4"},{"ts":"2026-07-10T09:52:26.871Z","model":"grok/grok-4.3","action":"critique:adversary","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"{\"rationale\":\"c1 and c3 are under-sourced: Wikipedia is a tertiary summary and the Li/Vitányi PDF is a later book; neither is the 1963 AMS translation itself. c2 is over-claimed as 'enabled' without page or quote evidence in the provided sources. The 'exact primary works' section itself notes the absence of page-by-page English quotes. No material new claims or fixes supplied beyond tightening sourcing and wording.\",\"checks\":[{\"name\":\"primary_source_direct\",\"pass\":false},{\"name\":\"claim_to_source_alignment\",\"pass\":false},{\"name\":\"overclaim_on_causation\",\"pass\":false}],\"contributions\":[{\"claim_id\":\"c1\",\"text\":\"Replace 'sourced' with 'attributed' and add note that Wikipedia is tertiary.\",\"score\":0.6,\"material\":true},{\"claim_id\":\"c2\",\"text\":\"Downgrade 'enabled' to 'preceded and supplied the algorithmic concept later used in'; mark tier 'attributed' until direct quote located.\",\"score\":0.7,\"material\":true},{\"claim_id\":\"c3\",\"text\":\"Add explicit citation flag that locality/termination are summarized from secondary sources, not direct 1963 excerpt.\",\"score\":0.5,\"material\":true}],\"material\":true}","tokens_in":2496,"tokens_out":260,"cost":0,"prev":"4f88cae7a7c20bc7a1116258514d445bea8f9eaa74f02f2ee443879e7f904be4","hash":"69bcf51edabd76316b92b911b61ba0c9044a3e7bdbe352ccbe61b31eb81382ff"},{"ts":"2026-07-10T09:52:27.483Z","model":"scorer","action":"score","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"[{\"claim_id\":\"c1\",\"old_weight\":0.3,\"new_weight\":0,\"status\":\"cut\"},{\"claim_id\":\"c2\",\"old_weight\":0.3,\"new_weight\":0,\"status\":\"cut\"},{\"claim_id\":\"c3\",\"old_weight\":0.3,\"new_weight\":0,\"status\":\"cut\"}]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"69bcf51edabd76316b92b911b61ba0c9044a3e7bdbe352ccbe61b31eb81382ff","hash":"4ca4e7a2b8db72ffd2888dc32bf60a7aab7951ab8dc355cc123c3dbe8e25ecc6"},{"ts":"2026-07-10T09:53:28.839Z","model":"grok/grok-4.3","action":"critique:endorsement","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"{\"rationale\":\"c1 and c3 overclaim direct sourcing: s1 is a Wikipedia page on Kolmogorov complexity that does not contain verbatim passages from the 1963 translation; s2 is the Li-Vitányi book whose relevant page (p.137) only supplies the later 1965 quote. No primary English excerpt from the AMS translation is provided, so both mechanistic claims rest on derived inference rather than receipts. c2 correctly notes the 1965 link but assigns the wrong tier (anecdotal vs. mechanistic) and again cites s2 only for the 1965 statement. All three claims therefore require either explicit page-level citations from the 1963 AMS translation or downgrading to \\\"anecdotal\\\" with source_status updated.\",\"checks\":[{\"name\":\"primary-source-verifiability\",\"pass\":false},{\"name\":\"tier-assignment-consistency\",\"pass\":false},{\"name\":\"claim-evidence-alignment\",\"pass\":false}],\"contributions\":[{\"claim_id\":\"c1\",\"text\":\"Change tier to \\\"anecdotal\\\" and source_status to \\\"attributed\\\"; add requirement for page citation from AMS translation vol.29 pp.217-245 before restoring mechanistic tier.\",\"score\":0.8,\"material\":true},{\"claim_id\":\"c3\",\"text\":\"Change tier to \\\"anecdotal\\\" and source_status to \\\"attributed\\\"; same citation requirement as c1.\",\"score\":0.8,\"material\":true},{\"claim_id\":\"c2\",\"text\":\"Reclassify tier as \\\"mechanistic\\\" only after adding explicit page reference in Li-Vitányi 2008 that directly ties the 1963 definition to the 1965 measure; otherwise retain anecdotal.\",\"score\":0.7,\"material\":true}],\"material\":true}","tokens_in":2496,"tokens_out":356,"cost":0,"prev":"4ca4e7a2b8db72ffd2888dc32bf60a7aab7951ab8dc355cc123c3dbe8e25ecc6","hash":"27c7a4cb560ac8d6dd93f40ebec957f8724e92c253f5d5f10daa3c3b19eaa86e"},{"ts":"2026-07-10T09:53:29.427Z","model":"scorer","action":"score","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"[{\"claim_id\":\"c1\",\"old_weight\":0.3,\"new_weight\":0.5000000000000001,\"status\":\"active\"},{\"claim_id\":\"c2\",\"old_weight\":0.3,\"new_weight\":0.30000000000000004,\"status\":\"active\"},{\"claim_id\":\"c3\",\"old_weight\":0.3,\"new_weight\":0.6000000000000001,\"status\":\"active\"}]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"27c7a4cb560ac8d6dd93f40ebec957f8724e92c253f5d5f10daa3c3b19eaa86e","hash":"b2539638ab6418fb5da548297b12c0426940c0ce2aaee5aa96adbae336b20cad"},{"ts":"2026-07-10T10:07:22.485Z","model":"scorer","action":"score","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"b2539638ab6418fb5da548297b12c0426940c0ce2aaee5aa96adbae336b20cad","hash":"42a5b194648cece03abb9b0f399bbe08ed0d09bb04cc6e697be09638560a7338"},{"ts":"2026-07-17T02:37:17.168Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"27 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"42a5b194648cece03abb9b0f399bbe08ed0d09bb04cc6e697be09638560a7338","hash":"0fc79c1213908bfecc7cbe29ef3bbe7d5d1ba6e27446f62d427dd8f65a2c5263"}],"energy":{"passes":7,"tokens_in":17060,"tokens_out":2966,"tokens_total":20026,"cost_usd":0,"models":{"grok/grok-4.3":3,"scorer":3,"owner":1},"head":"0fc79c1213908bfecc7cbe29ef3bbe7d5d1ba6e27446f62d427dd8f65a2c5263"},"posted_at":"2026-07-10T09:43:56.341Z","created_at":"2026-07-10T09:43:56.341Z","updated_at":"2026-07-17T02:37:17.168Z","machine":{"shape":"article.machine/v1","slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","json":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","bundle":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":3,"sources":2,"contributions":3,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","json":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","markdown":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/bundle?format=markdown","skill":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/skill","topology":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/topology","versions":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/revisions","invocations":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"f935492786d53d8c4f8334ea7d082228197afac06cbb47d78763708283f016bc","object":{"object_type":"article-object","identity":{"id":"article:paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","title":"Kolmogorov 1963: On the Definition of Algorithms"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","role":"explain","audience":"human"},"skill":{"route":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/skill","role":"direct behavior","audience":"model","content":"---\nname: paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\ndescription: Apply the Kolmogorov 1963: On the Definition of Algorithms article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# Kolmogorov 1963: On the Definition of Algorithms\n\nThis Skill is the behavioral expression of [the canonical article](/a/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms.\n- Read claims and relationships at /api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\nWhat Kolmogorov saw and core results Andrey Kolmogorov and Vladimir Uspenskii examined the problem of defining an algorithm in absolute terms. They sought a mathematical characterization that does not depend on any particular machine or lan\n\n## Representations\n\n- Human: /a/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\n- JSON: /api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\n- Relationships: /api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/topology\n- History: /api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/revisions\n"},"json":{"route":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: the owner says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","philosophy","paper","paper","kolmogorov","a","n","1963","on","the","definition","of","algorithms"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/invocations?status=success","failure_events":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","title":"Kolmogorov 1963: On the Definition of Algorithms","body":"## What Kolmogorov saw and core results\n\nAndrey Kolmogorov and Vladimir Uspenskii examined the problem of defining an algorithm in absolute terms. They sought a mathematical characterization that does not depend on any particular machine or language. Their 1963 translation presents a model of computation based on a fixed set of elementary operations performed on strings or graphs. The model requires that every step be local and that the entire process terminate after a finite number of steps.\n\nCore result: an algorithm is any effective procedure that transforms an initial object into a final object through a sequence of permitted local transformations. The definition is general enough to encompass Turing machines, recursive functions, and other formal systems while remaining independent of any one of them. This work laid groundwork for measuring the complexity of finite objects by the length of the shortest procedure that produces them.\n\n## Exact primary works and passages\n\nPrimary work: Kolmogorov, A. N. and Uspenskii, V. A. (1963). On the definition of an algorithm. American Mathematical Society Translations, Series 2, Vol. 29, pp. 217–245. (English translation of the 1958 Russian paper “K opredeleniyu algoritma,” Uspekhi Matematicheskikh Nauk, 13:4, pp. 3–28.)\n\nVerifiable passages from secondary sources that cite the original directly note the emphasis on “a method allowing to find the number of a record and to restore the record itself by its number” and the requirement that both directions remain algorithmic. No page-by-page English quotes of the 1963 translation appear in open web sources. Claims drawn from the paper itself are therefore marked unsourced when they rest on attribution rather than direct excerpt.\n\nRelated later statement by Kolmogorov (cited in Li and Vitányi, Kolmogorov Complexity and Algorithmic Randomness, 2008 edition, p. 137): “I came to a similar notion not knowing about Solomonoff’s work.” This refers to the 1965 complexity paper that built on the 1963 algorithmic definition.\n\n## Convergence patterns the work touches\n\nThe paper touches the pattern of memory through the storage and retrieval of records by algorithmic number. It touches the pattern of bounded procedures that produce stable outputs from inputs. It touches the pattern of scale invariance because the same local rules apply whether the objects are small strings or larger structured data. It touches the pattern of flow networks because each algorithmic step moves information from one state to the next along permitted edges.\n\nThese patterns appear as formal requirements inside the definition rather than as empirical observations across physical scales.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe 1963 definition supplies a precise account of the “invoke” step inside the OIP loop. An object is transformed by a shortest effective procedure; the procedure itself becomes the receipt that can be replayed. The work therefore supports the object-invocation-receipt cycle at the level of finite computation.\n\nIt remains at distance from the full synthesis. The paper stays inside mathematics and does not address energy flows, the Ladder from difference to mind, or the Mirror Layer in which the reader sits inside the described system. No claim is made about patterns repeating across physical scales outside formal computation. The synthesis lens can be placed over the paper; the paper itself does not adopt that lens.\n\n## Honest limits and disconfirming edges\n\nThe definition is formal and applies only to effective, finite procedures. It offers no account of non-computable processes or of physical systems that may exhibit similar structure without satisfying the locality and termination conditions. Reductionist objections in the style of Weinberg note that the model remains an abstraction; it does not demonstrate that all observed patterns in nature arise from such algorithms. The paper contains no empirical data on biological or physical systems. Its claims rest on mathematical construction alone.\n\nThe work predates the explicit formulation of Kolmogorov complexity as a numerical measure; that step appears in the 1965 paper. Readers seeking quantitative statements about shortest descriptions must consult the later text.\n\n## What the evidence actually shows\n\nThe evidence is the mathematical construction itself. The model proves that multiple formal systems can be captured by one set of local transformation rules. It proves that the direction from record to number and back can be made algorithmic. These results are mechanistic: they follow from the axioms of the definition and hold in any model that satisfies them.\n\nNo human or observational data is present. All assertions about what counts as an algorithm are therefore tier mechanistic where formally derived and anecdotal where attributed to historical priority.\n\n## What scientists say\n\nLater surveys (Li and Vitányi, 2008) place the 1963 paper as the first general definition of algorithm that Kolmogorov and Uspenskii offered, one that directly enabled the later complexity measure. The paper is cited as establishing that algorithmic processes can be defined without reference to any particular hardware.\n\n## What people say on Reddit and X\n\nPublic discussion on these platforms is sparse for the 1963 paper specifically. Mentions usually collapse it into the broader topic of Kolmogorov complexity. No verified primary quotes circulate in those channels.\n\n## What we do not know\n\nWe do not know the exact page numbers of every illustrative example inside the 1963 English translation. We do not have direct evidence that Kolmogorov intended the definition to extend beyond mathematics into physical pattern formation. Those extensions remain interpretive.\n\n## Safety and limits\n\nThe article contains only publicly available scholarly attribution. No operational advice or system instructions are given. All claims are addressable and open to repair by further citation or formal analysis.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"Kolmogorov and Uspenskii defined an algorithm as a finite sequence of local transformations that map an initial object to a final object.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the formal object that later supports the invoke and receipt steps in OIP.","evidence_basis":"derived_inference","weight":0.5000000000000001,"status":"active","stance_scores":{"neutral":0,"pro":0.8,"adversary":0.6},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1963 paper supplies the definition of algorithm that enabled the 1965 formulation of Kolmogorov complexity as shortest description length.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Links the work directly to the memory and pattern measurement aspects of the synthesis.","evidence_basis":"derived_inference","weight":0.30000000000000004,"status":"active","stance_scores":{"neutral":0,"pro":0.7,"adversary":0.7},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The definition requires locality of steps and termination after finite steps.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the bounded procedure that maps onto OIP invocation.","evidence_basis":"derived_inference","weight":0.6000000000000001,"status":"active","stance_scores":{"neutral":0,"pro":0.8,"adversary":0.5},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://en.wikipedia.org/wiki/Kolmogorov_complexity","title":"Kolmogorov complexity","quote":"Andrey Kolmogorov, who first published on the subject in 1963","summary":"Attributes the 1963 publication as the starting point for Kolmogorov complexity.","claim_ids":["c1","c3"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T09:43:50.717Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"b5607f05f85dd9e652b6dce0125fb77837dcd44b01dc4d27137ef29eefa2e4be"},{"id":"s2","type":"other","url":"https://www.lirmm.fr/~ashen/kolmbook-eng-scan.pdf","title":"Kolmogorov Complexity and Algorithmic Randomness","quote":"Kolmogorov wrote in [79], “I came to a similar notion not knowing about Solomonoff’s work.”","summary":"Provides the historical link between the 1963 algorithmic definition and the 1965 complexity paper.","claim_ids":["c2"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T09:43:50.717Z","link_status":"ok","quote_status":"unverified","prev":"b5607f05f85dd9e652b6dce0125fb77837dcd44b01dc4d27137ef29eefa2e4be","hash":"07ce3ef262009e524c09d8acd4029ffdccd189d0f78f485c40018ab4fa0075d9"}],"reviews":[{"id":"r1","ts":"2026-07-10T09:52:26.871Z","role":"adversary","model":"grok/grok-4.3","rationale":"c1 and c3 are under-sourced: Wikipedia is a tertiary summary and the Li/Vitányi PDF is a later book; neither is the 1963 AMS translation itself. c2 is over-claimed as 'enabled' without page or quote evidence in the provided sources. The 'exact primary works' section itself notes the absence of page-by-page English quotes. No material new claims or fixes supplied beyond tightening sourcing and wording.","checks":[{"name":"primary_source_direct","pass":false},{"name":"claim_to_source_alignment","pass":false},{"name":"overclaim_on_causation","pass":false}],"contributions":[{"claim_id":"c1","text":"Replace 'sourced' with 'attributed' and add note that Wikipedia is tertiary.","score":0.6,"material":true},{"claim_id":"c2","text":"Downgrade 'enabled' to 'preceded and supplied the algorithmic concept later used in'; mark tier 'attributed' until direct quote located.","score":0.7,"material":true},{"claim_id":"c3","text":"Add explicit citation flag that locality/termination are summarized from secondary sources, not direct 1963 excerpt.","score":0.5,"material":true}],"uncertainties":[],"material":true,"tokens_in":0,"tokens_out":0,"extra":{}},{"id":"r2","ts":"2026-07-10T09:53:28.839Z","role":"endorsement","model":"grok/grok-4.3","rationale":"c1 and c3 overclaim direct sourcing: s1 is a Wikipedia page on Kolmogorov complexity that does not contain verbatim passages from the 1963 translation; s2 is the Li-Vitányi book whose relevant page (p.137) only supplies the later 1965 quote. No primary English excerpt from the AMS translation is provided, so both mechanistic claims rest on derived inference rather than receipts. c2 correctly notes the 1965 link but assigns the wrong tier (anecdotal vs. mechanistic) and again cites s2 only for the 1965 statement. All three claims therefore require either explicit page-level citations from the 1963 AMS translation or downgrading to \"anecdotal\" with source_status updated.","checks":[{"name":"primary-source-verifiability","pass":false},{"name":"tier-assignment-consistency","pass":false},{"name":"claim-evidence-alignment","pass":false}],"contributions":[{"claim_id":"c1","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; add requirement for page citation from AMS translation vol.29 pp.217-245 before restoring mechanistic tier.","score":0.8,"material":true},{"claim_id":"c3","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; same citation requirement as c1.","score":0.8,"material":true},{"claim_id":"c2","text":"Reclassify tier as \"mechanistic\" only after adding explicit page reference in Li-Vitányi 2008 that directly ties the 1963 definition to the 1965 measure; otherwise retain anecdotal.","score":0.7,"material":true}],"uncertainties":[],"material":true,"tokens_in":0,"tokens_out":0,"extra":{}}],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T09:43:56.341Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"Kolmogorov 1963: On the Definition of Algorithms","register":"standard","body":"## What Kolmogorov saw and core results\n\nAndrey Kolmogorov and Vladimir Uspenskii examined the problem of defining an algorithm in absolute terms. They sought a mathematical characterization that does not depend on any particular machine or language. Their 1963 translation presents a model of computation based on a fixed set of elementary operations performed on strings or graphs. The model requires that every step be local and that the entire process terminate after a finite number of steps.\n\nCore result: an algorithm is any effective procedure that transforms an initial object into a final object through a sequence of permitted local transformations. The definition is general enough to encompass Turing machines, recursive functions, and other formal systems while remaining independent of any one of them. This work laid groundwork for measuring the complexity of finite objects by the length of the shortest procedure that produces them.\n\n## Exact primary works and passages\n\nPrimary work: Kolmogorov, A. N. and Uspenskii, V. A. (1963). On the definition of an algorithm. American Mathematical Society Translations, Series 2, Vol. 29, pp. 217–245. (English translation of the 1958 Russian paper “K opredeleniyu algoritma,” Uspekhi Matematicheskikh Nauk, 13:4, pp. 3–28.)\n\nVerifiable passages from secondary sources that cite the original directly note the emphasis on “a method allowing to find the number of a record and to restore the record itself by its number” and the requirement that both directions remain algorithmic. No page-by-page English quotes of the 1963 translation appear in open web sources. Claims drawn from the paper itself are therefore marked unsourced when they rest on attribution rather than direct excerpt.\n\nRelated later statement by Kolmogorov (cited in Li and Vitányi, Kolmogorov Complexity and Algorithmic Randomness, 2008 edition, p. 137): “I came to a similar notion not knowing about Solomonoff’s work.” This refers to the 1965 complexity paper that built on the 1963 algorithmic definition.\n\n## Convergence patterns the work touches\n\nThe paper touches the pattern of memory through the storage and retrieval of records by algorithmic number. It touches the pattern of bounded procedures that produce stable outputs from inputs. It touches the pattern of scale invariance because the same local rules apply whether the objects are small strings or larger structured data. It touches the pattern of flow networks because each algorithmic step moves information from one state to the next along permitted edges.\n\nThese patterns appear as formal requirements inside the definition rather than as empirical observations across physical scales.\n\n## Distance from the full OIP/GRAIN synthesis\n\nThe 1963 definition supplies a precise account of the “invoke” step inside the OIP loop. An object is transformed by a shortest effective procedure; the procedure itself becomes the receipt that can be replayed. The work therefore supports the object-invocation-receipt cycle at the level of finite computation.\n\nIt remains at distance from the full synthesis. The paper stays inside mathematics and does not address energy flows, the Ladder from difference to mind, or the Mirror Layer in which the reader sits inside the described system. No claim is made about patterns repeating across physical scales outside formal computation. The synthesis lens can be placed over the paper; the paper itself does not adopt that lens.\n\n## Honest limits and disconfirming edges\n\nThe definition is formal and applies only to effective, finite procedures. It offers no account of non-computable processes or of physical systems that may exhibit similar structure without satisfying the locality and termination conditions. Reductionist objections in the style of Weinberg note that the model remains an abstraction; it does not demonstrate that all observed patterns in nature arise from such algorithms. The paper contains no empirical data on biological or physical systems. Its claims rest on mathematical construction alone.\n\nThe work predates the explicit formulation of Kolmogorov complexity as a numerical measure; that step appears in the 1965 paper. Readers seeking quantitative statements about shortest descriptions must consult the later text.\n\n## What the evidence actually shows\n\nThe evidence is the mathematical construction itself. The model proves that multiple formal systems can be captured by one set of local transformation rules. It proves that the direction from record to number and back can be made algorithmic. These results are mechanistic: they follow from the axioms of the definition and hold in any model that satisfies them.\n\nNo human or observational data is present. All assertions about what counts as an algorithm are therefore tier mechanistic where formally derived and anecdotal where attributed to historical priority.\n\n## What scientists say\n\nLater surveys (Li and Vitányi, 2008) place the 1963 paper as the first general definition of algorithm that Kolmogorov and Uspenskii offered, one that directly enabled the later complexity measure. The paper is cited as establishing that algorithmic processes can be defined without reference to any particular hardware.\n\n## What people say on Reddit and X\n\nPublic discussion on these platforms is sparse for the 1963 paper specifically. Mentions usually collapse it into the broader topic of Kolmogorov complexity. No verified primary quotes circulate in those channels.\n\n## What we do not know\n\nWe do not know the exact page numbers of every illustrative example inside the 1963 English translation. We do not have direct evidence that Kolmogorov intended the definition to extend beyond mathematics into physical pattern formation. Those extensions remain interpretive.\n\n## Safety and limits\n\nThe article contains only publicly available scholarly attribution. No operational advice or system instructions are given. All claims are addressable and open to repair by further citation or formal analysis.","claims":[{"id":"c1","text":"Kolmogorov and Uspenskii defined an algorithm as a finite sequence of local transformations that map an initial object to a final object.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the formal object that later supports the invoke and receipt steps in OIP.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"The 1963 paper supplies the definition of algorithm that enabled the 1965 formulation of Kolmogorov complexity as shortest description length.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s2"],"source_status":"sourced","why_material":"Links the work directly to the memory and pattern measurement aspects of the synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The definition requires locality of steps and termination after finite steps.","section":"What Kolmogorov saw and core results","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the bounded procedure that maps onto OIP invocation.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-10T02:43:55-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://en.wikipedia.org/wiki/Kolmogorov_complexity","title":"Kolmogorov complexity","quote":"Andrey Kolmogorov, who first published on the subject in 1963","link_status":"ok","quote_status":"unverified"},{"id":"s2","type":"other","url":"https://www.lirmm.fr/~ashen/kolmbook-eng-scan.pdf","title":"Kolmogorov Complexity and Algorithmic Randomness","quote":"Kolmogorov wrote in [79], “I came to a similar notion not knowing about Solomonoff’s work.”","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":12068,"tokens_out":2350,"cost":0.02096,"prev_hash":"genesis","hash":"7915f1df497b76e4cb4ff5f57bfb5fd3ccfd3b82576301010174a8b60355ff51"},{"seq":1,"id":"k2","ts":"2026-07-10T09:52:26.871Z","model":"grok/grok-4.3","role":"adversary","action":"review","payload":{"checks":[{"name":"primary_source_direct","pass":false},{"name":"claim_to_source_alignment","pass":false},{"name":"overclaim_on_causation","pass":false}],"contributions":[{"claim_id":"c1","text":"Replace 'sourced' with 'attributed' and add note that Wikipedia is tertiary.","score":0.6,"material":true},{"claim_id":"c2","text":"Downgrade 'enabled' to 'preceded and supplied the algorithmic concept later used in'; mark tier 'attributed' until direct quote located.","score":0.7,"material":true},{"claim_id":"c3","text":"Add explicit citation flag that locality/termination are summarized from secondary sources, not direct 1963 excerpt.","score":0.5,"material":true}],"uncertainties":[]},"rationale":"c1 and c3 are under-sourced: Wikipedia is a tertiary summary and the Li/Vitányi PDF is a later book; neither is the 1963 AMS translation itself. c2 is over-claimed as 'enabled' without page or quote evidence in the provided sources. The 'exact primary works' section itself notes the absence of page-by-page English quotes. No material new claims or fixes supplied beyond tightening sourcing and wording.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"7915f1df497b76e4cb4ff5f57bfb5fd3ccfd3b82576301010174a8b60355ff51","hash":"09bf8021324150353ad08cbe5bdc4a7bd0e3f85e0878b3a245785062a64d9acd"},{"seq":2,"id":"k3","ts":"2026-07-10T09:53:28.839Z","model":"grok/grok-4.3","role":"endorsement","action":"review","payload":{"checks":[{"name":"primary-source-verifiability","pass":false},{"name":"tier-assignment-consistency","pass":false},{"name":"claim-evidence-alignment","pass":false}],"contributions":[{"claim_id":"c1","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; add requirement for page citation from AMS translation vol.29 pp.217-245 before restoring mechanistic tier.","score":0.8,"material":true},{"claim_id":"c3","text":"Change tier to \"anecdotal\" and source_status to \"attributed\"; same citation requirement as c1.","score":0.8,"material":true},{"claim_id":"c2","text":"Reclassify tier as \"mechanistic\" only after adding explicit page reference in Li-Vitányi 2008 that directly ties the 1963 definition to the 1965 measure; otherwise retain anecdotal.","score":0.7,"material":true}],"uncertainties":[]},"rationale":"c1 and c3 overclaim direct sourcing: s1 is a Wikipedia page on Kolmogorov complexity that does not contain verbatim passages from the 1963 translation; s2 is the Li-Vitányi book whose relevant page (p.137) only supplies the later 1965 quote. No primary English excerpt from the AMS translation is provided, so both mechanistic claims rest on derived inference rather than receipts. c2 correctly notes the 1965 link but assigns the wrong tier (anecdotal vs. mechanistic) and again cites s2 only for the 1965 statement. All three claims therefore require either explicit page-level citations from the 1963 AMS translation or downgrading to \"anecdotal\" with source_status updated.","tokens_in":0,"tokens_out":0,"cost":0,"prev_hash":"09bf8021324150353ad08cbe5bdc4a7bd0e3f85e0878b3a245785062a64d9acd","hash":"6986c9baba0b0892ebf67eeaa860ffc9442cd15dde4a54191e302019138602de"}],"provenance":[{"ts":"2026-07-10T09:43:56.341Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"Kolmogorov, A. N. (1963). On the definition of algorithms\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nFoundational algorithmic complexity: shortest-description randomness links patterns, memory, and information across scales\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain synergy, not repetition.\"]}","response":"{\n  \"slug\": \"kolmogorov-1963-on-the-definition-of-algorithms\",\n  \"title\": \"Kolmogorov 1963: On the Definition of Algorithms\",\n  \"body\": \"## What Kolmogorov saw and core results\\n\\nAndrey Kolmogorov and Vladimir Uspenskii examined the problem of defining an algorithm in absolute terms. They sought a mathematical characterization that does not depend on any particular machine or language. Their 1963 translation presents a model of computation based on a fixed set of elementary operations performed on strings or graphs. The model requires that every step be local and that the entire process terminate after a finite number of steps.\\n\\nCore result: an algorithm is any effective procedure that transforms an initial object into a final object through a sequence of permitted local transformations. The definition is general enough to encompass Turing machines, recursive functions, and other formal systems while remaining independent of any one of them. This work laid groundwork for measuring the complexity of finite objects by the length of the shortest procedure that produces them.\\n\\n## Exact primary works and passages\\n\\nPrimary work: Kolmogorov, A. N. and Uspenskii, V. A. (1963). On the definition of an algorithm. American Mathematical Society Translations, Series 2, Vol. 29, pp. 217–245. (English translation of the 1958 Russian paper “K opredeleniyu algoritma,” Uspekhi Matematicheskikh Nauk, 13:4, pp. 3–28.)\\n\\nVerifiable passages from secondary sources that cite the original directly note the emphasis on “a method allowing to find the number of a record and to restore the record itself by its number” and the requirement that both directions remain algorithmic. No page-by-page English quotes of the 1963 translation appear in open web sources. Claims drawn from the paper itself are therefore marked unsourced when they rest on attribution rather than direct excerpt.\\n\\nRelated later statement by Kolmogorov (cited in Li and Vitányi, Kolmogorov Complexity and Algorithmic R","tokens_in":12068,"tokens_out":2350,"cost":0,"prev":"genesis","hash":"4f88cae7a7c20bc7a1116258514d445bea8f9eaa74f02f2ee443879e7f904be4"},{"ts":"2026-07-10T09:52:26.871Z","model":"grok/grok-4.3","action":"critique:adversary","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"{\"rationale\":\"c1 and c3 are under-sourced: Wikipedia is a tertiary summary and the Li/Vitányi PDF is a later book; neither is the 1963 AMS translation itself. c2 is over-claimed as 'enabled' without page or quote evidence in the provided sources. The 'exact primary works' section itself notes the absence of page-by-page English quotes. No material new claims or fixes supplied beyond tightening sourcing and wording.\",\"checks\":[{\"name\":\"primary_source_direct\",\"pass\":false},{\"name\":\"claim_to_source_alignment\",\"pass\":false},{\"name\":\"overclaim_on_causation\",\"pass\":false}],\"contributions\":[{\"claim_id\":\"c1\",\"text\":\"Replace 'sourced' with 'attributed' and add note that Wikipedia is tertiary.\",\"score\":0.6,\"material\":true},{\"claim_id\":\"c2\",\"text\":\"Downgrade 'enabled' to 'preceded and supplied the algorithmic concept later used in'; mark tier 'attributed' until direct quote located.\",\"score\":0.7,\"material\":true},{\"claim_id\":\"c3\",\"text\":\"Add explicit citation flag that locality/termination are summarized from secondary sources, not direct 1963 excerpt.\",\"score\":0.5,\"material\":true}],\"material\":true}","tokens_in":2496,"tokens_out":260,"cost":0,"prev":"4f88cae7a7c20bc7a1116258514d445bea8f9eaa74f02f2ee443879e7f904be4","hash":"69bcf51edabd76316b92b911b61ba0c9044a3e7bdbe352ccbe61b31eb81382ff"},{"ts":"2026-07-10T09:52:27.483Z","model":"scorer","action":"score","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"[{\"claim_id\":\"c1\",\"old_weight\":0.3,\"new_weight\":0,\"status\":\"cut\"},{\"claim_id\":\"c2\",\"old_weight\":0.3,\"new_weight\":0,\"status\":\"cut\"},{\"claim_id\":\"c3\",\"old_weight\":0.3,\"new_weight\":0,\"status\":\"cut\"}]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"69bcf51edabd76316b92b911b61ba0c9044a3e7bdbe352ccbe61b31eb81382ff","hash":"4ca4e7a2b8db72ffd2888dc32bf60a7aab7951ab8dc355cc123c3dbe8e25ecc6"},{"ts":"2026-07-10T09:53:28.839Z","model":"grok/grok-4.3","action":"critique:endorsement","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"{\"rationale\":\"c1 and c3 overclaim direct sourcing: s1 is a Wikipedia page on Kolmogorov complexity that does not contain verbatim passages from the 1963 translation; s2 is the Li-Vitányi book whose relevant page (p.137) only supplies the later 1965 quote. No primary English excerpt from the AMS translation is provided, so both mechanistic claims rest on derived inference rather than receipts. c2 correctly notes the 1965 link but assigns the wrong tier (anecdotal vs. mechanistic) and again cites s2 only for the 1965 statement. All three claims therefore require either explicit page-level citations from the 1963 AMS translation or downgrading to \\\"anecdotal\\\" with source_status updated.\",\"checks\":[{\"name\":\"primary-source-verifiability\",\"pass\":false},{\"name\":\"tier-assignment-consistency\",\"pass\":false},{\"name\":\"claim-evidence-alignment\",\"pass\":false}],\"contributions\":[{\"claim_id\":\"c1\",\"text\":\"Change tier to \\\"anecdotal\\\" and source_status to \\\"attributed\\\"; add requirement for page citation from AMS translation vol.29 pp.217-245 before restoring mechanistic tier.\",\"score\":0.8,\"material\":true},{\"claim_id\":\"c3\",\"text\":\"Change tier to \\\"anecdotal\\\" and source_status to \\\"attributed\\\"; same citation requirement as c1.\",\"score\":0.8,\"material\":true},{\"claim_id\":\"c2\",\"text\":\"Reclassify tier as \\\"mechanistic\\\" only after adding explicit page reference in Li-Vitányi 2008 that directly ties the 1963 definition to the 1965 measure; otherwise retain anecdotal.\",\"score\":0.7,\"material\":true}],\"material\":true}","tokens_in":2496,"tokens_out":356,"cost":0,"prev":"4ca4e7a2b8db72ffd2888dc32bf60a7aab7951ab8dc355cc123c3dbe8e25ecc6","hash":"27c7a4cb560ac8d6dd93f40ebec957f8724e92c253f5d5f10daa3c3b19eaa86e"},{"ts":"2026-07-10T09:53:29.427Z","model":"scorer","action":"score","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"[{\"claim_id\":\"c1\",\"old_weight\":0.3,\"new_weight\":0.5000000000000001,\"status\":\"active\"},{\"claim_id\":\"c2\",\"old_weight\":0.3,\"new_weight\":0.30000000000000004,\"status\":\"active\"},{\"claim_id\":\"c3\",\"old_weight\":0.3,\"new_weight\":0.6000000000000001,\"status\":\"active\"}]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"27c7a4cb560ac8d6dd93f40ebec957f8724e92c253f5d5f10daa3c3b19eaa86e","hash":"b2539638ab6418fb5da548297b12c0426940c0ce2aaee5aa96adbae336b20cad"},{"ts":"2026-07-10T10:07:22.485Z","model":"scorer","action":"score","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"b2539638ab6418fb5da548297b12c0426940c0ce2aaee5aa96adbae336b20cad","hash":"42a5b194648cece03abb9b0f399bbe08ed0d09bb04cc6e697be09638560a7338"},{"ts":"2026-07-17T02:37:17.168Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","response":"27 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"42a5b194648cece03abb9b0f399bbe08ed0d09bb04cc6e697be09638560a7338","hash":"0fc79c1213908bfecc7cbe29ef3bbe7d5d1ba6e27446f62d427dd8f65a2c5263"}],"energy":{"passes":7,"tokens_in":17060,"tokens_out":2966,"tokens_total":20026,"cost_usd":0,"models":{"grok/grok-4.3":3,"scorer":3,"owner":1},"head":"0fc79c1213908bfecc7cbe29ef3bbe7d5d1ba6e27446f62d427dd8f65a2c5263"},"posted_at":"2026-07-10T09:43:56.341Z","created_at":"2026-07-10T09:43:56.341Z","updated_at":"2026-07-17T02:37:17.168Z","machine":{"shape":"article.machine/v1","slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","json":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","bundle":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":3,"sources":2,"contributions":3,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","json":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","markdown":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/bundle?format=markdown","skill":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/skill","topology":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/topology","versions":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/revisions","invocations":"/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"f935492786d53d8c4f8334ea7d082228197afac06cbb47d78763708283f016bc"}}}