Re: Yet another Attempt at Disproving the Halting Problem

From: >parr\(*> (gniKyruaL_at_tenretnitb.moc)
Date: 08/10/04 

Date: Tue, 10 Aug 2004 05:42:53 +0000 (UTC)

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:qkWRc.419238$Gx4.155221@bgtnsc04-news.ops.worldnet.att.net...
|
| No, sorry. Mathematical induction (often used for proof of
| algorithm correctness) has nothing at all in common with
| inductive inference.

No need to apologise. I see you're happy with that form of proof
(conclusion from stepping) as opposed to the other non-proof (jumping
to conclusions).

Anyway, that's not what this topic is all about.

It's more about your role as a latter-day Hilbert, believing that
finite algorithms may one day be found for all mathematical (and that
includes algorithmic) problems.

More precisely, it is more about your claim to have solved one
variety of Hilbert's 1928 Decision Problem.

Please get on topic.

Please, at the very least, make a start and go discover the title of
the Turing paper which you claim is in error. 

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

Relevant Pages
Quantcast