Re: D simulated by H cannot possibly reach its own simulated final halt state

From	olcott <polcott333@gmail.com>
Newsgroups	comp.theory, sci.logic, comp.ai.philosophy, sci.math
Subject	Re: D simulated by H cannot possibly reach its own simulated final halt state
Date	2025-11-17 07:34 -0600
Organization	A noiseless patient Spider
Message-ID	<10ff8a1$sc5b$1@dont-email.me> (permalink)
References	(15 earlier) <10f6sfs$2o92q$1@dont-email.me> <10f7gtn$2tpfv$1@dont-email.me> <10fcr85$2nun$2@dont-email.me> <10fctbf$8n9b$2@dont-email.me> <10fencv$nign$1@dont-email.me>

Cross-posted to 4 groups.

Show all headers | View raw

On 11/17/2025 2:46 AM, Mikko wrote:
> On 2025-11-16 16:15:43 +0000, olcott said:
> 
>> On 11/16/2025 9:39 AM, joes wrote:
>>> Am Fri, 14 Nov 2025 09:12:55 -0600 schrieb olcott:
>>>
>>>> The Program under test and test program are separate.
>>>
>>> D includes H.
>>>
>>
>> The question is not:
>> Can H reach its own final halt state?
>> The question is:
>> Can D simulated by H reach its simulated final halt state?
> 
> If the question H is designed to answer is either one the
> H is not a halt decider. The question a halt decider would
> answer is:
> Does D halt if fully executed?
> 

Turing machine deciders only compute a mapping from
their [finite string] inputs to an accept or reject
state on the basis that this [finite string] input
specifies or fails to specify a semantic or syntactic
property.

That the information that HHH is required to report
on simply is not contained in its input is what makes
the requirements wrong.

-- 
Copyright 2025 Olcott

My 28 year goal has been to make
"true on the basis of meaning" computable.

Back to sci.math | Previous | Next | Find similar | Unroll thread

Thread

Re: D simulated by H cannot possibly reach its own simulated final halt state olcott <polcott333@gmail.com> - 2025-11-17 07:34 -0600

csiph-web