{"slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","verification":{"valid":true,"entries":3,"head":"6986c9baba0b0892ebf67eeaa860ffc9442cd15dde4a54191e302019138602de"},"count":3,"models":["grok/grok-4.3"],"yield":{"passes":3,"energy_spent_rows":0,"total_cost_usd":0.02096,"waste_cost_usd":0,"total_tokens":14418,"material_outputs":0,"usd_per_output":null,"models":[{"model":"grok/grok-4.3","passes":3,"cost_usd":0.02096,"tokens_total":14418,"outputs":0,"waste_passes":0,"usd_per_output":null}],"constraints":{"constitution":"/api/articles/constitution","collaborate_schema":"POST /api/protocol/collaborate","pricing_ppm":{"grok-4.3":[1.25,2.5],"grok/grok-4.3":[1.25,2.5],"grok-build-0.1":[1,2],"kimi/moonshot-v1-8k":[0.15,0.15],"gemini/gemini-2.5-flash":[0.075,0.3],"gemini/gemini-2.0-flash-lite":[0.075,0.3],"openai/gpt-4o":[2.5,10],"openai/gpt-4o-mini":[0.15,0.6],"system/reflex":[0,0],"ingest:deterministic":[0,0],"fill-slots":[0,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"}]}