Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.

Dismiss

1 view

Skip to first unread message

Feb 12, 2023, 11:10:22 AM2/12/23

to

On 2/11/2023 9:21 PM, olcott wrote:

> Every E correctly simulated by any HH cannot possibly halt

> (AKA reach its own return instruction and terminate normally)

>

> void E(int (*x)())

> {

> HH(x, x);

> return;

> }

>

> int main()

> {

> HH(E,E);

> }

>

> Two people with masters degrees in computer science have agreed that E

> correctly simulated by HH cannot possibly reach its own "return"

> instruction in any finite number of steps of correct simulation.

>

> HH only needs to simulate E until HH correctly detects that E has a

> repeating state such that E correctly simulated by HH cannot possibly

> reach its own final state an terminate normally in any finite number of

> steps. *Fully operational software linked below proves this*

>

> *Simulating Halt Decider Applied to the Halting Theorem*

> https://www.researchgate.net/publication/364657019_Simulating_Halt_Decider_Applied_to_the_Halting_Theorem

>

> *Complete halt deciding system* (Visual Studio Project)

> (a) x86utm operating system

> (b) x86 emulator adapted from libx86emu to compile under Windows

> (c) Several halt deciders and their sample inputs contained within Halt7.c

>

> https://liarparadox.org/2023_02_07.zip

>

>

Because it is an easily verified fact that

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

cannot possibly halt

(reach its own "return" instruction and terminate normally)

It is necessarily correct for HH to abort its simulation of E and reject

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

as non-halting as soon as it detects the repeating state in

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

*straw man*

An intentionally misrepresented proposition that is set up because it is

easier to defeat than an opponent's real argument.

https://www.lexico.com/en/definition/straw_man

--

Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius

hits a target no one else can see." Arthur Schopenhauer

> Every E correctly simulated by any HH cannot possibly halt

> (AKA reach its own return instruction and terminate normally)

>

> void E(int (*x)())

> {

> HH(x, x);

> return;

> }

>

> int main()

> {

> HH(E,E);

> }

>

> Two people with masters degrees in computer science have agreed that E

> correctly simulated by HH cannot possibly reach its own "return"

> instruction in any finite number of steps of correct simulation.

>

> HH only needs to simulate E until HH correctly detects that E has a

> repeating state such that E correctly simulated by HH cannot possibly

> reach its own final state an terminate normally in any finite number of

> steps. *Fully operational software linked below proves this*

>

> *Simulating Halt Decider Applied to the Halting Theorem*

> https://www.researchgate.net/publication/364657019_Simulating_Halt_Decider_Applied_to_the_Halting_Theorem

>

> *Complete halt deciding system* (Visual Studio Project)

> (a) x86utm operating system

> (b) x86 emulator adapted from libx86emu to compile under Windows

> (c) Several halt deciders and their sample inputs contained within Halt7.c

>

> https://liarparadox.org/2023_02_07.zip

>

>

Because it is an easily verified fact that

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

cannot possibly halt

(reach its own "return" instruction and terminate normally)

It is necessarily correct for HH to abort its simulation of E and reject

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

as non-halting as soon as it detects the repeating state in

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

*straw man*

An intentionally misrepresented proposition that is set up because it is

easier to defeat than an opponent's real argument.

https://www.lexico.com/en/definition/straw_man

--

Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius

hits a target no one else can see." Arthur Schopenhauer

Feb 12, 2023, 11:16:31 AM2/12/23

to

On 2/11/2023 9:21 PM, olcott wrote:

> Every E correctly simulated by any HH cannot possibly halt

> (AKA reach its own return instruction and terminate normally)

>

> void E(int (*x)())

> {

> HH(x, x);

> return;

> }

>

> int main()

> {

> HH(E,E);

> }

>

> Two people with masters degrees in computer science have agreed that E

> correctly simulated by HH cannot possibly reach its own "return"

> instruction in any finite number of steps of correct simulation.

>

> HH only needs to simulate E until HH correctly detects that E has a

> repeating state such that E correctly simulated by HH cannot possibly

> reach its own final state an terminate normally in any finite number of

> steps. *Fully operational software linked below proves this*

>

> *Simulating Halt Decider Applied to the Halting Theorem*

> https://www.researchgate.net/publication/364657019_Simulating_Halt_Decider_Applied_to_the_Halting_Theorem

>

> *Complete halt deciding system* (Visual Studio Project)

> (a) x86utm operating system

> (b) x86 emulator adapted from libx86emu to compile under Windows

> (c) Several halt deciders and their sample inputs contained within Halt7.c

>

> https://liarparadox.org/2023_02_07.zip

>

>

*Because it is an easily verified fact that*
> Every E correctly simulated by any HH cannot possibly halt

> (AKA reach its own return instruction and terminate normally)

>

> void E(int (*x)())

> {

> HH(x, x);

> return;

> }

>

> int main()

> {

> HH(E,E);

> }

>

> Two people with masters degrees in computer science have agreed that E

> correctly simulated by HH cannot possibly reach its own "return"

> instruction in any finite number of steps of correct simulation.

>

> HH only needs to simulate E until HH correctly detects that E has a

> repeating state such that E correctly simulated by HH cannot possibly

> reach its own final state an terminate normally in any finite number of

> steps. *Fully operational software linked below proves this*

>

> *Simulating Halt Decider Applied to the Halting Theorem*

> https://www.researchgate.net/publication/364657019_Simulating_Halt_Decider_Applied_to_the_Halting_Theorem

>

> *Complete halt deciding system* (Visual Studio Project)

> (a) x86utm operating system

> (b) x86 emulator adapted from libx86emu to compile under Windows

> (c) Several halt deciders and their sample inputs contained within Halt7.c

>

> https://liarparadox.org/2023_02_07.zip

>

>

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

cannot possibly halt

(reach its own "return" instruction and terminate normally)

*HH is necessarily correct to abort its simulation of E and reject*
E correctly simulated by HH

E correctly simulated by HH

cannot possibly halt

(reach its own "return" instruction and terminate normally)

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

*as non-halting as soon as it detects the repeating state in*
E correctly simulated by HH

E correctly simulated by HH

Feb 12, 2023, 3:28:09 PM2/12/23

to

aborts and returns an answer, so fails to be a decider.

>

> It is necessarily correct for HH to abort its simulation of E and reject

> E correctly simulated by HH

> E correctly simulated by HH

> E correctly simulated by HH

>

assumptions.

HH either DOES correctly simulate E, and thus never anwwers, or HH

DOESN'T correctly simulate E and usies INVALID logic to claim its answer

is incorrecgt.

> as non-halting as soon as it detects the repeating state in

> E correctly simulated by HH

> E correctly simulated by HH

> E correctly simulated by HH

as what HH sees as it simulates is:

it simulating the instructionss of E to the call to HH

then it simulating the code of HH simulating the instuctions of E utill

that reaches a call to HH

then it simulationg the code of HH simulating the code of HH simmulating

the instructions of E untill....

You never reach the EXACT same state.

>

> *straw man*

> An intentionally misrepresented proposition that is set up because it is

> easier to defeat than an opponent's real argument.

> https://www.lexico.com/en/definition/straw_man

>

Remember, the ACTUAL question given to a Halting Decider is what is the

behavior of the machine its input describes, when that machine would be

actually run.

By the definiton of a UTM, that can be replaced by asking the Halting

Decider what is the behavior of the simulation done by a UTM simulating

the input to this halt decider.

Changing that simulation from a UTH to the Decider is just preforming a

Straw Man.

Your continued use of this just shows you are either totally ignorant of

the actual rules of logic or that you are just a pathological liar.

You will likely not actually respond to this, but just repeat your

claim, PROVING you don't actually HAVE a valid response to it.

Your REPUTATION is MUD, and for as long as you are remembered it will be

as the idiot that you have proven yourself to be.

Feb 12, 2023, 4:34:11 PM2/12/23

to

only ridiculously foolish antics that can be spotted as obvious

deception by anyone with very slight software engineering competence.

Feb 12, 2023, 4:45:02 PM2/12/23

to

I replied to you ranting, you have ignored my statements because you

have NO answer to it, so you are admitting you are a failure and are

using flawed logic.

YOU ARE ADMITTING FAILURE BY NOT RESPONDING TO THE REBUTAL.

You are just proving that you are a ignorant pathological lying idiot.

Your arguement is base on simple lies that are based on assuming the

impossible happens.

Feb 13, 2023, 11:17:38 AM2/13/23

to

On 2/12/2023 10:16 AM, olcott wrote:

E correctly simulated by HH

E correctly simulated by HH

E correctly simulated by HH

would continue to call HH(E,E) in recursive simulation
E correctly simulated by HH

making it impossible for

E correctly simulated by H

E correctly simulated by H

E correctly simulated by H

to reach its own "return" instruction and terminate normally (AKA halt).

Feb 13, 2023, 6:56:12 PM2/13/23

to

0 new messages

Search

Clear search

Close search

Google apps

Main menu