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

Dismiss

0 views

Skip to first unread message

Feb 14, 2023, 10:55:45 AM2/14/23

to

001 int h(x, y); // suppose the detail of h(x, y) is in a library.

002

003 int c(x) {

004 int halt_status = h(x, x)

005 if (h(halt_status != 0) {

006 while(TRUE) {

007 ;

008 }

009 }

010 return halt_status;

011 }

012

013 main() {

014 Output("Input_Halts = ", h(c, c));

015 Output("Input_Halts = ", c(c));

016 }

*Simulating halt deciders applied to the halting theorem*

Because c simulated by h would continue to call h(c,c) never reaching

its own "if" statement h aborts it simulation of c and returns 0 to main

on line 014.

Because c simulated by h would continue to call h(c,c) never reaching

its own "if" statement h aborts it simulation of c and returns 0 to the

executed c on line 004.

--

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

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

002

003 int c(x) {

004 int halt_status = h(x, x)

005 if (h(halt_status != 0) {

006 while(TRUE) {

007 ;

008 }

009 }

010 return halt_status;

011 }

012

013 main() {

014 Output("Input_Halts = ", h(c, c));

015 Output("Input_Halts = ", c(c));

016 }

*Simulating halt deciders applied to the halting theorem*

Because c simulated by h would continue to call h(c,c) never reaching

its own "if" statement h aborts it simulation of c and returns 0 to main

on line 014.

Because c simulated by h would continue to call h(c,c) never reaching

its own "if" statement h aborts it simulation of c and returns 0 to the

executed c on line 004.

--

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

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

Feb 14, 2023, 11:03:28 AM2/14/23

to

001 int h(x, y); // suppose the detail of h(x, y) is in a library.

002

003 int c(x) {

004 int halt_status = h(x, x);

005 if (halt_status != 0) {
002

003 int c(x) {

004 int halt_status = h(x, x);

006 while(TRUE) {

007 ;

008 }

009 }

010 return halt_status;

011 }

012

013 int main() {
007 ;

008 }

009 }

010 return halt_status;

011 }

012

014 Output("Input_Halts = ", h(c, c));

015 Output("Input_Halts = ", c(c));

016 }

*Simulating halt deciders applied to the halting theorem*

Because c correctly simulated by h would continue to call h(c,c) in
015 Output("Input_Halts = ", c(c));

016 }

*Simulating halt deciders applied to the halting theorem*

recursive simulation never reaching its own "if" statement h aborts it

simulation of c and returns 0 to main on line 014.

Because c correctly simulated by h would continue to call h(c,c) in
recursive simulation never reaching its own "if" statement h aborts it

Feb 14, 2023, 5:28:20 PM2/14/23

to

On 2/14/23 10:55 AM, olcott wrote:

> 001 int h(x, y); // suppose the detail of h(x, y) is in a library.

> 002

> 003 int c(x) {

> 004 int halt_status = h(x, x)

> 005 if (h(halt_status != 0) {

> 006 while(TRUE) {

> 007 ;

> 008 }

> 009 }

> 010 return halt_status;

> 011 }

> 012

> 013 main() {

> 014 Output("Input_Halts = ", h(c, c));

> 015 Output("Input_Halts = ", c(c));

> 016 }

>

> *Simulating halt deciders applied to the halting theorem*

>

> Because c simulated by h would continue to call h(c,c) never reaching

> its own "if" statement h aborts it simulation of c and returns 0 to main

> on line 014.

>

> Because c simulated by h would continue to call h(c,c) never reaching

> its own "if" statement h aborts it simulation of c and returns 0 to the

> executed c on line 004.

>

No, because H(c,c) will return 0 by your logic, c(c) will Halt.
> 001 int h(x, y); // suppose the detail of h(x, y) is in a library.

> 002

> 003 int c(x) {

> 004 int halt_status = h(x, x)

> 005 if (h(halt_status != 0) {

> 006 while(TRUE) {

> 007 ;

> 008 }

> 009 }

> 010 return halt_status;

> 011 }

> 012

> 013 main() {

> 014 Output("Input_Halts = ", h(c, c));

> 015 Output("Input_Halts = ", c(c));

> 016 }

>

> *Simulating halt deciders applied to the halting theorem*

>

> Because c simulated by h would continue to call h(c,c) never reaching

> its own "if" statement h aborts it simulation of c and returns 0 to main

> on line 014.

>

> Because c simulated by h would continue to call h(c,c) never reaching

> its own "if" statement h aborts it simulation of c and returns 0 to the

> executed c on line 004.

>

Since the DEFINITION of the correct answer of the Halting Problem is

what the ACTUAL machine will do when given the input, the correct answer

is HALTING, and thus H is WRONG.

You have "claimed" that H called by c behaves differently than H called

by main, but have been unable to actually show that, showing that the

claim is just a blatant pathological LIE.

The fact that you think an answer difffernt than the correct answer can

be "correct" show you are stupid.

Note, the fact that H can't correctly simulate the input and give an

answer is NOT a valid "excuse" for H to give a wrong answr.

Note, a fundamental problem with your logic is you don't seem to

understand that a program will do EXACTLY as it is programmed, even if

that doesn't match its supposed specification, so you can't just assume

it will act per its specification.

0 new messages

Search

Clear search

Close search

Google apps

Main menu