Sujet : Re: Turing computable functions
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 28. Mar 2025, 12:33:23
Autres entêtes
Organisation : -
Message-ID : <vs61e3$2l7it$1@dont-email.me>
References : 1 2 3 4 5
User-Agent : Unison/2.2
On 2025-03-27 17:44:11 +0000, olcott said:
On 3/27/2025 5:12 AM, Mikko wrote:
On 2025-03-26 16:25:49 +0000, olcott said:
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.
Irrelevant to the fact that it is Turing computable whether the direct
exectuion of a Turing machine is longer that two steps.
That would be a syntactic rather than semantic property
of the input thus off topic for these posts.
The subject line says that the topic is Turing computable functions.
What I wrote is about Turing computable functions and is a relevant
comment to the posting it was a reply to. Therefore it was on-topic.
-- Mikko
Turing computable functions
Re: Turing computable functions