Next: About this document ...
Up: Gödel Machines: Self-Referential Universal
Previous: Acknowledgments
- 1
-
W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone.
Genetic Programming - An Introduction.
Morgan Kaufmann Publishers, San Francisco, CA, USA, 1998.
- 2
-
R. Bellman.
Adaptive Control Processes.
Princeton University Press, 1961.
- 3
-
M. Blum.
A machine-independent theory of the complexity of recursive
functions.
Journal of the ACM, 14(2):322-336, 1967.
- 4
-
M. Blum.
On effective procedures for speeding up algorithms.
Journal of the ACM, 18(2):290-305, 1971.
- 5
-
G. Cantor.
Über eine Eigenschaft des Inbegriffes aller reellen
algebraischen Zahlen.
Crelle's Journal für Mathematik, 77:258-263, 1874.
- 6
-
G.J. Chaitin.
A theory of program size formally identical to information theory.
Journal of the ACM, 22:329-340, 1975.
- 7
-
W.F. Clocksin and C.S. Mellish.
Programming in Prolog (3rd ed.).
Springer-Verlag, 1987.
- 8
-
N. L. Cramer.
A representation for the adaptive generation of simple sequential
programs.
In J.J. Grefenstette, editor, Proceedings of an International
Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon
University, July 24-26, 1985, Hillsdale NJ, 1985. Lawrence Erlbaum
Associates.
- 9
-
M. C. Fitting.
First-Order Logic and Automated Theorem Proving.
Graduate Texts in Computer Science. Springer-Verlag, Berlin, 2nd
edition, 1996.
- 10
-
K. Gödel.
Über formal unentscheidbare Sätze der Principia Mathematica
und verwandter Systeme I.
Monatshefte für Mathematik und Physik, 38:173-198, 1931.
- 11
-
W. Heisenberg.
Über den anschaulichen Inhalt der quantentheoretischen Kinematik
und Mechanik.
Zeitschrift für Physik, 33:879-893, 1925.
- 12
-
S. Hochreiter, A. S. Younger, and P. R. Conwell.
Learning to learn using gradient descent.
In Lecture Notes on Comp. Sci. 2130, Proc. Intl. Conf. on
Artificial Neural Networks (ICANN-2001), pages 87-94. Springer: Berlin,
Heidelberg, 2001.
- 13
-
D. R. Hofstadter.
Gödel, Escher, Bach: an Eternal Golden Braid.
Basic Books, 1979.
- 14
-
J. H. Holland.
Properties of the bucket brigade.
In Proceedings of an International Conference on Genetic
Algorithms. Lawrence Erlbaum, Hillsdale, NJ, 1985.
- 15
-
M. Hutter.
Towards a universal theory of artificial intelligence based on
algorithmic probability and sequential decisions.
Proceedings of the 12 European Conference on Machine
Learning (ECML-2001), pages 226-238, 2001.
(On J. Schmidhuber's SNF grant 20-61847).
- 16
-
M. Hutter.
The fastest and shortest algorithm for all well-defined problems.
International Journal of Foundations of Computer Science,
13(3):431-443, 2002.
(On J. Schmidhuber's SNF grant 20-61847).
- 17
-
M. Hutter.
Self-optimizing and Pareto-optimal policies in general environments
based on Bayes-mixtures.
In J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th
Annual Conference on Computational Learning Theory (COLT 2002), Lecture
Notes in Artificial Intelligence, pages 364-379, Sydney, Australia, 2002.
Springer.
(On J. Schmidhuber's SNF grant 20-61847).
- 18
-
L.P. Kaelbling, M.L. Littman, and A.W. Moore.
Reinforcement learning: a survey.
Journal of AI research, 4:237-285, 1996.
- 19
-
A. N. Kolmogorov.
Grundbegriffe der Wahrscheinlichkeitsrechnung.
Springer, Berlin, 1933.
- 20
-
A.N. Kolmogorov.
Three approaches to the quantitative definition of information.
Problems of Information Transmission, 1:1-11, 1965.
- 21
-
D. Lenat.
Theory formation by heuristic search.
Machine Learning, 21, 1983.
- 22
-
L. A. Levin.
Universal sequential search problems.
Problems of Information Transmission, 9(3):265-266, 1973.
- 23
-
L. A. Levin.
Laws of information (nongrowth) and aspects of the foundation of
probability theory.
Problems of Information Transmission, 10(3):206-210, 1974.
- 24
-
L. A. Levin.
Randomness conservation inequalities: Information and independence in
mathematical theories.
Information and Control, 61:15-37, 1984.
- 25
-
M. Li and P. M. B. Vitányi.
An Introduction to Kolmogorov Complexity and its Applications
(2nd edition).
Springer, 1997.
- 26
-
C. H. Moore and G. C. Leach.
FORTH - a language for interactive computing, 1970.
http://www.ultratechnology.com.
- 27
-
R. Penrose.
Shadows of the mind.
Oxford University Press, 1994.
- 28
-
A. L. Samuel.
Some studies in machine learning using the game of checkers.
IBM Journal on Research and Development, 3:210-229, 1959.
- 29
-
J. Schmidhuber.
Evolutionary principles in self-referential learning. Diploma
thesis, Institut für Informatik, Technische Universität München,
1987.
- 30
-
J. Schmidhuber.
Reinforcement learning in Markovian and non-Markovian
environments.
In D. S. Lippman, J. E. Moody, and D. S. Touretzky, editors, Advances in Neural Information Processing Systems 3, pages 500-506. Morgan
Kaufmann, 1991.
- 31
-
J. Schmidhuber.
A self-referential weight matrix.
In Proceedings of the International Conference on Artificial
Neural Networks, Amsterdam, pages 446-451. Springer, 1993.
- 32
-
J. Schmidhuber.
On learning how to learn learning strategies.
Technical Report FKI-198-94, Fakultät für Informatik,
Technische Universität München, 1994.
See [47,45].
- 33
-
J. Schmidhuber.
Discovering solutions with low Kolmogorov complexity and high
generalization capability.
In A. Prieditis and S. Russell, editors, Machine Learning:
Proceedings of the Twelfth International Conference, pages 488-496. Morgan
Kaufmann Publishers, San Francisco, CA, 1995.
- 34
-
J. Schmidhuber.
A computer scientist's view of life, the universe, and everything.
In C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of
Computer Science: Potential - Theory - Cognition, volume 1337, pages
201-208. Lecture Notes in Computer Science, Springer, Berlin, 1997.
- 35
-
J. Schmidhuber.
Discovering neural nets with low Kolmogorov complexity and high
generalization capability.
Neural Networks, 10(5):857-873, 1997.
- 36
-
J. Schmidhuber.
Algorithmic theories of everything.
Technical Report IDSIA-20-00, quant-ph/0011122, IDSIA, Manno
(Lugano), Switzerland, 2000.
Sections 1-5: see [37]; Section 6: see
[39].
- 37
-
J. Schmidhuber.
Hierarchies of generalized Kolmogorov complexities and
nonenumerable universal measures computable in the limit.
International Journal of Foundations of Computer Science,
13(4):587-612, 2002.
- 38
-
J. Schmidhuber.
Optimal ordered problem solver.
Technical Report IDSIA-12-02, IDSIA, Manno-Lugano, Switzerland, 2002.
Available at arXiv:cs.AI/0207097 or http://www.idsia.ch/~
juergen/oops.html. Machine Learning Journal, Kluwer, 2003, accepted.
- 39
-
J. Schmidhuber.
The Speed Prior: a new simplicity measure yielding near-optimal
computable predictions.
In J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th
Annual Conference on Computational Learning Theory (COLT 2002), Lecture
Notes in Artificial Intelligence, pages 216-228. Springer, Sydney,
Australia, 2002.
- 40
-
J. Schmidhuber.
Bias-optimal incremental problem solving.
In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in
Neural Information Processing Systems 15, pages 1571-1578, Cambridge, MA,
2003. MIT Press.
- 41
-
J. Schmidhuber.
Gödel machines: self-referential universal problem solvers making
provably optimal self-improvements.
Technical Report IDSIA-19-03, arXiv:cs.LO/0309048, IDSIA,
Manno-Lugano, Switzerland, v1: Sep, v2: Oct, v3: Dec 2003.
- 42
-
J. Schmidhuber.
The new AI: General & sound & relevant for physics.
In B. Goertzel and C. Pennachin, editors, Real AI: New
Approaches to Artificial General Intelligence. 2003.
Accepted. Also available as TR IDSIA-04-03, cs.AI/0302012.
- 43
-
J. Schmidhuber.
The new AI: General & sound & relevant for physics.
Technical Report TR IDSIA-04-03, Version 1.0, cs.AI/0302012 v1,
February 2003.
- 44
-
J. Schmidhuber.
Towards solving the grand problem of AI.
In P. Quaresma, A. Dourado, E. Costa, and J. F. Costa, editors, Soft Computing and complex systems, pages 77-97. Centro Internacional de
Mathematica, Coimbra, Portugal, 2003.
Based on [43].
- 45
-
J. Schmidhuber, J. Zhao, and N. Schraudolph.
Reinforcement learning with self-modifying policies.
In S. Thrun and L. Pratt, editors, Learning to learn, pages
293-309. Kluwer, 1997.
- 46
-
J. Schmidhuber, J. Zhao, and M. Wiering.
Simple principles of metalearning.
Technical Report IDSIA-69-96, IDSIA, 1996.
See [47,45].
- 47
-
J. Schmidhuber, J. Zhao, and M. Wiering.
Shifting inductive bias with success-story algorithm, adaptive
Levin search, and incremental self-improvement.
Machine Learning, 28:105-130, 1997.
- 48
-
R.J. Solomonoff.
A formal theory of inductive inference. Part I.
Information and Control, 7:1-22, 1964.
- 49
-
R.J. Solomonoff.
Complexity-based induction systems.
IEEE Transactions on Information Theory, IT-24(5):422-432,
1978.
- 50
-
R.J. Solomonoff.
Progress in incremental machine learning--Preliminary Report for
NIPS 2002 Workshop on Universal Learners and Optimal Search; revised Sept
2003.
Technical Report IDSIA-16-03, IDSIA, Lugano, 2003.
- 51
-
R. Sutton and A. Barto.
Reinforcement learning: An introduction.
Cambridge, MA, MIT Press, 1998.
- 52
-
A. M. Turing.
On computable numbers, with an application to the
Entscheidungsproblem.
Proceedings of the London Mathematical Society, Series 2,
41:230-267, 1936.
- 53
-
K. Zuse.
Rechnender Raum.
Friedrich Vieweg & Sohn, Braunschweig, 1969.
English translation: Calculating Space, MIT Technical
Translation AZT-70-164-GEMIT, Massachusetts Institute of Technology (Proj.
MAC), Cambridge, Mass. 02139, Feb. 1970.
Juergen Schmidhuber
2003-12-11
Back to Goedel machine home page