Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!shelby!unix!garth!smryan
From: smryan@garth.UUCP (Steven Ryan)
Newsgroups: comp.lang.misc
Subject: Re: Turing equivalence (was first-class composable functions)
Message-ID: <23@garth.UUCP>
Date: 13 Feb 91 21:07:11 GMT
References: <1991Feb7.150537.9257@spool.cs.wisc.edu> <1991Feb11.164821.10486@spool.cs.wisc.edu> <320@smds.UUCP>
Reply-To: smryan@garth.UUCP (Steven Ryan)
Organization: INTERGRAPH (APD) -- Palo Alto, CA
Lines: 16

>on which the program is run"; it is a common characteristic of all 
>computers in the real universe that has been, that is, or that ever
>will be.  Real computers can only run a finite number of Turing programs,
>a Turing machine can run an infinite number.

Wrong.

I put a mirror on the back of spaceship and send off into the cosmos, bouncing
a laser from my computer to ship and back again. The laser pulses to encode
information.

Can you deductively prove that this is not an arbitrary large but finite
storage device?
-- 
...!uunet!ingr!apd!smryan                                       Steven Ryan
...!{apple|pyramid}!garth!smryan              2400 Geng Road, Palo Alto, CA