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


Groups > comp.lang.c++ > #87017

Re: MIT Professor Michael Sipser validates the notion of a simulating halt decider V2

From Mr Flibble <flibble@reddwarf.jmc.corp>
Newsgroups comp.theory, sci.logic, comp.lang.c++, comp.ai.philosophy
Subject Re: MIT Professor Michael Sipser validates the notion of a simulating halt decider V2
Message-ID <20221016163736.00007b9f@reddwarf.jmc.corp> (permalink)
References <tih792$35k10$3@dont-email.me>
Organization Jupiter Mining Corporation
Date 2022-10-16 16:37 +0100

Cross-posted to 4 groups.

Show all headers | View raw


On Sun, 16 Oct 2022 10:16:48 -0500
olcott <polcott2@gmail.com> wrote:

> <Sipser approved abstract>
> MIT Professor Michael Sipser has agreed that the following verbatim 
> paragraph is correct (he has not agreed to anything else in this
> paper):
> 
> 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.
> </Sipser approved abstract>
> 
> to this paper:
> 
> *Rebutting the Sipser Halting Problem Proof*
> https://www.researchgate.net/publication/364302709_Rebutting_the_Sipser_Halting_Problem_Proof
> 
> The proof that the simulation of D by H is correct and that this 
> correctly simulated D would never stop running unless aborted is on
> page 3 of the above paper. People that fail to comprehend the
> technical details of page 3 are unqualified to assess the correctness
> of page 3.
> 
> The technical prerequisites for page 3 are expert knowledge of the C 
> programming language, knowledge of x86 assembly language and how the
> C calling conventions are implemented in x86 assembly language.
> 
> Page 4 shows the application of a simulating halt decider to the
> Peter Linz proof proving that the "impossible" input ⟨Ĥ⟩ ⟨Ĥ⟩ to the
> embedded copy of Linz H contained within Linz Ĥ is correctly
> construed as specifying non-halting sequence of configurations.

You have been told multiple times now that you are not doing a correct
simulation of D so it doesn't matter what Sipser says.

The correct simulation of D by H is D behaving as if there was a
direction execution of D(D).

/Flibble 

Back to comp.lang.c++ | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

MIT Professor Michael Sipser validates the notion of a simulating halt decider V2 olcott <polcott2@gmail.com> - 2022-10-16 10:16 -0500
  Re: MIT Professor Michael Sipser validates the notion of a simulating halt decider V2 Mr Flibble <flibble@reddwarf.jmc.corp> - 2022-10-16 16:37 +0100
    Re: MIT Professor Michael Sipser validates the notion of a simulating halt decider V2 olcott <none-ya@beez-waxes.com> - 2022-10-16 10:44 -0500

csiph-web