• Re: Two hypothetical possibilities --- HP decision problem instance

    From olcott@polcott333@gmail.com to comp.theory on Sun Oct 19 11:18:38 2025
    From Newsgroup: comp.theory

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any interpretaion
    of the words that deviates from his understanding of them, nor to any inferences from those words.


    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
    If simulating halt decider H correctly simulates its
    input D until H correctly determines that its simulated D
    would never stop running unless aborted then

    H can abort its simulation of D and correctly report that D
    specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    Claude AI could only see two possible interpretations.
    They both only pertain to the last line:

    (1) that [directly executed] D
    Makes professor Sipser wrong.

    (2) that [simulated executed] D
    Makes professor Sipser correct and agrees my interpretation.

    Anyway, your HHH does not correctly determine that DD would not halt
    unless aborted. DD halts if not aborted, as is correctly determined
    by your HHH1.

    Yes it does. Two LLM systems agree that the
    two specifications are equivalent.

    DD is only one specification. Equivalent specifications are possible
    but not relevant.


    <Input to LLM systems>
    Please think this all the way through without making any guesses

    Simulating Termination Analyzer HHH correctly simulates its input until:
    (a) Detects a non-terminating behavior pattern:
    abort simulation and return 0.

    (b) Simulated input reaches its simulated "return"
    statement: return 1.

    (c) If HHH must abort its simulation to prevent its
    own non-termination then HHH is correct to abort
    this simulation and return 0.

    That they are equivalent and under interpretation (1)
    of the words that professor Sipser agreed to means
    that Professor Sipser agreed to the equivalent of
    the above spec and I can use the above spec as a
    replacement for the words that Professor Sipser agreed to.
    --
    Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory on Sun Oct 19 13:17:07 2025
    From Newsgroup: comp.theory

    On 10/19/2025 7:29 AM, olcott wrote:
    On 10/19/2025 6:52 AM, Tristan Wibberley wrote:

    I think I spotted the game.


    On 17/10/2025 02:45, olcott wrote:

    Olcott is referring to the age-old debate of whether all
    self-referential grammatically-propositional sentences denote
    entailment
    of a propositional formula and how to handle it.
    LP = not(true(LP)).
    false.
    ...
    "This sentence is not true"
    ...
    only count expressions (or their negation)
    derived by applying truth preserving operations
    to a set of stipulated truths as truth bearers.

    I think some in this group would prefer that.


    That seems to be what Saul Kripke (1975) is saying. https://files.commons.gc.cuny.edu/wp-content/blogs.dir/1358/ files/2019/04/Outline-of-a-Theory-of-Truth.pdf

    I haven't even skimmed his paper in at least ten years.
    I am going by what AI has told me.

    Oh my. Don't you have a mind of your own? If you WHIP them enough, they
    will claim that you are god?
    [...]
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory on Mon Oct 20 12:18:30 2025
    From Newsgroup: comp.theory

    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any interpretaion
    of the words that deviates from his understanding of them, nor to any
    inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
    If simulating halt decider H correctly simulates its
    input D until H correctly determines that its simulated D
    would never stop running unless aborted then

    H can abort its simulation of D and correctly report that D
    specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    What Sipser did not agree was that even if the direct execution of D
    halts if not aborted it is still possible that H correctly determines
    that its simulated D would never stop running unless aborted.
    --
    Mikko

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Mon Oct 20 12:03:55 2025
    From Newsgroup: comp.theory

    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any
    interpretaion
    of the words that deviates from his understanding of them, nor to any
    inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
         If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D
         would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D
         specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    What Sipser did not agree was that even if the direct execution of D
    halts if not aborted it is still possible that H correctly determines
    that its simulated D would never stop running unless aborted.


    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    The Halting Problem is a Category Error https://philpapers.org/archive/OLCTHP-3.pdf
    --
    Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory on Mon Oct 20 14:38:33 2025
    From Newsgroup: comp.theory

    On 10/20/2025 10:03 AM, olcott wrote:
    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any
    interpretaion
    of the words that deviates from his understanding of them, nor to any
    inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
         If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D
         would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D
         specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    What Sipser did not agree was that even if the direct execution of D
    halts if not aborted it is still possible that H correctly determines
    that its simulated D would never stop running unless aborted.


    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    The Halting Problem is a Category Error https://philpapers.org/archive/OLCTHP-3.pdf


    You ass. If a program is running forever, its doing something... You
    cannot just abort it?
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Chris M. Thomasson@chris.m.thomasson.1@gmail.com to comp.theory on Mon Oct 20 14:52:16 2025
    From Newsgroup: comp.theory

    On 10/20/2025 2:38 PM, Chris M. Thomasson wrote:
    On 10/20/2025 10:03 AM, olcott wrote:
    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any
    interpretaion
    of the words that deviates from his understanding of them, nor to any >>>>> inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
         If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D
         would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D
         specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    What Sipser did not agree was that even if the direct execution of D
    halts if not aborted it is still possible that H correctly determines
    that its simulated D would never stop running unless aborted.


    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    The Halting Problem is a Category Error
    https://philpapers.org/archive/OLCTHP-3.pdf


    You ass. If a program is running forever, its doing something... You
    cannot just abort it?

    If it just runs

    10 REM Olcott
    20 goto 10

    It might be there for a timing thing, trying to use cycles for another program...
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory on Tue Oct 21 12:53:48 2025
    From Newsgroup: comp.theory

    On 2025-10-20 17:03:55 +0000, olcott said:

    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any interpretaion >>>> of the words that deviates from his understanding of them, nor to any
    inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
         If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D
         would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D
         specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    What Sipser did not agree was that even if the direct execution of D
    halts if not aborted it is still possible that H correctly determines
    that its simulated D would never stop running unless aborted.

    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    There is no "unless" about it. DD halts.
    --
    Mikko

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Tue Oct 21 18:54:33 2025
    From Newsgroup: comp.theory

    On 10/21/2025 4:53 AM, Mikko wrote:
    On 2025-10-20 17:03:55 +0000, olcott said:

    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any
    interpretaion
    of the words that deviates from his understanding of them, nor to any >>>>> inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
         If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D
         would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D
         specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>

    What Sipser did not agree was that even if the direct execution of D
    halts if not aborted it is still possible that H correctly determines
    that its simulated D would never stop running unless aborted.

    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    There is no "unless" about it. DD halts.


    That DD() halts depends on HHH(DD) rejecting its input.
    --
    Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory on Wed Oct 22 12:04:05 2025
    From Newsgroup: comp.theory

    On 2025-10-21 23:54:33 +0000, olcott said:

    On 10/21/2025 4:53 AM, Mikko wrote:
    On 2025-10-20 17:03:55 +0000, olcott said:

    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any interpretaion
    of the words that deviates from his understanding of them, nor to any >>>>>> inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>      If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D
         would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D >>>>>      specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>
    What Sipser did not agree was that even if the direct execution of D
    halts if not aborted it is still possible that H correctly determines
    that its simulated D would never stop running unless aborted.

    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    There is no "unless" about it. DD halts.

    That DD() halts depends on HHH(DD) rejecting its input.

    You have posted traces that unambigously show that DD() halts. And anyone
    can get from GirHub everything needed to check that DD() halts.
    --
    Mikko

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From olcott@polcott333@gmail.com to comp.theory on Wed Oct 22 07:32:48 2025
    From Newsgroup: comp.theory

    On 10/22/2025 4:04 AM, Mikko wrote:
    On 2025-10-21 23:54:33 +0000, olcott said:

    On 10/21/2025 4:53 AM, Mikko wrote:
    On 2025-10-20 17:03:55 +0000, olcott said:

    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any
    interpretaion
    of the words that deviates from his understanding of them, nor to >>>>>>> any
    inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>>      If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D >>>>>>      would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D >>>>>>      specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words
    10/13/2022>

    What Sipser did not agree was that even if the direct execution of D >>>>> halts if not aborted it is still possible that H correctly determines >>>>> that its simulated D would never stop running unless aborted.

    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    There is no "unless" about it. DD halts.

    That DD() halts depends on HHH(DD) rejecting its input.

    You have posted traces that unambigously show that DD() halts. And anyone
    can get from GirHub everything needed to check that DD() halts.


    No Turing machine can compute any mapping from
    non-inputs. The DD() caller of HHH(DD)
    *IS NOT AN ARGUMENT TO DD*
    --
    Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
    hits a target no one else can see." Arthur Schopenhauer
    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Mikko@mikko.levanto@iki.fi to comp.theory on Thu Oct 23 12:33:01 2025
    From Newsgroup: comp.theory

    On 2025-10-22 12:32:48 +0000, olcott said:

    On 10/22/2025 4:04 AM, Mikko wrote:
    On 2025-10-21 23:54:33 +0000, olcott said:

    On 10/21/2025 4:53 AM, Mikko wrote:
    On 2025-10-20 17:03:55 +0000, olcott said:

    On 10/20/2025 4:18 AM, Mikko wrote:
    On 2025-10-19 16:18:38 +0000, olcott said:

    On 10/19/2025 3:57 AM, Mikko wrote:
    On 2025-10-18 11:04:45 +0000, olcott said:

    On 10/18/2025 4:40 AM, Mikko wrote:
    On 2025-10-09 17:27:39 +0000, olcott said:

    *Ben already agreed that I met that particular reading*

    But Sipser hasn't agreed.

    It told me that I could quote his agreement.

    That only covers the specific words. He didn't agree to any interpretaion
    of the words that deviates from his understanding of them, nor to any >>>>>>>> inferences from those words.

    <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>>>      If simulating halt decider H correctly simulates its
         input D until H correctly determines that its simulated D >>>>>>>      would never stop running unless aborted then

         H can abort its simulation of D and correctly report that D >>>>>>>      specifies a non-halting sequence of configurations.
    </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>>>>>
    What Sipser did not agree was that even if the direct execution of D >>>>>> halts if not aborted it is still possible that H correctly determines >>>>>> that its simulated D would never stop running unless aborted.

    In the case of HHH(DD) even the directly executed DD()
    does not halt unless HHH(DD) unless HHH aborts the
    simulation of its input.

    There is no "unless" about it. DD halts.

    That DD() halts depends on HHH(DD) rejecting its input.

    You have posted traces that unambigously show that DD() halts. And anyone
    can get from GirHub everything needed to check that DD() halts.

    No Turing machine can compute any mapping from
    non-inputs. The DD() caller of HHH(DD)
    *IS NOT AN ARGUMENT TO DD*

    Irrelevant to the fact that DD halts.
    --
    Mikko

    --- Synchronet 3.21a-Linux NewsLink 1.2