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).
RELATED ARTICLESExplain
Artificial Intelligence
Are thinking computers mathematically possible? [7]
No: computers are limited by Gödel's theorems
Improved machines
The Gödelian insight has already been formalised
Gödelization procedure algorithmically specifiable
Proof has been formalised into a program
Gödelian insight is a slippery character
SHUNYATA—implemented model
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