Sujet : Re: Turing computable functions
De : F.Zwarts (at) *nospam* HetNet.nl (Fred. Zwarts)
Groupes : comp.theoryDate : 27. Mar 2025, 11:33:34
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vs39ht$1ogp$1@dont-email.me>
References : 1 2 3
User-Agent : Mozilla Thunderbird
Op 26.mrt.2025 om 17:25 schreef olcott:
On 3/26/2025 2:44 AM, Mikko wrote:
On 2025-03-25 19:24:07 +0000, olcott said:
>
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.
>
It can if that report is a computable function of their inputs.
For example, whether the direct execution of another Turing machine
is longer than 2 steps is Turing computable.
>
When an input to a simulating termination analyzer
defines a pathological relationship to its simulating
termination analyzer this changes the behavior of this
input relative to its direct execution.
If an analyser has a pathological relation with this input, it is wrong to choose this analyser for this input. In particular when there are analysers that do not have this relationship with this input.
Turing computable functions
Re: Turing computable functions