Proceedings of the 3d Conference on Artificial General Intelligence (2010)

<Previous Article In Volume
Next Article In Volume>

Towards Practical Universal Search

Authors
Tom Schaul, Jürgen Schmidhuber
Corresponding Author
Tom Schaul
Available Online June 2010.
DOI
10.2991/agi.2010.19How to use a DOI?
Abstract

Universal Search is the asymptotically fastest way of finding a program that calculates a solution to a given problem, provided nothing is known about the problem except that there is a fast way of verifying solutions.

Copyright
© 2010, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 3d Conference on Artificial General Intelligence (2010)
Series
Advances in Intelligent Systems Research
Publication Date
June 2010
ISBN
978-90-78677-36-9
ISSN
1951-6851
DOI
10.2991/agi.2010.19How to use a DOI?
Copyright
© 2010, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

risenwbib
TY  - CONF
AU  - Tom Schaul
AU  - Jürgen Schmidhuber
PY  - 2010/06
DA  - 2010/06
TI  - Towards Practical Universal Search
BT  - Proceedings of the 3d Conference on Artificial General Intelligence (2010)
PB  - Atlantis Press
SP  - 82
EP  - 87
SN  - 1951-6851
UR  - https://doi.org/10.2991/agi.2010.19
DO  - 10.2991/agi.2010.19
ID  - Schaul2010/06
ER  -