Re: Can you find anything wrong with this solution to the Halting Problem?

From: >parr\(*> (KurlyGina_at_tenretnitb.moc)
Date: 07/13/04 

Date: Tue, 13 Jul 2004 18:25:41 +0000 (UTC)

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:EQPIc.89409$OB3.36933@bgtnsc05-news.ops.worldnet.att.net...
| > in which case it is no longer the
| > halting problem because that is a
| > statement about tms
| >
| > that is why it is necessary to state
| > the problem precisely
| >
| > > it might not be possible with
| > > TM's. My solution would
| >
| > it is not possible with tms
| > period end of line
| >
| > > work, though. Go back and read it
| > > again.
|
| But then I get a two-for-one special.
| I refute the Halting Proof and the
| Church-Turing thesis with one
| refutation. Here is a big hint for
| you.
| It is not going to be possible to
| correctly refute my points without
| directly addressing my points.
| Anything else is merely empty
| presumption.

My dear fellow, may I be the first to congratulate you on proving
that a Turing Machine is not a Turing Machine.

This therefore shows that you must be a Turing machine. The question
is, will you ever halt? 

--
)>==ss$$%PARR(º>   Parr

Relevant Pages