Re: Refutation of the Halting Problem's Proof (Clarifications Wanted)

From: Martin Shobe (mshobe_at_sbcglobal.net)
Date: 08/26/04 

Date: Thu, 26 Aug 2004 11:58:25 GMT

On Thu, 26 Aug 2004 05:15:17 GMT, "Peter Olcott"
<olcott@worldnet.att.net> wrote:

>
><newstome@comcast.net> wrote in message news:7hdXc.47571$9d6.44816@attbi_s54...

>> You've repeatedly talked about using a different model of computation
>> that allows you to solve the halting problem. At the very least you
>> need to very clearly define:
>>
>> 1) Your model of computation (you've had various attempts, such as a
>> write-only output, something that can examine it's own state
>> transition table, etc. but have never been precise)
>
>How much more precise do I need to be?
>If you don't know what a state transition table is, then what I am
>proposing would not be clear. If you do know what a state transition
>table is, then I don't see how I could be more clear. What exactly is
>it about this that you think is not clear enough?

How does it acesses its state transition table?
How does its behavior change based on what is in its transition table?

It would be helpful if you defined the model in its entirety instead
of "Start with a regular TM, give it capability X..."

Martin

Relevant Pages
Loading