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).
RELATED ARTICLESExplain
Artificial Intelligence
Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems
Improved machines
Highly complex machine may not be Gödelizable
Un-Gödelizable machine wouldn't be a machine
John Lucas
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