Un-Gödelizable machine wouldn't be a machine
Machines behave in a determinate manner according to definite rules. But any such determinate machine is susceptible to the Gödelization procedure because its behaviour can be formalised. Any machine that can't be Gödelized isn't really a machine.
John Lucas (1961).
Immediately related elementsHow this works
-
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
▲
Highly complex machine may not be Gödelizable »Highly complex machine may not be Gödelizable
■
Un-Gödelizable machine wouldn't be a machine
◄
John Lucas »John Lucas
+Kommentare (0)
+Verweise (0)
+About