Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  nodelist  faq  login

Basic is a high level languish. APL is a high level anguish.


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

SubjectAuthor
* Concise refutation of halting problem proofs V61 [ Linz Proof ]olcott
`* Re: Concise refutation of halting problem proofs V61 [ Linz Proof ]olcott
 `- Re: Concise refutation of halting problem proofs V61 [ Linz Proof ]olcott

1
Subject: Concise refutation of halting problem proofs V61 [ Linz Proof ]
From: olcott
Newsgroups: comp.theory, comp.ai.philosophy, sci.logic, sci.math
Followup: comp.theory
Organization: A noiseless patient Spider
Date: Sat, 5 Feb 2022 16:32 UTC
Path: i2pn2.org!i2pn.org!eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
Subject: Concise refutation of halting problem proofs V61 [ Linz Proof ]
Followup-To: comp.theory
Date: Sat, 5 Feb 2022 10:32:41 -0600
Organization: A noiseless patient Spider
Lines: 51
Message-ID: <stm8r9$5co$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 5 Feb 2022 16:32:42 -0000 (UTC)
Injection-Info: reader02.eternal-september.org; posting-host="4640d355803e17d9b334791de5256ab2";
logging-data="5528"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19pNwswwArRGe0iVT7XosZW"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.5.1
Cancel-Lock: sha1:vs8+1Q8QaGu76azvEjgBEBYgbdI=
Content-Language: en-US
View all headers
Halting problem undecidability and infinitely nested simulation (V3)

Linz H is defined as simulating halt decider that bases its halt status decision on whether or not its correct simulation of its input could ever reach the final state of this simulated input. H determines this on the basis of matching infinite behavior patterns. When an infinite behavior pattern is matched H aborts its simulation and transitions to its final reject state. Otherwise H transitions to its accept state when its simulation ends.

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

Can the correct simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by embedded_H possibly transition to ⟨Ĥ⟩.qn ?

When Ĥ is applied to ⟨Ĥ⟩
   Ĥ copies its input ⟨Ĥ1⟩ to ⟨Ĥ2⟩ then embedded_H simulates ⟨Ĥ1⟩ ⟨Ĥ2⟩

Then these steps would keep repeating:
   Ĥ1 copies its input ⟨Ĥ2⟩ to ⟨Ĥ3⟩ then embedded_H simulates ⟨Ĥ2⟩ ⟨Ĥ3⟩
   Ĥ2 copies its input ⟨Ĥ3⟩ to ⟨Ĥ4⟩ then embedded_H simulates ⟨Ĥ3⟩ ⟨Ĥ4⟩
   Ĥ3 copies its input ⟨Ĥ4⟩ to ⟨Ĥ5⟩ then embedded_H simulates ⟨Ĥ4⟩ ⟨Ĥ5⟩...

The above shows that the correctly simulated (as if Ĥ.qx was a UTM) input to embedded_H would never reach its final state of ⟨Ĥ⟩.qn conclusively proving that this simulated input never halts. This enables embedded_H to abort its simulation and correctly transition to Ĥ.qn.

Because all simulating halt deciders are deciders they are only accountable for computing the mapping from their input finite strings to an accept or reject state on the basis of whether or not their correctly simulated input could ever reach its final state.

embedded_H is only accountable for the behavior of its input ⟨Ĥ⟩ applied to ⟨Ĥ⟩. embedded_H is not accountable for the behavior of the computation that it is contained within: Ĥ applied to ⟨Ĥ⟩.


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


Subject: Re: Concise refutation of halting problem proofs V61 [ Linz Proof ]
From: olcott
Newsgroups: comp.theory, comp.ai.philosophy, sci.logic, sci.math
Followup: comp.theory
Organization: A noiseless patient Spider
Date: Sun, 6 Feb 2022 14:43 UTC
References: 1 2
Path: i2pn2.org!i2pn.org!eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From: polco...@gmail.com (olcott)
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
Subject: Re: Concise refutation of halting problem proofs V61 [ Linz Proof ]
Followup-To: comp.theory
Date: Sun, 6 Feb 2022 08:43:20 -0600
Organization: A noiseless patient Spider
Lines: 31
Message-ID: <stomq9$rpa$1@dont-email.me>
References: <stm8r9$5co$1@dont-email.me> <stolrh$9k4$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 6 Feb 2022 14:43:22 -0000 (UTC)
Injection-Info: reader02.eternal-september.org; posting-host="18c1063ccfb1605a88f6106a8abd380e";
logging-data="28458"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/rMOx/KojySoAU85Vrl9BE"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.5.1
Cancel-Lock: sha1:qYJPAOPC9pTtnaNZuAKKM7T+pwI=
In-Reply-To: <stolrh$9k4$1@dont-email.me>
Content-Language: en-US
View all headers
On 2/6/2022 8:26 AM, Mikko wrote:
On 2022-02-05 16:32:41 +0000, olcott said:

Halting problem undecidability and infinitely nested simulation (V3)

Linz H is defined as simulating halt decider that bases its halt status decision on whether or not its correct simulation of its input could ever
  ...

What was wrong in V60 ?

Mikko


I keep making my posts increasingly more clear.
I wish that making them clear enough to be understood worked.

I actually have to make them clear enough that any rebuttals look foolish because most of my reviewers don't really give a rats ass for truth they only want to show that I am wrong even if I am not wrong.
This comes from mutual animosity that has been established over the years.

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


Subject: Re: Concise refutation of halting problem proofs V61 [ Linz Proof ]
From: olcott
Newsgroups: comp.theory, comp.ai.philosophy, sci.logic, sci.math
Followup: comp.theory
Date: Mon, 7 Feb 2022 14:55 UTC
References: 1 2 3 4
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: Mon, 07 Feb 2022 08:55:47 -0600
Date: Mon, 7 Feb 2022 08:55:21 -0600
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.5.1
Subject: Re: Concise refutation of halting problem proofs V61 [ Linz Proof ]
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <stm8r9$5co$1@dont-email.me> <stolrh$9k4$1@dont-email.me>
<stomq9$rpa$1@dont-email.me> <stqogj$cga$1@dont-email.me>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <stqogj$cga$1@dont-email.me>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <Q8mdnT4vkqlur5z_nZ2dnUU7-XXNnZ2d@giganews.com>
Lines: 50
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-kgqosVSPIHh0RnVR2Js9BVPizVmHKqBI7w3aTouPFezsLhsN7tqfQyz75LnMaRrtHlVMmmSFT500514!TDFhFdP08JJJlQU12/PRdH9sCMmfsuprFtBec2va3TCu0YTmOW3zox1GQv3rjBC24n+EsIciJrJo
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: 2838
View all headers
On 2/7/2022 3:24 AM, Mikko wrote:
On 2022-02-06 14:43:20 +0000, olcott said:

On 2/6/2022 8:26 AM, Mikko wrote:
What was wrong in V60 ?

I keep making my posts increasingly more clear.
I wish that making them clear enough to be understood worked.

It does not work for those who already read the old version. You should
identify the unclear point and its clarification. Otherwise one just thinks
that the new version means what one thought the old version ment.

Mikko


In other words you are saying that some people are deliberately taking my words to means something besides what my words say because their main goal is to be disagreeable?




This is the gist of my whole proof:

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

Can the correct simulation of ⟨Ĥ⟩ ⟨Ĥ⟩ by embedded_H possibly transition to ⟨Ĥ⟩.qn ?




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
rocksolid light 0.7.2
clearneti2ptor