# On the Computability of AIXI

@article{Leike2015OnTC, title={On the Computability of AIXI}, author={J. Leike and Marcus Hutter}, journal={ArXiv}, year={2015}, volume={abs/1510.05572} }

How could we solve the machine learning and the artificial intelligence problem if we had infinite computation? Solomonoff induction and the reinforcement learning agent AIXI are proposed answers to this question. Both are known to be incomputable. In this paper, we quantify this using the arithmetical hierarchy, and prove upper and corresponding lower bounds for in-computability. We show that AIXI is not limit computable, thus it cannot be approximated using finite computation. Our main result… CONTINUE READING

8 Citations

On the Computability of Solomonoff Induction and Knowledge-Seeking

- Computer Science, Mathematics
- 2015

- 11
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 27 REFERENCES

On the Computability of Solomonoff Induction and Knowledge-Seeking

- Computer Science, Mathematics
- 2015

- 11
- PDF

A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

- Computer Science, Mathematics
- 2000

- 60
- PDF

On the undecidability of probabilistic planning and related stochastic optimization problems

- Computer Science, Mathematics
- 2003

- 204