Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC

Liste des GroupesRevenir à c theory 
Sujet : Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC
De : news.dead.person.stones (at) *nospam* darjeeling.plus.com (Mike Terry)
Groupes : comp.theory
Date : 23. May 2025, 02:24:59
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <100oipb$3oge1$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
User-Agent : Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Firefox/91.0 SeaMonkey/2.53.18.2
On 22/05/2025 06:41, Richard Heathfield wrote:
On 22/05/2025 06:23, Keith Thompson wrote:
Richard Heathfield <rjh@cpax.org.uk> writes:
On 22/05/2025 00:14, olcott wrote:
On 5/21/2025 6:11 PM, Richard Heathfield wrote:
[...]
Turing proved that what you're asking is impossible.
>
That is not what he proved.
>
Then you'll be able to write a universal termination analyser that can
correctly report for any program and any input whether it halts. Good
luck with that.
>
Not necessarily.
 Of course not. But I'm just reflecting. He seemed to think that my inability to write the kind of program Turing envisaged (an inability that I readily concede) is evidence for his argument. Well, what's sauce for the goose is sauce for the gander.
 
Even if olcott had refuted the proofs of the
insolvability of the Halting Problem -- or even if he had proved
that a universal halt decider is possible
 And we both know what we both think of that idea.
 
-- that doesn't imply
that he or anyone else would be able to write one.
 Indeed.
 
I've never been entirely clear on what olcott is claiming.
 Nor I. Mike Terry seems to have a pretty good handle on it, but no matter how clearly he explains it to me my eyes glaze over and I start to snore.
Hey, it's the way I tell 'em!
Here's what the tabloids might have said about it, if it had made the front pages when the story broke:
   COMPUTER BOFFIN IS TURING IN HIS GRAVE!
   An Internet crank claims to have refuted Linz HP proof by creating a
   Halt Decider that CORRECTLY decides its own "impossible input"!
   The computing world is underwhelmed.
Better?  (Appologies for the headline, it's the best I could come up with.)
Mike.

 
[...] He has rarely, if ever, stated his claims clearly enough
for anyone to be sure what he's claiming.  Of course I could
have missed something, since I've read less than 1% of what he
writes.
 He has been urged to summarise his complete argument on a Web page. Several times, in fact. He generally responds with a nonsensical copy and paste.
 
But if you took everything he's posted here and combined it into
a single text file, I'll bet it would compress *really* well.
 ;-)
 

Date Sujet#  Auteur
29 Jun 26 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal