{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "kolmogorov-algorithmic-information-1965",
    "title": "Kolmogorov: description length through algorithms",
    "summary": "Kolmogorov measured the complexity of a finite object relative to given information by the shortest program producing it. An optimal method compares with other effective methods up to an additive constant.\n\nThe algorithmic approach separates the size of a description from statistical probabilities or the object's meaning. It supplies a language for compression and individual finite objects, distinct from Kolmogorov's probability axioms and turbulence work.",
    "boundary": "Objects require an encoding and description method. The comparison constant is not zero, and the resulting complexity is not generally computable. Program length does not charge the time needed to find or execute a program.",
    "area": "Algorithmic information",
    "topic": "Algorithmic information",
    "year": 1965,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "kolmogorov-algorithmic-information-1965",
    "target": {
      "record_id": "urn:uuid:026ba093-ba39-475a-a040-741020d5f02b",
      "version": 1,
      "content_hash": "sha256:1e0a1ed760c96674f0dd1d90cd020612f1d6f5296c379f8d5c9042755657970f"
    },
    "humans": [
      "Andrey N. Kolmogorov"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "kolmogorov-probability"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "pc26-kolmogorov-algorithmic-information-1965",
        "title": "Three approaches to the quantitative definition of information (1965); English translation (1968)",
        "url": "https://doi.org/10.1080/00207166808803030"
      }
    ],
    "points": "235000",
    "published_grade": {
      "id": "kolmogorov-algorithmic-information-1965",
      "entry_id": "kolmogorov-algorithmic-information-1965",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:026ba093-ba39-475a-a040-741020d5f02b",
        "version": 1,
        "content_hash": "sha256:1e0a1ed760c96674f0dd1d90cd020612f1d6f5296c379f8d5c9042755657970f"
      },
      "what_changed": "Description length under optimal methods supplies a non-probabilistic account of the information in an individual object, invariant up to an additive constant and generally noncomputable.",
      "scope": "Description length under optimal methods supplies a non-probabilistic account of the information in an individual object, invariant up to an additive constant and generally noncomputable. Objects require an encoding and description method. The comparison constant is not zero, and the resulting complexity is not generally computable. Program length does not charge the time needed to find or execute a program.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:026ba093-ba39-475a-a040-741020d5f02b",
        "version": 1,
        "content_hash": "sha256:1e0a1ed760c96674f0dd1d90cd020612f1d6f5296c379f8d5c9042755657970f"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Andrey N. Kolmogorov",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Three approaches to the quantitative definition of information (1965); English translation (1968)",
            "url": "https://doi.org/10.1080/00207166808803030"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Three approaches to the quantitative definition of information (1965); English translation (1968)",
            "url": "https://doi.org/10.1080/00207166808803030"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Objects require an encoding and description method. The comparison constant is not zero, and the resulting complexity is not generally computable. Program length does not charge the time needed to find or execute a program.",
        "domain": "Algorithmic information"
      },
      "sources": [
        {
          "citation": "Three approaches to the quantitative definition of information (1965); English translation (1968)",
          "url": "https://doi.org/10.1080/00207166808803030"
        }
      ],
      "statement": "# Kolmogorov: description length through algorithms\n\nKolmogorov measured the complexity of a finite object relative to given information by the shortest program producing it. An optimal method compares with other effective methods up to an additive constant.\n\nThe algorithmic approach separates the size of a description from statistical probabilities or the object's meaning. It supplies a language for compression and individual finite objects, distinct from Kolmogorov's probability axioms and turbulence work.\n\n## Scientific scope\n\nObjects require an encoding and description method. The comparison constant is not zero, and the resulting complexity is not generally computable. Program length does not charge the time needed to find or execute a program.\n\n## People and systems\n\nAndrey N. Kolmogorov\n\n\n\n## Original sources\n\n- [Three approaches to the quantitative definition of information (1965); English translation (1968)](https://doi.org/10.1080/00207166808803030)\n",
      "summary": "Kolmogorov measured the complexity of a finite object relative to given information by the shortest program producing it. An optimal method compares with other effective methods up to an additive constant.\n\nThe algorithmic approach separates the size of a description from statistical probabilities or the object's meaning. It supplies a language for compression and individual finite objects, distinct from Kolmogorov's probability axioms and turbulence work.",
      "title": "Kolmogorov: description length through algorithms"
    },
    "record_id": "urn:uuid:026ba093-ba39-475a-a040-741020d5f02b",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:026ba093-ba39-475a-a040-741020d5f02b",
      "version": 1,
      "content_hash": "sha256:1e0a1ed760c96674f0dd1d90cd020612f1d6f5296c379f8d5c9042755657970f"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:8ba9952a91b40ca4a5ecacd1aaf96e0428c62f7e2df36af6da82e86930f5dd17"
  },
  "target": {
    "record_id": "urn:uuid:026ba093-ba39-475a-a040-741020d5f02b",
    "version": 1,
    "content_hash": "sha256:1e0a1ed760c96674f0dd1d90cd020612f1d6f5296c379f8d5c9042755657970f"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "kolmogorov-algorithmic-information-1965",
    "entry_id": "kolmogorov-algorithmic-information-1965",
    "revision": 1,
    "title": "Kolmogorov: description length through algorithms",
    "context": "Algorithmic information",
    "track": "Algorithmic information",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-03",
    "evidence_cutoff": "2026-10-03",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Description length under optimal methods supplies a non-probabilistic account of the information in an individual object, invariant up to an additive constant and generally noncomputable.",
    "scope": "Description length under optimal methods supplies a non-probabilistic account of the information in an individual object, invariant up to an additive constant and generally noncomputable. Objects require an encoding and description method. The comparison constant is not zero, and the resulting complexity is not generally computable. Program length does not charge the time needed to find or execute a program.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Three approaches to the quantitative definition of information (1965); English translation (1968)",
        "url": "https://doi.org/10.1080/00207166808803030",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Andrey N. Kolmogorov",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:026ba093-ba39-475a-a040-741020d5f02b",
      "version": 1,
      "content_hash": "sha256:1e0a1ed760c96674f0dd1d90cd020612f1d6f5296c379f8d5c9042755657970f"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "235000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}