Minds and Machines 18 (1):1-15 (2008)
It is well understood and appreciated that Gödel’s Incompleteness Theorems apply to sufficiently strong, formal deductive systems. In particular, the theorems apply to systems which are adequate for conventional number theory. Less well known is that there exist algorithms which can be applied to such a system to generate a gödel-sentence for that system. Although the generation of a sentence is not equivalent to proving its truth, the present paper argues that the existence of these algorithms, when conjoined with Gödel’s results and accepted theorems of recursion theory, does provide the basis for an apparent paradox. The difficulty arises when such an algorithm is embedded within a computer program of sufficient arithmetic power. The required computer program (an AI system) is described herein, and the paradox is derived. A solution to the paradox is proposed, which, it is argued, illuminates the truth status of axioms in formal models of programs and Turing machines.
|Keywords||Gödel’s incompleteness Turing computability Penrose Axioms Consistency|
|Categories||categorize this paper)|
References found in this work BETA
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 2007 - Cambridge University Press.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Citations of this work BETA
No citations found.
Similar books and articles
.[author unknown] - unknown
Mathematical Realism and Gödel's Incompleteness Theorems.Richard Tieszen - 1994 - Philosophia Mathematica 2 (3):177-201.
There's Something About Gödel: The Complete Guide to the Incompleteness Theorem.Francesco Berto - 2009 - Wiley-Blackwell.
Gödel's Incompleteness Theorems and Computer Science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
The Gödel Paradox and Wittgenstein's Reasons.Francesco Berto - 2009 - Philosophia Mathematica 17 (2):208-219.
From Closed to Open Systems.Carlo Cellucci - 1993 - In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
On the Philosophical Relevance of Gödel's Incompleteness Theorems.Panu Raatikainen - 2005 - Revue Internationale de Philosophie 59 (4):513-534.
Added to index2009-01-28
Total downloads80 ( #63,541 of 2,153,478 )
Recent downloads (6 months)8 ( #90,446 of 2,153,478 )
How can I increase my downloads?