Re: [PO] Can a regular Turing Machine provide Protected Memory?

From: David C. Ullrich (ullrich_at_math.okstate.edu)
Date: 08/30/04 

Date: Mon, 30 Aug 2004 06:03:33 -0500

On Sun, 29 Aug 2004 17:11:04 GMT, "Peter Olcott"
<olcott@worldnet.att.net> wrote:

>"Robert Low" <mtx014@linux.services.coventry.ac.uk> wrote in message news:cgsvv8$35r$2@sunbeam.coventry.ac.uk...
>>
>> Mitch Harris <harrisq@tcs.inf.tu-dresden.de> wrote:
>> >TMs that have only write-only-memory are pretty boring. Why would you
>> >limit yourself to such TMs?
>>
>> Who cares? If something can't be done by any Turing machine at
>> all, it certainly can't be done by one which satisfies
>> some additional constraint.
>
>Yet the possibility exists that the conclusion that it can't
>be done by any Turing Machine at all is incorrect.

no, there is no such possibility. the fact that you're either
to stupid or too obstinate to follow a simple proof doesn't
change that.

>That
>is my whole point. So far in about two months no one
>has fully (and correctly) refuted this position.

just as the fact that you keep saying this doesn't make
it so.

>> --
>> Rob. http://www.mis.coventry.ac.uk/~mtx014/
>

************************

David C. Ullrich

sorry about the inelegant formatting - typing
one-handed for a few weeks...

Relevant Pages