Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: "Fred. Zwarts" <F.Zwarts@HetNet.nl>
Newsgroups: comp.theory
Subject: Re: Turing computable functions
Date: Wed, 26 Mar 2025 10:05:40 +0100
Organization: A noiseless patient Spider
Lines: 15
Message-ID: <vs0g14$1ckla$2@dont-email.me>
References: <vruvsn$3tamc$3@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Wed, 26 Mar 2025 10:05:41 +0100 (CET)
Injection-Info: dont-email.me; posting-host="f6a5cf00636726f8011e12af665f7e80";
	logging-data="1462954"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18r8dKxPkOhMVn8V87lmS1G"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:hXgGAqUpiBoMEjiAHkJ5p0FKhYM=
Content-Language: nl, en-GB
In-Reply-To: <vruvsn$3tamc$3@dont-email.me>
Bytes: 1605

Op 25.mrt.2025 om 20:24 schreef olcott:
> Cannot possibly derive any outputs not computed from
> their inputs.
> 
> A Turing machine halt decider cannot possibly report
> on the behavior of any directly executing process.
> No Turing machine can every do this. This has always
> been beyond what any Turing machine can ever do.
> 
So if we ask the question:
'Is there an algorithm that can determine for all possible inputs 
whether the input specifies a program that (according to the semantics 
of the machine language) halts when directly executed?'
We agree that the answer is 'no'.
Correct?