{"slug":"paper-kolmogorov-a-n-1963-on-the-definition-of-algorithms","verification":{"valid":true,"entries":6,"head":"42a5b194648cece03abb9b0f399bbe08ed0d09bb04cc6e697be09638560a7338"},"energy":{"passes":6,"tokens_in":17060,"tokens_out":2966,"tokens_total":20026,"cost_usd":0,"models":{"grok/grok-4.3":3,"scorer":3},"head":"42a5b194648cece03abb9b0f399bbe08ed0d09bb04cc6e697be09638560a7338"},"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"}]}