Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Newsgroups | comp.theory |
| Subject | Re: Refuting the halting problem proofs (solving the halting problem) |
| Date | 2021-05-16 15:55 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <20210516083841.659@kylheku.com> (permalink) |
| References | (2 earlier) <wd-dnW08RPQsyj39nZ2dnUU7-KednZ2d@giganews.com> <EOYnI.579933$BHVc.546077@fx32.ams4> <l4KdnbyNwt3itzz9nZ2dnUU7-XXNnZ2d@giganews.com> <rGaoI.510543$BpBb.277382@fx44.ams4> <RtmdnfgmL8hTqjz9nZ2dnUU7-YudnZ2d@giganews.com> |
On 2021-05-16, olcott <NoOne@NoWhere.com> wrote:
> On 5/16/2021 10:15 AM, Mr Flibble wrote:
>> On Sun, 16 May 2021 09:22:47 -0500, olcott wrote:
>>
>>> On 5/15/2021 6:28 PM, Mr Flibble wrote:
>>>> On Sat, 15 May 2021 18:23:21 -0500, olcott wrote:
>>>>
>>>>> On 5/15/2021 4:55 PM, Mr Flibble wrote:
>>>>>> On Sat, 15 May 2021 14:52:32 -0500, olcott wrote:
>>>>>>
>>>>>>> To overcome the pathological self-reference error of the
>>>>>>> conventional halting problem proofs we simply define halt decider H
>>>>>>> such that every input P to halt decider H that itself calls H has
>>>>>>> the same halting value as the halting value as input P2 adapted from
>>>>>>> input P where all calls to H have been replaced with calls to
>>>>>>> Simulate.
>>>>>>>
>>>>>>> We can see that on the basis of this corrected criteria the actual
>>>>>>> Linz H would correctly decide not halting on the actual Linz Ĥ shown
>>>>>>> on page 319.
>>>>>>> http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
>>>>>>>
>>>>>>>
>>>>>>>
>>>>>>> Does the simulation of input P by simulating (at least partial) halt
>>>>>>> decider H have to be stopped to prevent the infinite execution of P?
>>>>>>>
>>>>>>> void H_Hat(u32 P)
>>>>>>> {
>>>>>>> u32 Input_Halts = Halts(P, P);
>>>>>>> if (Input_Halts)
>>>>>>> HERE: goto HERE;
>>>>>>> }
>>>>>>>
>>>>>>> THIS IS A TRUISM:
>>>>>>> If the simulation never needs to be stopped then we can swap
>>>>>>> Simulate(P,P) for Halts(P,P) and it will stop otherwise we know that
>>>>>>> the simulation must have needed to have been stopped at some point.
>>>>>>>
>>>>>>> http://www.liarparadox.org/
>>>>>> Halting_problem_undecidability_and_infinitely_nested_simulation.pdf
>>>>>>
>>>>>> You have not refuted Turing until your halt decider can cope with
>>>>>> branching logic predicated on program state predicated on arbitrary
>>>>>> program input.
>>>>>>
>>>>>> /Flibble
>>>>>>
>>>>>>
>>>>> Your error is the same as this:
>>>>> No one has cured any disease until they have cured every disease.
>>>>
>>>> Nope. I said the other month that I don't care about any schoolboy
>>>> proofs that might be wrong; as far as the Halting Problem is concerned
>>>> I only care about Turing's proof which you have failed to refute and
>>>> will continue to fail to refute until you address the issues I
>>>> describe. Your halting decider can only decide on a useless finite
>>>> subset of problems that nobody cares about.
>>>>
>>>> /Flibble
>>>>
>>>>
>>> With a complete set of non-halting behavior patterns this algorithm
>>> solves the halting problem:
>>>
>>> THIS IS A TRUISM:
>>> When the behavior of the input Ĥ to simulating halt decider H (a)
>>> correctly matches (b) a correct non-halting behavior pattern then H
>>> decides non-halting on Ĥ correctly.
>>>
>>> I only provide one [infinitely_nested_simulation] behavior pattern that
>>> correctly decides the simplest one of the conventional halting problem
>>> instances. When this pattern is elaborated it decides all of the
>>> conventional halting problem instances.
>>
>> No, it doesn't, your extrapolation is false: but feel free to prove
>> otherwise without repeating the same old bullshit that doesn't address the
>> issues I describe. Until you refute Turing you haven't refuted anything
>> of substance.
>>
>> /Flibble
>>
>
> Truisms cannot be false.
Truisms can be irrelevant.
A truism can be the premise in an invalid argument.
The argument "If P, then Q" is invalid whenever P is true and Q is
false.
If P is readily recognized as a truism, that only makes it easier
to recognize that the argument is invalid, since then only the
falsehood of Q needs to be considered.
> >> THIS IS A TRUISM:
> >> When the behavior of the input Ĥ to simulating halt decider H (a)
> >> correctly matches (b) a correct non-halting behavior pattern then H
> >> decides non-halting on Ĥ correctly.
Your truism is true regardless of how you define "correctly" mand
"correct non-halting pattern".
Your truism holds, for instance, if we define correctly as "the number
42 occurs the execution of the simulated function".
If Halts sees that the function has calculated 42, and aborts it, it has
correctly matched the non-halting behavior pattern. Because that is what
we have *defined* as correct, it has decided non-halting correctly, by
our definition.
The problem with your truism is that the real halting problem does not
have a correct, universal pattern for deciding actual halting.
There is no such thing, period.
Therefore, if your truism is supposed to be able the real halting
problem, it contains a vacuous truth, because it really says this:
When the behavior of the input Ĥ to simulating halt decider H (a)
correctly matches (b) a correct non-halting behavior pattern,
CHOSEN FROM AN EMPTY SET OF SUCH CORRECT PATTERNS SINCE THEY PROVABLY
DON'T EXIST, then H decides non-halting on Ĥ correctly.
We then observe that your truism has the pattern "When {condition}, then
{result}", but {condition} never arrives.
Here is a similar truism:
When Olcott publishes a solution to the halting problem, he will be a
famous name CS/math circles.
Irrefutably true, except for the tiny detail that it will never happen.
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 14:52 -0500
Re: Refuting the halting problem proofs Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-15 20:47 +0000
Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-15 21:48 +0100
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 21:33 -0500
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-16 09:08 -0500
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:08 -0400
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 07:58 -0400
Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-16 17:42 +0100
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-16 12:26 -0500
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:46 -0400
Re: Refuting the halting problem proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-05-18 01:58 +0100
Re: Refuting the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-05-15 21:55 +0000
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 18:23 -0500
Re: Refuting the halting problem proofs Mr Flibble <flibble@reddwarf.jmc> - 2021-05-15 23:28 +0000
Re: Refuting the halting problem proofs (solving the halting problem) olcott <NoOne@NoWhere.com> - 2021-05-16 09:22 -0500
Re: Refuting the halting problem proofs (solving the halting problem) Mr Flibble <flibble@reddwarf.jmc> - 2021-05-16 15:15 +0000
Re: Refuting the halting problem proofs (solving the halting problem) olcott <NoOne@NoWhere.com> - 2021-05-16 10:19 -0500
Re: Refuting the halting problem proofs (solving the halting problem) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:55 +0000
Re: Refuting the halting problem proofs (solving the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:11 -0400
Re: Refuting the halting problem proofs Richard Damon <Richard@Damon-Family.org> - 2021-05-15 19:37 -0400
Re: Refuting the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 05:57 +0200
Re: Refuting the halting problem proofs olcott <NoOne@NoWhere.com> - 2021-05-15 23:29 -0500
Re: Refuting the halting problem proofs Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 10:11 +0200
Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 08:43 -0500
Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:16 +0000
Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 10:25 -0500
Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:57 +0000
Re: Refuting the halting problem proofs (in C) Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 18:28 +0200
Re: Refuting the halting problem proofs (in C) olcott <NoOne@NoWhere.com> - 2021-05-16 10:53 -0500
Re: Refuting the halting problem proofs (in C) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 15:58 +0000
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 11:23 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 17:26 +0000
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 13:33 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-16 18:54 +0000
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 14:19 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:09 -0400
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 15:17 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:42 -0400
Re: Refuting the halting problem proofs [ succinct refutation ] olcott <NoOne@NoWhere.com> - 2021-05-16 16:20 -0500
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 17:30 -0400
Re: Refuting the halting problem proofs [ succinct refutation ] Richard Damon <Richard@Damon-Family.org> - 2021-05-16 16:07 -0400
Re: Refuting the halting problem proofs (in C) Richard Damon <Richard@Damon-Family.org> - 2021-05-16 13:17 -0400
Re: Refuting the halting problem proofs (in C) Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-16 18:02 +0200
csiph-web