Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Goedel's Theorem and Mechanism
View through CrossRef
In “Minds, Machines, and Gödel”, J. R. Lucas claims that Goedel's incompleteness theorem constitutes a proof “that Mechanism is false, that is, that minds cannot be explained as machines”. He claims further that “if the proof of the falsity of mechanism is valid, it is of the greatest consequence for the whole of philosophy”. It seems to me that both of these claims are exaggerated. It is true that no minds can be explained as machines. But it is not true that Goedel's theorem proves this. At most, Goedel's theorem proves that not all minds can be explained as machines. Since this is so, Goedel's theorem cannot be expected to throw much light on why minds are different from machines. Lucas overestimates the importance of Goedel's theorem for the topic of mechanism, I believe, because he presumes falsely that being unable to follow any but mechanical procedures in mathematics makes something a machine.
Title: Goedel's Theorem and Mechanism
Description:
In “Minds, Machines, and Gödel”, J.
R.
Lucas claims that Goedel's incompleteness theorem constitutes a proof “that Mechanism is false, that is, that minds cannot be explained as machines”.
He claims further that “if the proof of the falsity of mechanism is valid, it is of the greatest consequence for the whole of philosophy”.
It seems to me that both of these claims are exaggerated.
It is true that no minds can be explained as machines.
But it is not true that Goedel's theorem proves this.
At most, Goedel's theorem proves that not all minds can be explained as machines.
Since this is so, Goedel's theorem cannot be expected to throw much light on why minds are different from machines.
Lucas overestimates the importance of Goedel's theorem for the topic of mechanism, I believe, because he presumes falsely that being unable to follow any but mechanical procedures in mathematics makes something a machine.
Related Results
An embedding theorem for multidimensional subshifts
An embedding theorem for multidimensional subshifts
AbstractKrieger’s embedding theorem provides necessary and sufficient conditions for an arbitrary subshift to embed in a given topologically mixing
$\mathbb {Z}$
-subshift of fini...
Fermat's Last Theorem: A Proof by Contradiction
Fermat's Last Theorem: A Proof by Contradiction
In this paper I offer an algebraic proof by contradiction of Fermat’s Last Theorem. Using an alternative to the standard binomial expansion, (a+b) n = a n + b Pn i=1 a n−i (a + b) ...
The Gauss–Bonnet theorem
The Gauss–Bonnet theorem
The Gauss–Bonnet theorem is a crowning result of surface theory that gives a fundamental connection between geometry and topology. Roughly speaking, geometry refers to the “local” ...
A Fundamental Study of Composite Numbers as a Different Perspective on Problems Related to Prime Numbers
A Fundamental Study of Composite Numbers as a Different Perspective on Problems Related to Prime Numbers
Prime number-related issues can be viewed from drastically different perspectives by examining the close connections between prime numbers and composite numbers. We think that mult...
Can a computer proof be elegant?
Can a computer proof be elegant?
In computer science, proofs about computer algorithms are par for the course. Proofs
by
computer algorithms, on the other hand, are not so readily accepted....
Microscopic Foundations of Thermodynamics and Generalized Statistical Ensembles
Microscopic Foundations of Thermodynamics and Generalized Statistical Ensembles
This dissertation aims at addressing two important theoretical questions which are still debated in the statistical mechanical community. The first question has to do with the outs...
Peter Chew Theorem and Application
Peter Chew Theorem and Application
Abstract. Presenting numbers in surd^ form is quite common in science and engineering especially where a calculator is either not allowed or unavailable, and the calculations to...
Force of summation
Force of summation
Programming theorems are important tools of programming methodology. By using analogous programming techniques, the solutions of different tasks can be created easily and fast base...