Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: comp.theory
Subject: Re: We finally know exactly how H1(D,D) derives a different result than H(D,D)
Date: Sun, 10 Mar 2024 14:25:37 +0200
Organization: -
Lines: 40
Message-ID: <usk8s1$2v4mk$1@dont-email.me>
References: <usda7b$18hee$1@dont-email.me> <usdf9p$15934$2@i2pn2.org> <usdh1e$19t14$1@dont-email.me> <usdrrd$1bil8$1@dont-email.me> <usdseg$1bqt3$2@dont-email.me> <usdvj7$1fvhm$4@dont-email.me> <use138$15q44$4@i2pn2.org> <use1sh$1gd96$2@dont-email.me> <use37h$15q45$3@i2pn2.org> <use4f1$1grfn$1@dont-email.me> <8634t1nx2p.fsf@yaxley.in> <usfase$1p1t5$1@dont-email.me> <usfd8m$1p8cg$4@dont-email.me> <ush8rt$288t1$1@dont-email.me> <usi0ej$2d0oc$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: dont-email.me; posting-host="358b827b9e20a75857a566c986cf61e9";
	logging-data="3117780"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX195v0iID8zjBBxa4gwdu0gT"
User-Agent: Unison/2.2
Cancel-Lock: sha1:yS42Zb97+6Sl365wDOEe0l6ptZs=
Bytes: 2589

On 2024-03-09 15:49:39 +0000, olcott said:

> On 3/9/2024 3:07 AM, Mikko wrote:
>> On 2024-03-08 16:09:58 +0000, olcott said:
>> 
>>> On 3/8/2024 9:29 AM, Mikko wrote:
>>>> On 2024-03-08 05:23:34 +0000, Yaxley Peaks said:
>>>> 
>>>>> With all of these extra frills, aren't you working outside the premise
>>>>> of the halting problem? Like how Andre pointed out.
>>>> 
>>>> Yes, he is.
>>>> 
>>>>> The halting problem concerns itself with turing machines and what you
>>>>> propose is not a turing machine.
>>>> 
>>>> That is true. However, we can formulate similar problems and proofs
>>>> for other classes of machines.
>>>> 
>>> 
>>> I am working on the computability of the halting problem
>>> (the exact same TMD / input pairs) by a slightly augmented
>>> notion of Turing machines as elaborated below:
>>> 
>>> Olcott machines are entirely comprised of a UTM + TMD and one
>>> extra step that any UTM could perform, append the TMD to the
>>> end of its own tape.
>> 
>> An important question to answer is whether a Turing machine can
>> simulate your machines.
> 
> Olcott machines are entirely comprised of a UTM + TMD and one
> extra step that any UTM could perform, append the TMD to the end
> of its own tape.

Then a Turing machine can simulate your machine.

-- 
Mikko