Message-ID:

24 Apr, 2024: Testing a new version of the Overboard here. If you have an issue post about it to rocksolid.nodes.help (I know. Everyone on Usenet has issues)

computers / comp.ai.philosophy / Re: The contradiction that the HP is predicated on is detectable ..

Re: The contradiction that the HP is predicated on is detectable ..

<rYidnQSpK4Xw1J38nZ2dnUU7-R3NnZ2d@giganews.com>

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

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

Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!news.uzoreto.com!tr1.eu1.usenetexpress.com!feeder.usenetexpress.com!tr1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!buffer1.nntp.dca1.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Tue, 27 Jul 2021 12:59:09 -0500
Subject: Re: The contradiction that the HP is predicated on is detectable ..
Newsgroups: comp.theory,comp.ai.philosophy,comp.software-eng,sci.math.symbolic
References: <20210727183426.00002ff2@reddwarf.jmc>
From: NoO...@NoWhere.com (olcott)
Date: Tue, 27 Jul 2021 12:59:08 -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: <20210727183426.00002ff2@reddwarf.jmc>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Language: en-US
Content-Transfer-Encoding: 7bit
Message-ID: <rYidnQSpK4Xw1J38nZ2dnUU7-R3NnZ2d@giganews.com>
Lines: 38
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-2YANZQYw5rak8+RsGFIw/CHJeTlxysZ8LPFbIhwhSNB7NdM4KHpQBPXpS/1DuZYM2Ku5l9wP55Qtd0l!J6dUo6ishIW6t/dp6eoQGO9Rf3ILQTEGzz3NakNKFjq8Ws+mfCNCASB0XNolFsiIf6H1f4E26Q==
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: 2489

by: olcott - Tue, 27 Jul 2021 17:59 UTC

On 7/27/2021 12:34 PM, Mr Flibble wrote:
> .. due to the infinite recursion missed by Strachey blowing the stack of
> any turing machine simulator with finite memory (stack) size. One
> simply needs to detect out of memory when more than one instance of the
> decider is present in the call stack.
>

This seems correct. I accomplished the same thing differently in my
current paper.

To the best of my knowledge I am the first to derive the key insight
that the conventional HP counter-examples specify infinite recursion to
any simulating halt decider.

It looks like the original specification provided in
the Linz text may be infinitely recursive in that each
TM requires its own input. ...(Olcott:2016)

https://www.researchgate.net/publication/307509556_Self_Modifying_Turing_Machine_SMTM_Solution_to_the_Halting_Problem_concrete_example

> This is a troll.
>
> Message ends.
>
> /Flibble
>

This is my current paper:
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation

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

Subject	Author
Re: The contradiction that the HP is predicated on is detectable ..	olcott