{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","urls":{"read":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","title":"Kolmogorov 1963: On the Definition of Algorithms","register":"standard","tags":["oip","philosophy","paper"],"updated_at":"2026-07-10T10:07:22.485Z","body_excerpt":"## 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. ","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","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.","tier":"mechanistic","weight":0.5000000000000001,"section":"What Kolmogorov saw and core results","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the formal object that later supports the invoke and receipt steps in OIP.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c3","text":"The definition requires locality of steps and termination after finite steps.","tier":"mechanistic","weight":0.6000000000000001,"section":"What Kolmogorov saw and core results","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the bounded procedure that maps onto OIP invocation.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c2","text":"The 1963 paper supplies the definition of algorithm that enabled the 1965 formulation of Kolmogorov complexity as shortest description length.","tier":"anecdotal","weight":0.30000000000000004,"section":"Exact primary works and passages","slot":null,"interaction_risk":false,"status":"active","source_ids":["s2"],"source_status":"sourced","why_material":"Links the work directly to the memory and pattern measurement aspects of the synthesis.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true}],"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"],"link_status":"ok","quote_status":"unverified","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"],"link_status":"ok","quote_status":"unverified","hash":"07ce3ef262009e524c09d8acd4029ffdccd189d0f78f485c40018ab4fa0075d9"}],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"questions":[],"evidence":[],"edges":[],"error":"question graph tables missing"},"honesty":{"active_claims":3,"retracted_claims":0,"cut_claims":0,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":3,"claims_total":3,"sources":2,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}