A simple reflective interpreter
Lisp and Symbolic Computation - Special issue on computational reflection
Lisp in small pieces
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
Completely self-referential optimal reinforcement learners
ICANN'05 Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II
Real-world limits to algorithmic intelligence
AGI'11 Proceedings of the 4th international conference on Artificial general intelligence
| Hi-index | 0.00 |
The Gödel Machine is a universal problem solver encoded as a completely self-referential program capable of rewriting any part of itself, provided it can prove that the rewrite is useful according to some utility function, encoded within itself. Based on experience gained by constructing a virtual machine capable of running the first Gödel Machine implementation written in self-referential code, we discuss several important refinements of the original concept. We also show how different approaches to implementing the proof search leads to a family of possible Gödel Machine implementations.