Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

Staff meeting in the conference room in %d minutes.


computers / comp.ai.philosophy / Concise refutation of halting problem proofs V50 [ Linz Proof ]

SubjectAuthor
o Concise refutation of halting problem proofs V50 [ Linz Proof ]olcott

1
Concise refutation of halting problem proofs V50 [ Linz Proof ]

<odGdnSfT746ugXH8nZ2dnUU7-cnNnZ2d@giganews.com>

 copy mid

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

 copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!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, 22 Jan 2022 09:01:07 -0600
Date: Sat, 22 Jan 2022 09:01:06 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.5.0
Newsgroups: comp.theory,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 V50 [ Linz Proof ]
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <odGdnSfT746ugXH8nZ2dnUU7-cnNnZ2d@giganews.com>
Lines: 59
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-kOz/zGCx+3sMUA+j67d0rl4cmkN43zkYBw6DvtYgTfqiAAU6cLVxXmF/y9IjrucHNWoSlwZY07ePXyE!ZrbqtJ/a6+TdFIkUrl7i5FridECX5vQq4m01WRYYitZ+2HxXp9VaYcmrdJDvt6pAT1ezjmi6grvN
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: 3757
 by: olcott - Sat, 22 Jan 2022 15:01 UTC

Halting problem undecidability and infinitely nested simulation (V3)

We define Linz H to base its halt status decision on the behavior of its
pure simulation of N steps of its input. If the simulated input cannot
reach its own final state in any finite number of steps then H aborts
the simulation of this input and transitions to H.qn. H determines this
on the basis of matching infinitely repeating behavior patterns. The
copy of H embedded in Ĥ computes the mapping from its input ⟨Ĥ⟩ ⟨Ĥ⟩ to
Ĥ.qn on the basis of the above criteria.

The following simplifies the syntax for the definition of the Linz
Turing machine Ĥ, it is now a single machine with a single start state.
A copy of Linz H is embedded at Ĥ.qx.

Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.qx ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn

Because it is known that the UTM simulation of a machine is
computationally equivalent to the direct execution of this same machine
H can always form its halt status decision on the basis of what the
behavior of the UTM simulation of its inputs would be.

When embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩ these steps would keep repeating:
Ĥ copies its input ⟨Ĥ⟩ to ⟨Ĥ⟩ then embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩...

computation that halts … the Turing machine will halt whenever it enters
a final state. (Linz:1990:234)

This shows that the simulated input to embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ would never
reach its final state conclusively proving that this simulated input
never halts. This enables embedded_H to abort the simulation of its
input and correctly transition to Ĥ.qn.

if embedded_H does correctly recognize an infinitely repeating behavior
pattern in the behavior of its simulated input: ⟨Ĥ⟩ applied to ⟨Ĥ⟩ then
embedded_H is necessarily correct to abort the simulation of its input
and transition to Ĥ.qn.

Because halt decider is a decider embedded_H is only accountable for
computing the mapping from ⟨Ĥ⟩ ⟨Ĥ⟩ to Ĥ.qy or Ĥ.qn on the basis of the
behavior specified by these inputs. embedded_H is not accountable for
any other behavior besides the behavior specified by its actual inputs.

Halting problem undecidability and infinitely nested simulation (V3)

https://www.researchgate.net/publication/358009319_Halting_problem_undecidability_and_infinitely_nested_simulation_V3

--
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
server_pubkey.txt

rocksolid light 0.9.7
clearnet tor