Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- John Beloff (1994). Minds and Machines: A Radical Dualist Perspective. Journal of Consciousness Studies 1 (1):32-37.
Discussion of John Beloff, Minds and machines: A radical dualist perspective
Nothing in this forum yet.
Similar books and articles
The emergence of electronic computers in the last thirty years has given rise to many interesting questions. Many of these questions are technical, relating to a machine’s ability to perform complex operations in a variety of circumstances. While some of these questions are not without philosophical interest, the one question which above all others has stimulated philosophical interest is explicitly non-technical and it can be expressed crudely as follows: Can a machine be said to think and, if so, in what (...)
I use modal logic and transfinite set-theory to define metaphysical foundations for a general theory of computation. A possible universe is a certain kind of situation; a situation is a set of facts. An algorithm is a certain kind of inductively defined property. A machine is a series of situations that instantiates an algorithm in a certain way. There are finite as well as transfinite algorithms and machines of any degree of complexity (e.g., Turing and super-Turing machines and more). There (...)
No categories
Mechanism is the thesis that men can be considered as machines, that there is no essential difference between minds and machines.John Lucas has argued that it is a consequence of Gödel's theorem that mechanism is false. Men cannot be considered as machines, because the intellectual capacities of men are superior to that of any machine. Lucas claims that we can do something that no machine can do-namely to produce as true the Gödel-formula of any given machine. But no machine can (...)
No categories
Goedel's theorem states that in any consistent system which is strong enough to produce simple arithmetic there are formulae which cannot be proved-in-the-system, but which we can see to be true. Essentially, we consider the formula which says, in effect, "This formula is unprovable-in-the-system". If this formula were provable-in-the-system, we should have a contradiction: for if it were provablein-the-system, then it would not be unprovable-in-the-system, so that "This formula is unprovable-in-the-system" would be false: equally, if it were provable-in-the-system, then it (...)
A "machine" is any causal physical system, hence we are machines, hence machines can be conscious. The question is: which kinds of machines can be conscious? Chances are that robots that can pass the Turing Test -- completely indistinguishable from us in their behavioral capacities -- can be conscious (i.e. feel), but we can never be sure (because of the "other-minds" problem). And we can never know HOW they have minds, because of the "mind/body" problem. We can only know how (...)


