flâneur — a map of the web's best reading

GOEDEL MACHINE HOME PAGE

people.idsia.ch · 796 words · saved by 1 readers

Disclaimer: Goedel machines can be implemented on traditional computers! No hypothetical super-Turing capabilities and the like. Is the GM conscious? Is consciousness the ability to execute unlimited self- inspection and provably useful self-change (modulo limits of computability and provability)? Then the Goedel machine's Global Optimality Theorem provides the first technical justification of consciousness in the context of general problem solving. Gödel machine papers: 9. B. R. Steunebrink, J. Schmidhuber. Towards an Actual Gödel Machine Implementation. In P. Wang, B. Goertzel, eds., Theoretical Foundations of Artificial General Intelligence. Springer, 2012. PDF. 8. B. Steunebrink, J. Schmidhuber. A Family of Gödel Machine Implementations. In Proc. Fourth Conference on Artificial General Intelligence (AGI-11), Google, Mountain View, California, 2011. PDF. 7. J. Schmidhuber. Ultimate Cognition à la Gödel. Cognitive Computation 1(2):177-193, 2009. PDF. (Springer.) 6. J. Schmidhuber. Co

GOEDEL MACHINE HOME PAGE Scroll this page all the way down for abstract, papers, talks Jürgen Schmidhuber 's GÖDEL MACHINE HOME PAGE Original preprint cs.LO/0309048 (2003, revised 2006): PDF arXiv (old v4 html) bibtex Summary FAQ Journal (PDF, 2009) Goedel machines are self-referential universal problem solvers making provably optimal self- improvements. They formalize I. J. Good's informal remarks (1965) on an "intelligence explosion" through self-improving "super-intelligences". Related links: Meta-Learning Optimal scientist Reinforcement AI Universal AI History converging? Publica

Explore this link on the map →

related reading