Path: utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!cs.utexas.edu!samsung!usc!apple!amdahl!kp
From: kp@uts.amdahl.com (Ken Presting)
Newsgroups: comp.ai
Subject: Re: Another letter to the New York Review
Summary: How do real numbers solve the Halting problem?
Message-ID: <eae202398cCv01@amdahl.uts.amdahl.com>
Date: 1 Mar 90 01:58:13 GMT
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> <TED.90Feb26144832@kythera.nms
Reply-To: kp@amdahl.uts.amdahl.com (Ken Presting)
Organization: Amdahl Corporation, Sunnyvale CA
Lines: 10

In article <TED.90Feb28090039@kythera.nmsu.edu> ted@nmsu.edu (Ted Dunning) writes:
>for that matter, if we posit a RAM machine which can manipulate real
>numbers it _can_ solve the halting problem.

By starting with a real number in storage whose (binary) expansion below
the radix point is 1 for Goedel numbers of machine plus input state that
halt, 0 if not?

Is there a way to do this that does not depend on an infinite table-
lookup?