Liste des Groupes | Revenir à s logic |
On 3/11/2024 1:02 AM, Richard Damon wrote:Really?On 3/10/24 10:44 PM, olcott wrote:Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.Hq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.Hqy ∞ // Ĥ applied to ⟨Ĥ⟩ halts
>*Every implementation of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ gets the wrong answer*>
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.Hq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.Hqy ∞ // Ĥ applied to ⟨Ĥ⟩ halts
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.Hq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.Hqn // Ĥ applied to ⟨Ĥ⟩ does not halt
>
Yes, you have rotely repeated that many times, not knowing what that implies, or doesn't imply.
>
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.Hq0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.Hqn // Ĥ applied to ⟨Ĥ⟩ does not halt
*Every implementation of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ gets the wrong answer*
*Every implementation of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ gets the wrong answer*
*Every implementation of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ gets the wrong answer*
And every specific problem given to any of the deciders has an answer, so the question is valid.It is also true that every instance of that question has a right answer, it just isn't the one that H gives.Every decision problem that includes undecidable instances only has
>
these instances because there is something wrong with the decision
problem specification.
The proof of the halting problem assumes a universal haltWhich just provew your "Unique contribution" is that you don't understand what yo are talking about and are just spreading falsehoods.
test exists and then provides S as an example of a program
that the test cannot handle. But S is not a program at all.
It is not even a conceptual object, and this is due to
inconsistencies in the specification of the halting function.
(Stoddart: 2017)
*This is my unique contribution to the field of the Halting Problem*
*This is my unique contribution to the field of the Halting Problem*
*This is my unique contribution to the field of the Halting Problem*
When we ask H ⟨Ĥ⟩ ⟨Ĥ⟩:But ONLY that particular H. That input isn't "Undecidable" as there are many deciders that gets it right.
Does your input halt on its input?
meaning: Would Ĥ ⟨Ĥ⟩ halt on its input, then H gets the wrong answer.
When we ask the exact same question meaning:Nope, because a machine that does abort can't not abort and be the smae machine.
Will you halt if you never abort your simulation?
Then every H always gets the right answer.
Thus, the question is VALID but UNCOMPUTABLE.
>
You are just proving your utter ignorance and inability to learn.
Les messages affichés proviennent d'usenet.