METACAT

The COPYCAT program—see Map 1—could in principle be developed into a new program called METACAT. Metacat would have the reflexive ability to recognise the truth of its own Gödel sentence and could thereby evade the Lucas argument.

METACAT would be able to:

  • represent issues and pressures involved in a problem;
  • understand how someone else thought up an analogy that didn't occur to it;
  • store episodic memory of past problems it has solved;
  • recognise meta-analogies—ie analogies between different analogies;
  • and construct puzzles based on a sense of aesthetics.
Douglas Hofstadter (1995).
RELATED ARTICLESExplain
Artificial Intelligence
Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems
Improved machines
Self-referential machines
METACAT
Douglas Hofstadter
Gödelizing operator can defeat Lucas's argument
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip