Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: dbush <dbush.mobile@gmail.com>
Newsgroups: comp.theory
Subject: Re: Turing Machine computable functions apply finite string
 transformations to inputs VERIFIED FACT
Date: Wed, 30 Apr 2025 15:57:53 -0400
Organization: A noiseless patient Spider
Lines: 24
Message-ID: <vutvbv$v5pn$6@dont-email.me>
References: <vu6lnf$39fls$2@dont-email.me>
 <0a2eeee6cb4b6a737f6391c963386745a09c8a01@i2pn2.org>
 <vugvr3$pke9$8@dont-email.me>
 <4818688e0354f32267e3a5f3c60846ae7956bed2@i2pn2.org>
 <vuj18i$2lf64$6@dont-email.me>
 <f0d3f2e87d9a4e0b0f445f60a33d529f41a4fcf7@i2pn2.org>
 <vuj55m$2lf64$10@dont-email.me> <vuj8h3$2uahf$3@dont-email.me>
 <vujfuu$35hcg$1@dont-email.me>
 <65dddfad4c862e6593392eaf27876759b1ed0e69@i2pn2.org>
 <vujlj0$3a526$1@dont-email.me> <vujln7$32om9$8@dont-email.me>
 <vujmmm$3a526$2@dont-email.me> <vujmrj$32om9$9@dont-email.me>
 <vujtcb$3gsgr$1@dont-email.me> <vuju44$3hnda$1@dont-email.me>
 <vuk47o$3qkbb$1@dont-email.me> <vuk6b6$3l184$1@dont-email.me>
 <vuls34$1bf1j$4@dont-email.me> <vun87k$2m24h$2@dont-email.me>
 <vunb06$2fjjl$5@dont-email.me> <vuo57j$3h5l9$2@dont-email.me>
 <vuoath$3ljma$1@dont-email.me> <vuohgi$3td7u$1@dont-email.me>
 <vuonh6$2g74$2@dont-email.me> <vupeor$qf60$1@dont-email.me>
 <ab48c34e4d8c04dadc62a6c70f0ef48e1a8bbaba@i2pn2.org>
 <vutn6k$nvbg$4@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 30 Apr 2025 21:57:52 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="36c3ab966607e6b458aa2826fcd1def6";
	logging-data="1021751"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18H9CYAHH8ZC5wgWiFux1Tf"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:KuUT0uwhV2ueO0Go638gHa2VENU=
In-Reply-To: <vutn6k$nvbg$4@dont-email.me>
Content-Language: en-US
Bytes: 3059

On 4/30/2025 1:38 PM, olcott wrote:
> On 4/29/2025 5:00 AM, joes wrote:
>> Am Mon, 28 Apr 2025 21:50:03 -0500 schrieb olcott:
>>> On 4/28/2025 3:13 PM, Richard Heathfield wrote:
>>
>>>> What matters is whether a TM can be constructed that can accept an
>>>> arbitrary TM tape P and an arbitrary input tape D and correctly
>>>> calculate whether, given D as input, P would halt. Turing proved that
>>>> such a TM cannot be constructed.
>>>> This is what we call the Halting Problem.
>>>>
>>> Yet it is H(P,D) and NOT P(D) that must be measured. Computer science
>>> has been wrong about this all of these years. When I provide the 100%
>>> concrete example of the x86 language there is zero vagueness to slip
>>> through the cracks of understanding.
> 
>> No, H gets P(D) as input, not itself. H is the "measurer", not being
>> measured.
>>
> 
> H NEVER gets P(D) as input.
> H always gets finite strings P and D as inputs.

Which is stipulated to be a complete description of algorithm P with input D