Deutsch   English   Français   Italiano  
<vurjap$2gjif$4@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Richard Heathfield <rjh@cpax.org.uk>
Newsgroups: comp.theory
Subject: Re: Turing Machine computable functions apply finite string
 transformations to inputs VERIFIED FACT
Date: Tue, 29 Apr 2025 23:20:09 +0100
Organization: Fix this later
Lines: 80
Message-ID: <vurjap$2gjif$4@dont-email.me>
References: <vu6lnf$39fls$2@dont-email.me> <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>
 <vupu0r$18vrc$1@dont-email.me> <vuqj5u$1rljg$1@dont-email.me>
 <vuqrgb$23cfh$1@dont-email.me> <vuravu$2hkih$2@dont-email.me>
 <vurcf9$2gjie$1@dont-email.me> <vurh7j$2n355$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 30 Apr 2025 00:20:10 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="37e133e97ee7719e4a93228f44d9117b";
	logging-data="2641487"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18XGNWGiDz/n09jfaJwywtCm0zEQ+jdRE1K/s54GE9yLg=="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:+twR+ay1hPNnpe1pEk/XuYRGd/A=
In-Reply-To: <vurh7j$2n355$2@dont-email.me>
Content-Language: en-GB
Bytes: 4451

On 29/04/2025 22:44, olcott wrote:
> On 4/29/2025 3:23 PM, Richard Heathfield wrote:
>> On 29/04/2025 20:57, olcott wrote:
>>> On 4/29/2025 10:33 AM, Fred. Zwarts wrote:
>>
>> <snip>
>>
>>>> makes it impossible for H to see the behaviour of P(D).
>>>> The behaviour of P(D) does not change, but H does not see it.
>>>
>>> H MUST REPORT ON THE BEHAVIOR THAT IT DOES SEE
>>
>> H has the whole P tape and the whole D tape at its disposal. 
>> There is nothing it can't inspect.
>>
> 
> int DD()
> {
>    int Halt_Status = HHH(DD);
>    if (Halt_Status)
>      HERE: goto HERE;
>    return Halt_Status;
> }
> 
> When P has a pathological relationship
> to H, the input to H(P,D) DOES NOT HALT.

Presumably you mean that the Turing machine on tape P, given tape 
D as input, doesn't halt.

But if that's true, then we can construct a pathological meta-P, 
so to speak, and arrange it so that it /does/ halt. When we feed 
/that/ to your HHH, it will now give the wrong answer.

>> Not being able to see how P behaves in simulation is no excuse 
>> for getting the answer wrong. 
> 
> THEN...
> I am thinking of the sum of two integers
> not telling you what these integers are
> is no excuse for you not providing their correct sum.

Absolutely.

 From my perspective, with the information I have available, I 
must fail to complete the task, because the answer is incomputable.

Similarly, we cannot write an H that, given arbitrary P and D, 
always correctly reports on whether feeding D to P would result 
in P halting. It can't be done. It's incomputable. That's the 
whole point!

The parallel is not /quite/ perfect, though, because H can see 
the tapes (P and D), and can examine them in their entirety.

Unfortunately, this isn't enough. We still can't guarantee to 
deduce whether P(D) would halt.

>> If because of limitations in H it fails to spot behaviour that 
>> would have changed its report on P(D), that just means that H 
>> is broken.
>>
>> But don't bother trying to fix it. Turing has already proved 
>> that you can't.
>>
> 
> You are simply not bothering to pay complete attention.

I'm ignoring most of your nonsense, if that's what you mean.

What you're ignoring is mathematical rigour.



-- 
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within