Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  nodelist  faq  login

The easiest way to get the root password is to become system admin. -- Unknown source


computers / comp.ai.philosophy / Concise refutation of halting problem proofs V37 [ Olcott 2021 generic halt deciding principle ]

SubjectAuthor
o Concise refutation of halting problem proofs V37 [ Olcott 2021 genericolcott

1
Subject: Concise refutation of halting problem proofs V37 [ Olcott 2021 generic halt deciding principle ]
From: olcott
Newsgroups: comp.ai.philosophy, comp.ai.philosophy, sci.logic, sci.math
Followup: comp.theory
Date: Sat, 4 Dec 2021 21:24 UTC
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!feeder1.feed.usenet.farm!feed.usenet.farm!tr2.eu1.usenetexpress.com!feeder.usenetexpress.com!tr3.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 04 Dec 2021 15:24:25 -0600
Date: Sat, 4 Dec 2021 15:24:24 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Thunderbird/91.3.2
Newsgroups: comp.ai.philosophy,comp.ai.philosophy,sci.logic,sci.math
Content-Language: en-US
Followup-To: comp.theory
From: NoO...@NoWhere.com (olcott)
Subject: Concise refutation of halting problem proofs V37 [ Olcott 2021 generic halt deciding principle ]
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <T-adnfD6QOcUQTb8nZ2dnUU7-L3NnZ2d@giganews.com>
Lines: 38
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-3OmuiZ3C9WGgwz4qK0O4TxZrTYAG0v1zB6bR55PFRYMDcVXhk6srR3RSwIX3GD5MuF0KZhZ9gKaFTAW!M6s/ecekdhTYLtoRXrAF3bjC4SoYm1Ly9NUFJvxGwo8pQoEkEtj7ZgTBjCcvULDbFdc7bGQXmhXY!Bw==
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: 2637
View all headers
[Olcott 2021 generic halt deciding principle]
Whenever the pure simulation of the input to simulating halt decider H(x,y) never stops running unless H aborts its simulation H correctly aborts this simulation and returns 0 for not halting.

Halting problem
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

      Now we construct a new Turing machine D with H as a subroutine.
      This new TM calls H to determine what M does when the input to M
      is its own description ⟨M⟩. Once D has determined this information,
      it does the opposite.  (Sipser:1997:165)

// Simplified Linz(1990) Ĥ
// and Strachey(1965) P
void P(ptr x)
{
   if (H(x, x))
     HERE: goto HERE;
}

The pathological feedback loop between the halt decider and its input that otherwise makes inputs like the above impossible for H(P,P) to decide has been eliminated.

Halting problem undecidability and infinitely nested simulation (V2)
https://www.researchgate.net/publication/356105750_Halting_problem_undecidability_and_infinitely_nested_simulation_V2


--
Copyright 2021 Pete Olcott

Talent hits a target no one else can hit;
Genius hits a target no one else can see.
Arthur Schopenhauer


1
rocksolid light 0.7.2
clearneti2ptor