• DOI:10.1007/978-3-319-24486-0_24
Corpus ID: 2255978

On the Computability of Solomonoff Induction and Knowledge-Seeking

@article{Leike2015OnTC,
  title={On the Computability of Solomonoff Induction and Knowledge-Seeking},
  author={J. Leike and Marcus Hutter},
  journal={ArXiv},
  year={2015},
  volume={abs/1507.04124}
}

J. Leike, Marcus Hutter

Published 2015

Computer Science, Mathematics

ArXiv

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

Solomonoff induction is held as a gold standard for learning, but it is known to be incomputable. We quantify its incomputability by placing various flavors of Solomonoff's prior M in the arithmetical hierarchy. We also derive computability bounds for knowledge-seeking agents, and give a limit-computable weakly asymptotically optimal reinforcement learning agent.