Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory,sci.logic
Subject: =?UTF-8?Q?Re=3A_A_simulating_halt_decider_applied_to_the_The_Peter_?=
 =?UTF-8?Q?Linz_Turing_Machine_description_=E2=9F=A8=C4=A4=E2=9F=A9?=
Date: Mon, 27 May 2024 20:39:39 -0500
Organization: A noiseless patient Spider
Lines: 41
Message-ID: <v33ckr$dg88$1@dont-email.me>
References: <v2nsvh$1rd65$2@dont-email.me> <v2vrcl$3gakv$1@dont-email.me>
 <v2vslp$26570$6@i2pn2.org> <v301m6$3hcgb$1@dont-email.me>
 <v305j9$26571$1@i2pn2.org> <v30e5l$3lerc$1@dont-email.me>
 <v30fbr$26570$9@i2pn2.org> <v30hiq$3lv80$1@dont-email.me>
 <v30jb5$26571$2@i2pn2.org> <v30pr8$3r67p$1@dont-email.me>
 <v30rvv$3riij$1@dont-email.me> <v30t8u$26571$6@i2pn2.org>
 <v30u04$3rour$1@dont-email.me> <v30upc$26571$7@i2pn2.org>
 <v30vp3$3s4od$1@dont-email.me> <v321o0$28n58$1@i2pn2.org>
 <v3255k$2pkb$2@dont-email.me> <v326fd$28n59$2@i2pn2.org>
 <v327h8$3a17$1@dont-email.me> <v328l1$28n58$2@i2pn2.org>
 <v329t8$3mh0$2@dont-email.me> <v32ait$28n58$4@i2pn2.org>
 <v32bvc$48pj$1@dont-email.me> <v32cko$2937i$1@i2pn2.org>
 <v32nsa$6fo3$1@dont-email.me> <v32tfs$29dee$1@i2pn2.org>
 <v331mf$84p2$1@dont-email.me> <v332ci$29def$2@i2pn2.org>
 <v33790$8u5p$1@dont-email.me> <v337r0$29dee$2@i2pn2.org>
 <v338c5$94g8$1@dont-email.me> <v339kr$29dee$3@i2pn2.org>
 <v33aj7$9f3u$1@dont-email.me> <v33bo5$29def$4@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 28 May 2024 03:39:40 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="62ab2bf33c274f123184493b42753dfc";
	logging-data="442632"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18zjhVgs5zz2KE3qjlMZztK"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:o2qZhEWCKoUWsqpguo4jFMgb1AM=
In-Reply-To: <v33bo5$29def$4@i2pn2.org>
Content-Language: en-US
Bytes: 3472

On 5/27/2024 8:24 PM, Richard Damon wrote:
> On 5/27/24 9:04 PM, olcott wrote:

>>>> I totally do. Can you please write down the
>>>> "completely specified state transition/tape operation table."
>>>> of this specific (thus uniquely identifiable) machine I would
>>>> really like to see it.
>>>>
>>>
>>> But it was proven that no such machine exists!
>>>
>>> Remember, the proof starts with the hypothetical that such a machine 
>>> exists. Such a machine WOULD HAVE a completely specified state 
>>> transition/tape operation table.
>>>
>>
>> That is not what you said.
>>  >>>>> There doesn't need to be a unique finite string, but it is a 100%
>>  >>>>> completely specified state transition/tape operation table.
>>
>> "a 100% completely specified state transition/tape operation table"
>> of a non-existent machine.
> 
> Right, by presuming that you have a Turing Machine, you have a completly 
> specified state transition/tape operation table.
> 
> You may not KNOW what that table is if you don't know what the exact 
> machine is, but you know it exists.
> 
> 

 >>> But it was proven that no such machine exists!

If you can't notice that you are contradicting yourself
it seems that no further progress can be made with you.


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