From: J. Andrew Rogers (firstname.lastname@example.org)
Date: Tue Oct 13 2009 - 01:59:48 MDT
On Oct 12, 2009, at 8:14 PM, John K Clark wrote:
> On Mon, 12 Oct 2009 "J. Andrew Rogers" <email@example.com>
>> An argument from Turing machines is silly, since your argument is
>> predicated on features that only exist for true Turing machines.
> Turing machines are more powerful than real computers because they
> infinite memory, so any limitations of Turing machines is even more
> of real computers.
The undecidability of the Halting Problem is predicated on infinite
Regardless, if I build a finite deterministic computational model that
provably halts, it really doesn't matter what kind of program I run on
it. The computer will still be "general" in the sense that any finite
deterministic computer is (i.e. not really).
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:04 MDT