Liste des Groupes | Revenir à c theory |
On 5/24/2025 3:01 AM, Mikko wrote:I do understand the meanings of both main clauses. I also understand thatOn 2025-05-23 16:19:12 +0000, olcott said:If you are too stupid to understand its meaning
On 5/23/2025 2:17 AM, Mikko wrote:Yet another attempt of a straw man deception. I didn't say anythingOn 2025-05-23 05:25:30 +0000, olcott said:Is is not supposed to be an English sentence nitwit.
On 5/22/2025 8:24 PM, Mike Terry wrote:That is not a valid sentence: there is an subordinate clause and twoOn 22/05/2025 06:41, Richard Heathfield wrote:When Ĥ is applied to ⟨Ĥ⟩On 22/05/2025 06:23, Keith Thompson wrote:Hey, it's the way I tell 'em!Richard Heathfield <rjh@cpax.org.uk> writes: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.On 22/05/2025 00:14, olcott wrote:[...]On 5/21/2025 6:11 PM, Richard Heathfield wrote:Not necessarily.Then you'll be able to write a universal termination analyser that canTuring proved that what you're asking is impossible.That is not what he proved.
correctly report for any program and any input whether it halts. Good
luck with that.
Even if olcott had refuted the proofs of theAnd we both know what we both think of that idea.
insolvability of the Halting Problem -- or even if he had proved
that a universal halt decider is possible
-- that doesn't implyIndeed.
that he or anyone else would be able to write one.
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.
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.
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
main clauses but nothing that combines the main clauses to an overall
meaning.
about English. I only said that it is not a sentence.
It is a simplification of the Linz definition of Ĥ.A simplification that omits all meaning is not a useful simplification.
It does not define, it does not describe, it does not require, it does
not say anything at all.
that is not my fault.
I even specified its step by step meaning and you erased that partYou presented this set:
to make it easier to lie.
(a) Ĥ copies its input ⟨Ĥ⟩Although you didn't specify that this shall be interpreted as a sequence
(b) Ĥ invokes embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩
(c) embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩
(d) simulated ⟨Ĥ⟩ copies its input ⟨Ĥ⟩
(e) simulated ⟨Ĥ⟩ invokes simulated embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩
(f) simulated embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩
(g) goto (d) with one more level of simulation
When Ĥ is applied to ⟨Ĥ⟩does not mention any simulations, let alone levels of simulation.
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
Les messages affichés proviennent d'usenet.