Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #39507 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-09-18 22:42 -0500 |
| Last post | 2021-09-20 19:35 -0400 |
| Articles | 2 on this page of 62 — 8 participants |
Back to article view | Back to comp.theory
Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-18 22:42 -0500
Re: Must a partial halt decider be a pure function of its inputs? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-19 02:30 -0700
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-19 06:09 -0500
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 08:15 -0400
Re: Must a partial halt decider be a pure function of its inputs? [ decidability decider ] olcott <NoOne@NoWhere.com> - 2021-09-19 10:03 -0500
Re: Must a partial halt decider be a pure function of its inputs? [ decidability decider ] Richard Damon <Richard@Damon-Family.org> - 2021-09-19 13:47 -0400
Re: Must a partial halt decider be a pure function of its inputs? [ decidability decider ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-19 23:42 +0100
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 06:39 -0400
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-19 06:25 -0500
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 08:12 -0400
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-19 09:48 -0500
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-19 13:58 -0400
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 11:20 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Mr Flibble <flibble@reddwarf.jmc> - 2021-09-19 19:05 +0100
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 13:16 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Mr Flibble <flibble@reddwarf.jmc> - 2021-09-19 19:29 +0100
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 13:40 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Mr Flibble <flibble@reddwarf.jmc> - 2021-09-19 19:44 +0100
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 14:04 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Mr Flibble <flibble@reddwarf.jmc> - 2021-09-19 20:13 +0100
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 14:27 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Mr Flibble <flibble@reddwarf.jmc> - 2021-09-19 20:29 +0100
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 15:08 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Mr Flibble <flibble@reddwarf.jmc> - 2021-09-19 21:32 +0100
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Richard Damon <Richard@Damon-Family.org> - 2021-09-19 19:16 -0400
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Richard Damon <Richard@Damon-Family.org> - 2021-09-19 14:05 -0400
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 13:21 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) Richard Damon <news.x.richarddamon@xoxy.net> - 2021-09-19 14:51 -0400
Re: Must a partial halt decider be a pure function of its inputs? (addendum) olcott <NoOne@NoWhere.com> - 2021-09-19 14:14 -0500
Re: Must a partial halt decider be a pure function of its inputs? (addendum) André G. Isaak <agisaak@gm.invalid> - 2021-09-19 13:41 -0600
Re: Must a partial halt decider be a pure function of its inputs? Charlie-Boo <shymathguy@gmail.com> - 2021-09-20 09:15 -0700
Re: Must a partial halt decider be a pure function of its inputs? Charlie-Boo <shymathguy@gmail.com> - 2021-09-20 09:34 -0700
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 11:46 -0500
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 11:44 -0500
Re: Must a partial halt decider be a pure function of its inputs? André G. Isaak <agisaak@gm.invalid> - 2021-09-20 11:17 -0600
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 12:42 -0500
Re: Must a partial halt decider be a pure function of its inputs? André G. Isaak <agisaak@gm.invalid> - 2021-09-20 11:59 -0600
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 13:59 -0500
Re: Must a partial halt decider be a pure function of its inputs? André G. Isaak <agisaak@gm.invalid> - 2021-09-20 14:01 -0600
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 15:46 -0500
Re: Must a partial halt decider be a pure function of its inputs? André G. Isaak <agisaak@gm.invalid> - 2021-09-20 15:07 -0600
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 16:52 -0500
Re: Must a partial halt decider be a pure function of its inputs? André G. Isaak <agisaak@gm.invalid> - 2021-09-20 16:06 -0600
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 17:29 -0500
Re: Must a partial halt decider be a pure function of its inputs? André G. Isaak <agisaak@gm.invalid> - 2021-09-20 16:52 -0600
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 18:17 -0500
Re: Must a partial halt decider be a pure function of its inputs? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-20 23:06 +0100
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 17:37 -0500
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:31 -0400
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 18:48 -0500
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 22:38 -0400
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 21:45 -0500
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 23:27 -0400
Re: Must a partial halt decider be a pure function of its inputs? Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-09-20 23:14 -0700
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-21 09:39 -0500
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-21 19:16 -0400
Re: Must a partial halt decider be a pure function of its inputs? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 01:45 +0100
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 19:53 -0500
Re: Must a partial halt decider be a pure function of its inputs? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 02:39 +0100
Re: Must a partial halt decider be a pure function of its inputs? olcott <NoOne@NoWhere.com> - 2021-09-20 20:44 -0500
Re: Must a partial halt decider be a pure function of its inputs? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-21 03:33 +0100
Re: Must a partial halt decider be a pure function of its inputs? Richard Damon <Richard@Damon-Family.org> - 2021-09-20 19:35 -0400
Page 4 of 4 — ← Prev page 1 2 3 [4]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-21 03:33 +0100 |
| Message-ID | <87wnna3bfn.fsf@bsb.me.uk> |
| In reply to | #39654 |
olcott <NoOne@NoWhere.com> writes: > On 9/20/2021 8:39 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/20/2021 7:45 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 9/20/2021 5:06 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> When H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ != When Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ we know that >>>>>>> ⟨Ĥ⟩ ⟨Ĥ⟩ is not correctly decidable for either H or Ĥ.qx >>>>>> No. If H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn, then Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ will transition >>>>>> to Ĥ.qn and you will not detect any difference. >>>>> >>>>> The behavior of Ĥ does not depend on the behavior of H. >>>> Peek nonsense. >>> >>>>>> If H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qn, then Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ will transition >>> >>> You have the cause-and-effect backwards. >> >> No. There is no cause and effect, but there is a mutual dependency. H^ >> is derived from H, and given H^ once could derive H. It is not possible >> to have and H/H^ pair that does nor behave as I described. > > No. Ĥ has an unnamed copy of H placed at its Ĥ.qx state. That happens to be (almost) true[1], and it's why I am correct in what I said. But maybe you will deny saying to tomorrow. Is there any point in engaging with anything you say, since everything is up for denial the moment you don't like where things are going? [1] The fact that H^ does not have and exact copy of H in it only affects what I went on to say in the text you've cut. No doubt you will deny ever saying that H^ includes an "exact copy" of H. Or maybe not yet. Maybe you will deny having said it next week? -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-20 19:35 -0400 |
| Message-ID | <JU82J.56919$tG6.8451@fx39.iad> |
| In reply to | #39616 |
On 9/20/21 1:42 PM, olcott wrote:
> On 9/20/2021 12:17 PM, André G. Isaak wrote:
>> On 2021-09-20 10:44, olcott wrote:
>>> On 9/20/2021 11:15 AM, Charlie-Boo wrote:
>>>> On Saturday, September 18, 2021 at 11:42:41 PM UTC-4, olcott wrote:
>>>>> This is my paraphrase of the requirement a partial
>>>>> halt decider must be a pure function of its inputs:
>>>>>
>>>>> As long as there is one set of inputs such as such as the formal
>>>>> parameters to a function and a single output such as return value of
>>>>> {1,0} (indicating true or false) from this function, then whatever
>>>>> occurs in-between does not make any difference.
>>>>>
>>>>> This would mean that my use of static local variables has no
>>>>> detrimental
>>>>> effect on the applicability of my partial halt decider to the halting
>>>>> problem.
>>>>>
>>>>> u32 H(u32 P, u32 I)
>>>>> {
>>>>> static u32 Aborted;
>>>>> static u32* execution_trace;
>>>>>
>>>>>
>>>>>
>>>>> --
>>>>> Copyright 2021 Pete Olcott
>>>>>
>>>>> "Great spirits have always encountered violent opposition from
>>>>> mediocre
>>>>> minds." Einstein
>>>
>>>> There is no significance to solving "some instances" of a problem.
>>>> That includes no instances or trivial instances (here it would be
>>>> YES answers) which have no significance.
>>>> It's basically impossible to carve out any non-trivial subsets of
>>>> programs whose halting problem can be solved.
>>>> The easiest way to advance unsolvable problems (nonrecursive sets)
>>>> has always been to find unsolved problems - proving sets are not
>>>> recursive, typically r.e. sets.
>>>> C-B
>>>>
>>>
>>> void P(u32 x)
>>> {
>>> if (H(x, x))
>>> HERE: goto HERE;
>>> }
>>>
>>> int main()
>>> {
>>> Output("Input_Halts = ", H1((u32)P, (u32)P));
>>> }
>>>
>>> H and H1 are simulating partial halt deciders that make their halt
>>> status decision on the basis of whether or not the execution trace of
>>> the simulation of their input matches one of two known infinite
>>> execution patterns.
>>>
>>> The above conventional undecidable TM/input pair is correctly decided
>>> as halting on the basis of fully operational C/x86 code in the x86utm
>>> operating system.
>>
>> Your P is derived from H (somewhat) in accordance with the rules that
>> Linz uses to derive H_Hat from H.
>>
>> Your P is *not* derived from H1 in this way.
>>
>> If your H1 can correctly decide (P, P) that has no bearing on Linz.
>
> It may seem that way to a reviewer that says blah, blah, blah, I know
> that you must be wrong because I really, really believe that you must be
> wrong so there is no sense in paying any attention to what you say.
>
> On the other hand Olcott H1/H/P is analogous to Linz H/Ĥ/⟨Ĥ⟩ in that it
> shows that simulating halt decider Linz H correctly decides the halt
> status of the Linz input ⟨Ĥ⟩ ⟨Ĥ⟩.
>
No they aren't and it shows your ignorance.
Using the notation of the accronym of Peter Olcott's Other Problem to
clairify what is being talked about.
The mere thought that POOP-H and Linz-H^ are 'equivalent' shows a fatal
misunderstanding.
POOP-H is a decider, with supposedly the exact same code as POOP-H1.
POOP-H takes as an input the description of a Machine and its input, and
is supposed to always halt at state qn or qy.
Linz-H^ is a machine based on a small modification of Linz-H.
Linz-H^ takes as in input the description of a Machine, and will either
Loop or Halt.
Linz-H^ and POOP-H are different kinds of computation and take different
inputs.
If POOP-P is just a representation, then we have no machine to decide.
POOP-P is NOT the representation of POOP-H as it takes different sorts
of inputs.
I think you have just proven that your whole arguement is realy just a
pile of POOP.
>> Linz never claimed that you cannot construct a TM which correctly
>> decides H_Hat, H_Hat. He claims only that H cannot do so.
>>
>
> The whole point of the halting theorem is to prove that no universal
> halt decider can possibly exist.
>
> I have shown how to create a decidability decider that correctly decides
> that Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ is not correctly decidable by Ĥ.qx, thus allowing H to
> be automatically selected as the correct halting decider for ⟨Ĥ⟩ ⟨Ĥ⟩,
> thus the combination of the decidability decider and three instances of
> the same algorithm derives a universal halt decider.
Noi, you haven't. You haven't answered about the flaw I have pointed out
in your PSR 'decider'. It gives wrong answers too.
>
> When H applied to ⟨Ĥ⟩ ⟨Ĥ⟩ != When Ĥ.qx applied to ⟨Ĥ⟩ ⟨Ĥ⟩ we know that
> ⟨Ĥ⟩ ⟨Ĥ⟩ is not correctly decidable for either H or Ĥ.qx, one more
> instance of this same algorithm excludes the odd-man-out and thus
> selects the correct halt decider.
The fact that H doesn't correctly decide H^(H^) is the point.
If other 'copies' of H give different answers it says that H is not a
Computation, and has an input that affects its behavior other than its
defined inputs.
H is thus disqualified from being a Decider in the first place.
>
>> Your H can *not* correctly decide (P, P) and that's the case that
>> actually matters.
>>
>>> H1 is an exact copy of H and is able to correctly decide that its
>>> input halts because P was not designed to contradict H1. Because P
>>> was intentionally designed to contradict H the return value from H
>>> and H1 are not the same.
>>>
>>> The key question of this post is whether H/H1 would be disallowed as
>>> Turing computable on the basis that H must use static local variables
>>> to keep track of the execution trace of its input across subsequent
>>> recursive simulations.
>>
>> If it must keep track of *any* data across different calls then it is
>> not a computation. So yes, it is disqualified.
>>
>> André
>>
>
>
[toc] | [prev] | [standalone]
Page 4 of 4 — ← Prev page 1 2 3 [4]
Back to top | Article view | comp.theory
csiph-web