Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory,sci.logic
Subject: Re: D correctly simulated by H cannot possibly halt --- templates and
 infinite sets
Date: Thu, 30 May 2024 07:32:40 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <v39o4o$2h667$2@i2pn2.org>
References: <v3501h$lpnh$1@dont-email.me> <v362eu$2d367$3@i2pn2.org>
 <v363js$vg63$2@dont-email.me> <v36803$2d368$3@i2pn2.org>
 <v368je$100kd$3@dont-email.me> <v36rlr$13000$1@dont-email.me>
 <v37aa6$159q4$4@dont-email.me> <v38eqb$2foi0$5@i2pn2.org>
 <v38fl6$1bndb$2@dont-email.me> <v38g36$2foi0$12@i2pn2.org>
 <v38gpi$1bndb$4@dont-email.me> <v38ibi$2fohv$1@i2pn2.org>
 <v38ilr$1c8ir$1@dont-email.me> <v38j78$2foi0$13@i2pn2.org>
 <v38jqc$1c8ir$3@dont-email.me> <v38khd$2foi0$16@i2pn2.org>
 <v38mb0$1ggjs$2@dont-email.me> <v38o1v$2fohv$4@i2pn2.org>
 <v38on0$1grj4$2@dont-email.me> <v38pqr$2fohv$5@i2pn2.org>
 <v38suu$1hf5c$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 30 May 2024 11:32:40 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2660551"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <v38suu$1hf5c$1@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 4518
Lines: 100

On 5/29/24 11:48 PM, olcott wrote:
> On 5/29/2024 9:55 PM, Richard Damon wrote:
>> On 5/29/24 10:36 PM, olcott wrote:
>>> On 5/29/2024 9:25 PM, Richard Damon wrote:
>>>> On 5/29/24 9:55 PM, olcott wrote:
>>>>> When the category is examined all at once then there is no need
>>>>> to look at each individual element.
>>>>
>>>> So, which one or ones gave the correct answer for their input?
>>>>
>>>
>>> *Formalizing the Linz Proof structure*
>>> ∃H  ∈ Turing_Machines
>>> ∀x  ∈ *Turing_Machines_Descriptions*
>>> ∀y  ∈ Finite_Strings
>>> such that H(x,y) = Halts(x,y)
>>>
>>> When we formalize it that way then some simulating halt deciders
>>> get the correct answer.
>>>
>>> *Everyone else implicitly assumes this incorrect formalization*
>>> ∃H  ∈ Turing_Machines
>>> ∀x  ∈ *Turing_Machines*
>>> ∀y  ∈ Finite_Strings
>>> such that H(x,y) = Halts(x,y)
>>>
>>>
>>
>> Nope.
>>
>> You just don't understand the meaning of a "Description" in the problem.
>>
> 
> I have an OCD/Aspergers degree of single-minded focus.
> 20 years ago I tested 50% above normal on the Aspergers test.
> Because I have focused this concentration of having empathy
> I now score 50% below normal on Asperger tests.

Which explains, but not excuses you awful behavior.


> 
> The issue is that everyone else has not paid close enough
> attention to what a decider does.

No, YOU haven't paid close enough attention to what a "foo" decideer is 
supposed ot do. Your H may be a correct decider (but I suspect we can 
find inputs it doesn't always halt on) but it isn't a *HALT* decider as 
its answer doesn't match the Halts

I guess you are aadmitting to a mental deficency that just makes it 
impossible to understand the truth, that also gives you a social 
deficency to be unable to communicate this properly to others.

That doesn't excuse your behavior.

Question, is this the source of your mental incompetancy to stand trial 
on the kiddie porn charges?

Have they decided that you are just an annoyance to society, but not am 
actual threat so you don't need to be locked up?

> 
> *A deciders compute the mapping*
> 
> FROM ITS INPUTS
> FROM ITS INPUTS
> FROM ITS INPUTS
> FROM ITS INPUTS
> FROM ITS INPUTS

And *THE* mapping it is trying to compute is the funcitons Halts(x, y)

Which CAN'T very based on H, as it doesn't take H as an input


> 
> *to it own accept or reject state*
> 
> *Deciders cannot take*
> 
> ACTUAL TURING MACHINES AS INPUTS
> ACTUAL TURING MACHINES AS INPUTS
> ACTUAL TURING MACHINES AS INPUTS
> ACTUAL TURING MACHINES AS INPUTS
> ACTUAL TURING MACHINES AS INPUTS

But CAN take a complete description of one.

> 
> *Deciders can only take*
> 
> FINITE STRINGS AS INPUTS
> FINITE STRINGS AS INPUTS
> FINITE STRINGS AS INPUTS
> FINITE STRINGS AS INPUTS
> FINITE STRINGS AS INPUTS
> 
> 

Which a complete description of a Turing Machine is.