{
  "annotation_id": "2a5aad13-a22b-4308-a637-8694d36229d1",
  "date_created": "2026-03-02T18:02:45.043000Z",
  "date_modified": "2026-03-02T18:02:45.043000Z",
  "file_hash": "c69aa0e92ce938f32e67a055032a852c95055f208e2df900e66e0d30f2e3ad66",
  "private": false,
  "record": {
    "abstract": "Is the universe computable? If so, it may be much cheaper in terms of\ninformation requirements to compute all computable universes instead of just\nours. I apply basic concepts of Kolmogorov complexity theory to the set of\npossible universes, and chat about perceived and true randomness, life,\ngeneralization, and learning in a given universe.",
    "arxiv_id": "quant-ph/9904050",
    "authors": [
      "Juergen Schmidhuber"
    ],
    "categories": [
      "quant-ph",
      "cs.CC",
      "cs.CY",
      "physics.comp-ph",
      "physics.pop-ph"
    ],
    "journal_ref": "In C. Freksa, ed., Foundations of Computer Science: Potential -\n  Theory - Cognition, Lecture Notes in Computer Science, pp. 201-208, Springer,\n  1997",
    "title": "A Computer Scientist\u0027s View of Life, the Universe, and Everything",
    "url": "https://arxiv.org/abs/quant-ph/9904050"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "910d92ed-0f45-4e09-8cdb-4af1ea90b718",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}