{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "martin-lof-effective-randomness-1966",
    "title": "Martin-Löf: universal effective tests for random sequences",
    "summary": "Martin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity.\n\nA sequence can look patternless to one test yet fail another. The paper organizes every test in a precisely defined computable class into a universal test. For infinite fair-coin sequences, randomness means that the evidence for rejection stays bounded as the prefix grows. The theory also treats computable probability distributions and a separate Bernoulli notion based on where successes occur. It gives an individual-sequence foundation for randomness, rather than a finite checklist certifying every observed output.",
    "boundary": "The universal quantifier is over recursively enumerable tests with stated significance bounds, not every conceivable arbitrary set or a practical finite battery. Fair-coin tests, tests for a fixed computable distribution, and conditional Bernoulli tests are distinct constructions. Finite critical levels depend on the test up to an additive constant; the infinite definition is invariant under universal-test choice. Finite complexity uses plain conditional program length given length/counts, not later prefix-free characterizations silently substituted. Almost-sure statements apply to the declared measure or Bernoulli class, not causal trust, scientific correctness or cryptographic unpredictability. Any finite prefix admits a computable nonrandom extension, so finite successful tests cannot certify infinite randomness. The final convergence proof sketches a recursive bound rather than fully displaying it. Full proof/glyph certification and experiment replay were not performed.",
    "area": "Algorithmic randomness",
    "topic": "Mathematics",
    "year": 1966,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "martin-lof-effective-randomness-1966",
    "target": {
      "record_id": "urn:uuid:5adc9418-22c9-4af0-a010-94601b5a7c56",
      "version": 1,
      "content_hash": "sha256:13c5891f3414cdf01beb7ac4f3b1a67c06b383cbf14bbf1352e0dfcb656af29a"
    },
    "humans": [
      "Per Martin-Löf"
    ],
    "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-algorithmic-information-1965",
      "solomonoff-formal-inductive-inference-i-1964",
      "kolmogorov-probability"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-martin-lof-random-sequences-1966-original",
        "title": "Per Martin-Löf, The Definition of Random Sequences (Information and Control 9,602-619,December1966), original article scan",
        "url": "https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Definition-of-Random-Sequences-1966.pdf"
      }
    ],
    "points": "230000",
    "published_grade": {
      "id": "martin-lof-effective-randomness-1966",
      "entry_id": "martin-lof-effective-randomness-1966",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:5adc9418-22c9-4af0-a010-94601b5a7c56",
        "version": 1,
        "content_hash": "sha256:13c5891f3414cdf01beb7ac4f3b1a67c06b383cbf14bbf1352e0dfcb656af29a"
      },
      "what_changed": "Martin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity.",
      "scope": "Martin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity. The universal quantifier is over recursively enumerable tests with stated significance bounds, not every conceivable arbitrary set or a practical finite battery. Fair-coin tests, tests for a fixed computable distribution, and conditional Bernoulli tests are distinct constructions. Finite critical levels depend on the test up to an additive constant; the infinite definition is invariant under universal-test choice. Finite complexity uses plain conditional program length given length/counts, not later prefix-free characterizations silently substituted. Almost-sure statements apply to the declared measure or Bernoulli class, not causal trust, scientific correctness or cryptographic unpredictability. Any finite prefix admits a computable nonrandom extension, so finite successful tests cannot certify infinite randomness. The final convergence proof sketches a recursive bound rather than fully displaying it. Full proof/glyph certification and experiment replay were not performed.",
      "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:5adc9418-22c9-4af0-a010-94601b5a7c56",
        "version": 1,
        "content_hash": "sha256:13c5891f3414cdf01beb7ac4f3b1a67c06b383cbf14bbf1352e0dfcb656af29a"
      },
      "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": "Per Martin-Löf",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Per Martin-Löf, The Definition of Random Sequences (Information and Control 9,602-619,December1966), original article scan",
            "url": "https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Definition-of-Random-Sequences-1966.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Per Martin-Löf, The Definition of Random Sequences (Information and Control 9,602-619,December1966), original article scan",
            "url": "https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Definition-of-Random-Sequences-1966.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The universal quantifier is over recursively enumerable tests with stated significance bounds, not every conceivable arbitrary set or a practical finite battery. Fair-coin tests, tests for a fixed computable distribution, and conditional Bernoulli tests are distinct constructions. Finite critical levels depend on the test up to an additive constant; the infinite definition is invariant under universal-test choice. Finite complexity uses plain conditional program length given length/counts, not later prefix-free characterizations silently substituted. Almost-sure statements apply to the declared measure or Bernoulli class, not causal trust, scientific correctness or cryptographic unpredictability. Any finite prefix admits a computable nonrandom extension, so finite successful tests cannot certify infinite randomness. The final convergence proof sketches a recursive bound rather than fully displaying it. Full proof/glyph certification and experiment replay were not performed.",
        "domain": "Algorithmic randomness"
      },
      "sources": [
        {
          "citation": "Per Martin-Löf, The Definition of Random Sequences (Information and Control 9,602-619,December1966), original article scan",
          "url": "https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Definition-of-Random-Sequences-1966.pdf"
        }
      ],
      "statement": "# Martin-Löf: universal effective tests for random sequences\n\nMartin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity.\n\nA sequence can look patternless to one test yet fail another. The paper organizes every test in a precisely defined computable class into a universal test. For infinite fair-coin sequences, randomness means that the evidence for rejection stays bounded as the prefix grows. The theory also treats computable probability distributions and a separate Bernoulli notion based on where successes occur. It gives an individual-sequence foundation for randomness, rather than a finite checklist certifying every observed output.\n\n## Scientific scope\n\nThe universal quantifier is over recursively enumerable tests with stated significance bounds, not every conceivable arbitrary set or a practical finite battery. Fair-coin tests, tests for a fixed computable distribution, and conditional Bernoulli tests are distinct constructions. Finite critical levels depend on the test up to an additive constant; the infinite definition is invariant under universal-test choice. Finite complexity uses plain conditional program length given length/counts, not later prefix-free characterizations silently substituted. Almost-sure statements apply to the declared measure or Bernoulli class, not causal trust, scientific correctness or cryptographic unpredictability. Any finite prefix admits a computable nonrandom extension, so finite successful tests cannot certify infinite randomness. The final convergence proof sketches a recursive bound rather than fully displaying it. Full proof/glyph certification and experiment replay were not performed.\n\n## People and systems\n\nPer Martin-Löf\n\n\n\n## Original sources\n\n- [Per Martin-Löf, The Definition of Random Sequences (Information and Control 9,602-619,December1966), original article scan](https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Definition-of-Random-Sequences-1966.pdf)\n",
      "summary": "Martin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity.\n\nA sequence can look patternless to one test yet fail another. The paper organizes every test in a precisely defined computable class into a universal test. For infinite fair-coin sequences, randomness means that the evidence for rejection stays bounded as the prefix grows. The theory also treats computable probability distributions and a separate Bernoulli notion based on where successes occur. It gives an individual-sequence foundation for randomness, rather than a finite checklist certifying every observed output.",
      "title": "Martin-Löf: universal effective tests for random sequences"
    },
    "record_id": "urn:uuid:5adc9418-22c9-4af0-a010-94601b5a7c56",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:5adc9418-22c9-4af0-a010-94601b5a7c56",
      "version": 1,
      "content_hash": "sha256:13c5891f3414cdf01beb7ac4f3b1a67c06b383cbf14bbf1352e0dfcb656af29a"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:e8249a57c32282d6625bb57cb24708a523297e6cf7ae41862f2bc96797a97041"
  },
  "target": {
    "record_id": "urn:uuid:5adc9418-22c9-4af0-a010-94601b5a7c56",
    "version": 1,
    "content_hash": "sha256:13c5891f3414cdf01beb7ac4f3b1a67c06b383cbf14bbf1352e0dfcb656af29a"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "martin-lof-effective-randomness-1966",
    "entry_id": "martin-lof-effective-randomness-1966",
    "revision": 1,
    "title": "Martin-Löf: universal effective tests for random sequences",
    "context": "Algorithmic randomness",
    "track": "Algorithmic randomness",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Martin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity.",
    "scope": "Martin-Löf constructs universal effective tests and defines infinite random binary sequences by avoidance of effectively specified null tests, connecting finite-string randomness to conditional description complexity. The universal quantifier is over recursively enumerable tests with stated significance bounds, not every conceivable arbitrary set or a practical finite battery. Fair-coin tests, tests for a fixed computable distribution, and conditional Bernoulli tests are distinct constructions. Finite critical levels depend on the test up to an additive constant; the infinite definition is invariant under universal-test choice. Finite complexity uses plain conditional program length given length/counts, not later prefix-free characterizations silently substituted. Almost-sure statements apply to the declared measure or Bernoulli class, not causal trust, scientific correctness or cryptographic unpredictability. Any finite prefix admits a computable nonrandom extension, so finite successful tests cannot certify infinite randomness. The final convergence proof sketches a recursive bound rather than fully displaying it. Full proof/glyph certification and experiment replay were not performed.",
    "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": "Per Martin-Löf, The Definition of Random Sequences (Information and Control 9,602-619, December 1966), original article scan",
        "url": "https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Definition-of-Random-Sequences-1966.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Per Martin-Löf",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:5adc9418-22c9-4af0-a010-94601b5a7c56",
      "version": 1,
      "content_hash": "sha256:13c5891f3414cdf01beb7ac4f3b1a67c06b383cbf14bbf1352e0dfcb656af29a"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "230000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}