Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login


19 May, 2024: Line wrapping has been changed to be consistent with Usenet standards.
 If you find that it is broken please let me know here

devel / comp.lang.c++ / Creating a termination analyzer that doesn't get fooled

o Creating a termination analyzer that doesn't get fooledolcott

Creating a termination analyzer that doesn't get fooled


  copy mid

  copy link   Newsgroups: comp.lang.c++
From: (olcott)
Newsgroups: comp.lang.c++
Subject: Creating a termination analyzer that doesn't get fooled
Date: Sat, 17 Jun 2023 14:23:21 -0500
Organization: A noiseless patient Spider
Lines: 38
Message-ID: <u6l179$1b8d5$>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 17 Jun 2023 19:23:21 -0000 (UTC)
Injection-Info:; posting-host="8438ab4407f21e2151b3794def68bc89";
logging-data="1417637"; mail-complaints-to=""; posting-account="U2FsdGVkX180UPRFt0qv8P3nXNfUV34w"
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Cancel-Lock: sha1:aJFDQiF2BS4aH6a9mmlieY/H9ow=
Content-Language: en-US
 by: olcott - Sat, 17 Jun 2023 19:23 UTC

sci.logic Daryl McCullough Jun 25, 2004, 6:30:39 PM
You ask someone (we'll call him "Jack") to give a truthful
yes/no answer to the following question:

Will Jack's answer to this question be no?
Jack can't possibly give a correct yes/no answer to the question.

When the halting problem is construed as requiring a correct yes/no
answer to a self-contradictory question it cannot be solved.

My semantic linguist friends understand that the context of the question
must include who the question is posed to otherwise the same
word-for-word question acquires different semantics.

The input D to H is the same as Jack's question posed to Jack, has no
correct answer because within this context the question is

When we ask someone else what Jack's answer will be or we present a
different TM with input D the same word-for-word question (or bytes of
machine description) acquires entirely different semantics and is no
longer self-contradictory.

When we construe the halting problem as determining whether or not an
(a) Input D will halt on its input <or>
(b) Either D will not halt or D has a pathological relationship with H

Then this halting problem cannot be showed to be unsolvable by any of
the conventional halting problem proofs.

The x86utm operating system
(includes several termination analyzers)

Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

devel / comp.lang.c++ / Creating a termination analyzer that doesn't get fooled


rocksolid light 0.9.81
clearnet tor