🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.ai
Article #8973

Re: Another letter to the New York Review

#8973
From: Radford Neal
Date: Sat, 03 Mar 1990 20:28
40 lines
2885 bytes
In article <b3Yc02Cj8dl401@amdahl.uts.amdahl.com> kp@amdahl.uts.amdahl.com (Ken Presting) writes:

>...  I had focused on Penrose' arguments, which depend on
>the possible existence of uncomputable functions in the laws of physics.
>But I propose a simulation technique which depends on deduction rather
>than numerical solution of differential equations. The standard
>logical operation which represents the determinist metaphysical thesis

>is *deduction*, not computation.  Of course, computers are entirely
                                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
>adequate to implement deductive systems, by the Church-Turing thesis.
 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

>If there is any way at all to predict a future state from a past state,
>computers can do it as well as any mere physicist.

I think you're suffering from a lack of imagination here. Penrose is
of course denying that computers are adequate to implement any
deductive system, if by "deductive system" you mean the process by
which real mathematicians establish new truths. If you're to understand
his argument, you have to try to imagine how this might be true.

Let's say that one day Penrose announces that he is able to solve, say,
the word problem for semi-groups - a well-known non-computable problem.
People give him instances of this problem. After a period of time
that goes up only reasonably with the size of the instance he announces
the answer: YES or NO. In those cases where the true answer is 
subsequently determined, he always turns out to be right. This holds
even for very difficult cases that require increasingly subtle 
arguments to establish that the answer is NO, as well as cases where
extremely complex reductions are needed to demonstrate that the answer
is YES.

I think it would be quite reasonable to conclude in the above situation
that Penrose can somehow perform non-computable operations, and hence
that the laws of physics must also be non-computable. You could construct
a similar scenario in which the word problem is solved by some physical
computer (obviously not Turing equivalent), rather than by a human being.

    Radford Neal
Technical Details
Message-ID: <90Mar3.152728est.6160@neat.cs.toronto.edu>
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.cs.toronto.edu!radford
References: <18883@bcsaic.UUCP> <1589@skye.ed.ac.uk> <11488@venera.UUCP> <1754@skye.ed.ac.uk> <e1oq020b88jL01@amdahl.uts.amdahl.com> <90Feb15.231415est.6212@neat.cs.toronto.edu> <2al902Zg8bnn01@amdahl.uts.amdahl.com> <3750@uceng.UC.EDU> <b3Yc02Cj8dl401@amdahl.uts.amdahl.com>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.cs.toronto.edu!radford
Newsgroups: comp.ai,sci.philosophy.tech
From: radford@ai.toronto.edu (Radford Neal)
Subject: Re: Another letter to the New York Review
Message-ID: <90Mar3.152728est.6160@neat.cs.toronto.edu>
Keywords: Penrose, Moravec
Organization: Department of Computer Science, University of Toronto
References: <18883@bcsaic.UUCP> <1589@skye.ed.ac.uk> <11488@venera.UUCP> <1754@skye.ed.ac.uk> <e1oq020b88jL01@amdahl.uts.amdahl.com> <90Feb15.231415est.6212@neat.cs.toronto.edu> <2al902Zg8bnn01@amdahl.uts.amdahl.com> <3750@uceng.UC.EDU> <b3Yc02Cj8dl401@amdahl.uts.amdahl.com>
Date: 3 Mar 90 20:28:26 GMT
Lines: 41