RetroBBS - comp.ai.philosophy - Re: The HP does not exist as stated .. [ Simulating halt deciders ]

Re: The HP does not exist as stated .. [ Simulating halt deciders ]

<_fadncJ55ZzjIJj8nZ2dnUU7-I_NnZ2d@giganews.com>

https://www.rocksolidbbs.com/computers/article-flat.php?id=7185&group=comp.ai.philosophy#7185

copy link Newsgroups: comp.theory comp.ai.philosophy sci.math.symbolic comp.software-eng

Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 31 Jul 2021 16:15:42 -0500
Subject: Re: The HP does not exist as stated .. [ Simulating halt deciders ]
Newsgroups: comp.theory,comp.ai.philosophy,sci.math.symbolic,comp.software-eng
References: <20210731215950.00006a42@reddwarf.jmc>
From: NoOne@NoWhere.com (olcott)
Date: Sat, 31 Jul 2021 16:15:42 -0500
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:78.0) Gecko/20100101
Thunderbird/78.12.0
MIME-Version: 1.0
In-Reply-To: <20210731215950.00006a42@reddwarf.jmc>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Language: en-US
Content-Transfer-Encoding: 8bit
Message-ID: <_fadncJ55ZzjIJj8nZ2dnUU7-I_NnZ2d@giganews.com>
Lines: 42
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-ycyqQKp2r3mpoLZ+glYgMcuJs3jGb7IAvmzE8rnO8EV8W1K+e/UGGnPdzkFxnuCC9oCuGsUrKisJOoz!CnsaVO7RLjjp3VYuZShhDi+QswaYz+lhSVBDPNIsKYsYxc8SwkJTsmgkspHkKPHnHswUN2mO7A==
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 2425

by: olcott - Sat, 31 Jul 2021 21:15 UTC

On 7/31/2021 3:59 PM, Mr Flibble wrote:
> .. because it is predicated on an erroneous contradiction!
>
> It is really that simple!
>
> This is a troll.
>
> /Flibble
>

In computability theory, the halting problem is the problem of
determining, from a description of an arbitrary computer program and an
input, whether the program will finish running, or continue to run
forever. https://en.wikipedia.org/wiki/Halting_problem

https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation

// Simplified Linz Ĥ (Linz:1990:319)
// Strachey(1965) CPL translated to C
void P(u32 x)
{ if (H(x, x))
HERE: goto HERE;
}

int main()
{ Output("Input_Halts = ", H((u32)P, (u32)P));
}

A simulating halt decider H correctly decides that its input (P,P) never
reaches it final state.

This same statement equally applies to the Peter Linz proof when Ĥ is
applied to its own Turing Machine description ⟨Ĥ⟩ as shown in my paper.

"Great spirits have always encountered violent opposition from mediocre
minds." Einstein

Memories of you remind me of you. -- Karl Lehenbauer

computers / comp.ai.philosophy / Re: The HP does not exist as stated .. [ Simulating halt deciders ]

computers / comp.ai.philosophy / Re: The HP does not exist as stated .. [ Simulating halt deciders ]

Subject	Author
Re: The HP does not exist as stated .. [ Simulating halt deciders ]	olcott