Analog vs Digital (was Re: Is Scheme/Lisp somehow more "fundamental" than other languages?)

[Darren New]

Darren New wrote:
> The halting problem only is true for unbounded computers.

Or, to put it another way, the *proof* that the halting problem is 
uncomputable relies on the program running on an unbounded-storage 
machine. If you're going to argue that the halting problem is unsolvable 
for a Z80-based program, you can't argue that the program that solves 
the Z80-halting-problem on a TM wouldn't run on a real computer and 
therefore the Z80-halting problem is unsolvable. There may very well be 
a different, clever mechanism to solve the halting problem for all Z80 
computer programs, since there's already a non-clever mechanism for 
solving it.

I.e., it's entirely possible the human brain could solve the halting 
problem for all finite-storage programs. I haven't seen any proof that 
(for example) you *need* more storage to solve the 
finite-halting-problem than the finite-halting-program has available.

-- 
   Darren New / San Diego, CA, USA (PST)
     It's not feature creep if you put it
     at the end and adjust the release date.