Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > sci.logic > #249318

Re: Simulating Halt Deciders Defeat the Halting Theorem V2

Cross-posted to 4 groups.

Show all headers | View raw

On 2/21/23 10:38 AM, olcott wrote:
> On 2/20/2023 10:44 PM, olcott wrote:
>> On 2/20/2023 10:08 PM, olcott wrote:
>>> On 2/20/2023 9:28 PM, olcott wrote:
>>>> On 2/20/2023 8:53 PM, olcott wrote:
>>>>> On 2/20/2023 8:22 PM, olcott wrote:
>>>>>> On 2/20/2023 7:10 PM, olcott wrote:
>>>>>>> On 2/20/2023 6:46 PM, olcott wrote:
>>>>>>>> On 2/20/2023 12:39 PM, olcott wrote:
>>>>>>>>> int D(int (*x)())
>>>>>>>>> {
>>>>>>>>>    int Halt_Status = H(x, x);
>>>>>>>>>    if (Halt_Status)
>>>>>>>>>      HERE: goto HERE;
>>>>>>>>>    return Halt_Status;
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> When simulating halt decider H is applied to the conventional 
>>>>>>>>> (otherwise
>>>>>>>>> impossible) input D ordinary software engineering conclusively 
>>>>>>>>> proves
>>>>>>>>> that D correctly simulated by H cannot possibly reach its own 
>>>>>>>>> return
>>>>>>>>> statement and terminate normally (AKA halt).
>>>>>>>>>
>>>>>>>>> A simulating halt decider H correctly predicts whether or not D
>>>>>>>>> correctly simulated by H would ever reach its own final state.
>>>>>>>>>
>>>>>>>>> The ultimate measure of a correct simulation is that the 
>>>>>>>>> execution trace
>>>>>>>>> behavior of the simulated input exactly matches the behavior 
>>>>>>>>> that the
>>>>>>>>> input machine code specifies.
>>>>>>>>>
>>>>>>>>> https://www.researchgate.net/publication/368568464_Simulating_Halt_Deciders_Defeat_the_Halting_Theorem
>>>>>>>>>
>>>>>>>>> Disagreeing with the above verified facts is only possible through
>>>>>>>>> dishonesty or incompetence.
>>>>>>>>>
>>>>>>>>> Whether or not the above directly applies to the halting 
>>>>>>>>> theorem is the
>>>>>>>>> only actually open issue.
>>>>>>>>>
>>>>>>>>
>>>>>>>> *I had to tighten my language a little bit*
>>>>>>>
>>>>>>> When the ultimate measure of correct simulation is that the 
>>>>>>> execution
>>>>>>> trace of the simulated input exactly matches the behavior that 
>>>>>>> the input
>>>>>>> machine description specifies then: It is an easily verified fact 
>>>>>>> that
>>>>>>> every counter-example input to the halting theorem D cannot possibly
>>>>>>> reach its own simulated final state in any finite number of steps 
>>>>>>> when
>>>>>>> correctly simulated by  simulating halt decider H.
>>>>>>
>>>>>> Any alternative definition for "correct simulation" that 
>>>>>> contradicts the
>>>>>> above definition necessary requires that D simulated by H derives an
>>>>>> execution trace that is not specified by its input...
>>>>>>
>>>>>
>>>>> Anyone with sufficient software engineering skill knows that
>>>>> *D simulated by H cannot possibly correctly reach its ret instruction*
>>>>> Everyone else lacks sufficient software engineering skill or lies
>>>>>
>>>>> _D()
>>>>> [00001d12] 55         push ebp
>>>>> [00001d13] 8bec       mov ebp,esp
>>>>> [00001d15] 51         push ecx
>>>>> [00001d16] 8b4508     mov eax,[ebp+08]
>>>>> [00001d19] 50         push eax       // push D
>>>>> [00001d1a] 8b4d08     mov ecx,[ebp+08]
>>>>> [00001d1d] 51         push ecx       // push D
>>>>> [00001d1e] e83ff8ffff call 00001562  // call H
>>>>> [00001d23] 83c408     add esp,+08
>>>>> [00001d26] 8945fc     mov [ebp-04],eax
>>>>> [00001d29] 837dfc00   cmp dword [ebp-04],+00
>>>>> [00001d2d] 7402       jz 00001d31
>>>>> [00001d2f] ebfe       jmp 00001d2f
>>>>> [00001d31] 8b45fc     mov eax,[ebp-04]
>>>>> [00001d34] 8be5       mov esp,ebp
>>>>> [00001d36] 5d         pop ebp
>>>>> [00001d37] c3         ret
>>>>>
>>>>>
>>>>
>>>> *THIS IS NOW A VERIFIED FACT*
>>>> Because H and D have the required "do the opposite of whatever the halt
>>>> decider decides" relationship H does correctly determine the halt 
>>>> status
>>>> of the halting problem proof's previously impossible input.
>>>>
>>>
>>> Now that the previously impossible input has been correctly determined
>>> to be non-halting the halting theorem loses its entire basis.
>>>
>>> The halting theorem does not prove that a set of input pairs cannot be
>>> divided into halting and not halting. It only proves that one criterion
>>> measure for dividing these pairs does not always work.
>>>
>>
>> The halting theorem does not prove that a set of input pairs cannot be
>> divided into halting and not halting. It only proves that one criterion
>> measure for dividing these pairs does not always work.
>>
>> *A famous theorem with a false conclusion ceases to be a famous theorem*
> 
> The halting theorem does not prove that a set of input pairs cannot be
> divided into halting and not halting. It only proves that one criterion
> measure for dividing these pairs does not always work.

Ad that ONE criteria is the actual criteria for a machine halt, BY 
DEFINITOIN.

> 
> *A famous theorem with a false conclusion ceases to be a famous theorem*

And a FALSE theorem based on a FALSE premsie is jus FALSE.

> 
> It is a verified fact that H correctly predicts that D correctly
> simulated by H would never reach its own final state and terminate
> normally, thus H does correctly decide halting for its input D.

Nope, H does NOT correctly predict what its correct prediction would do, 
since it doesn't do what it is predicted to do.

You are just proving your insanity.

> 
> Every counter-example input to every proof of the halting theorem can be 
> treated this same way.
> 

Nope, which also shows your stupidity.

How does your idea handle the Busy Beaver issue?

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

Thread

Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 12:39 -0600
  Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-20 19:20 -0500
  Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 18:46 -0600
    Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 19:10 -0600
      Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 20:22 -0600
        Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-20 21:32 -0500
        Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 20:53 -0600
          Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-20 22:06 -0500
          Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 21:28 -0600
            Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-20 22:38 -0500
            Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 22:08 -0600
              Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-20 23:21 -0500
              Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-20 22:44 -0600
                Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-21 07:03 -0500
                Re: Simulating Halt Deciders Defeat the Halting Theorem V2 olcott <polcott2@gmail.com> - 2023-02-21 09:38 -0600
                Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Fritz Feldhase <franz.fritschee.ff@gmail.com> - 2023-02-21 11:28 -0800
                Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-21 18:45 -0500
                Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Fritz Feldhase <franz.fritschee.ff@gmail.com> - 2023-02-21 17:03 -0800
    Re: Simulating Halt Deciders Defeat the Halting Theorem V2 Richard Damon <Richard@Damon-Family.org> - 2023-02-20 20:54 -0500

csiph-web