Ultimate cognition à la gödel

Research output: Contribution to journalArticlepeer-review

47 Scopus citations

Abstract

"All life is problem solving," said Popper. To deal with arbitrary problems in arbitrary environments, an ultimate cognitive agent should use its limited hardware in the "best" and "most efficient" possible way. Can we formally nail down this informal statement, and derive a mathematically rigorous blueprint of ultimate cognition? Yes, we can, using Kurt Gödel's celebrated self-reference trick of 1931 in a new way. Gödel exhibited the limits of mathematics and computation by creating a formula that speaks about itself, claiming to be unprovable by an algorithmic theorem prover: either the formula is true but unprovable, or math itself is flawed in an algorithmic sense. Here we describe an agent-controlling program that speaks about itself, ready to rewrite itself in arbitrary fashion once it has found a proof that the rewrite is useful according to a user-defined utility function. Any such a rewrite is necessarily globally optimal-no local maxima!-since this proof necessarily must have demonstrated the uselessness of continuing the proof search for even better rewrites. Our self-referential program will optimally speed up its proof searcher and other program parts, but only if the speed up's utility is indeed provable-even ultimate cognition has limits of the Gödelian kind. © 2009 Springer Science+Business Media, LLC.
Original languageEnglish (US)
Pages (from-to)177-193
Number of pages17
JournalCognitive Computation
Volume1
Issue number2
DOIs
StatePublished - Dec 1 2009
Externally publishedYes

ASJC Scopus subject areas

  • Cognitive Neuroscience
  • Computer Science Applications
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Ultimate cognition à la gödel'. Together they form a unique fingerprint.

Cite this