Gödelization procedure algorithmically specifiable
The mathematical Gödelization process can be formalised. It is "meta" in the sense that a formal mathematical processes is being used to reason about a mathematical process.
Bruce McLennan (1990).
CONTEXT(Help)
-
Artificial Intelligence »Artificial Intelligence
▲
Are thinking computers mathematically possible? [7] »Are thinking computers mathematically possible? [7]
▲
No: computers are limited by Gödel's theorems »No: computers are limited by Gödel's theorems
▲
Improved machines »Improved machines
▲
The Gödelian insight has already been formalised »The Gödelian insight has already been formalised
■
Gödelization procedure algorithmically specifiable
●
Proof has been formalised into a program »Proof has been formalised into a program
●
Gödelian insight is a slippery character »Gödelian insight is a slippery character
+Comments (0)
+Citations (0)
+About