From: Mu In Taiwan (mu.in.taiwan@gmail.com)
Date: Mon Oct 12 2009 - 21:25:42 MDT
Turing machines are more powerful than real computers because they have
infinite memory, so any limitations of Turing machines is even more true
of real computers.-----
John,
Please present an algorithm, or state-transition function for a turing
machine, implementing:
a. A real time clock.
b. A true random number generator.
Good luck with these. You'll need it.
Of course, my Mac has these features as an integral part of the machine.
Indeed, I wouldn't like to try to run a modern OS without them...
Also, I note that you have again ignored a call for definitions of your
vocabulary, and mathematics to support your wild claims. I'm increasingly
beginning to think that you aren't capable of providing either of them.
Mu
On Tue, Oct 13, 2009 at 4:14 AM, John K Clark <johnkclark@fastmail.fm>wrote:
> On Mon, 12 Oct 2009 "J. Andrew Rogers" <andrew@ceruleansystems.com>
> said:
>
> > 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 have
> infinite memory, so any limitations of Turing machines is even more true
> of real computers.
>
> > Am I missing something major
>
> Yes.
>
> John K Clark
>
> --
> John K Clark
> johnkclark@fastmail.fm
>
> --
> http://www.fastmail.fm - Accessible with your email software
> or over the web
>
>
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:04 MDT