Re: Turing computable functions

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.
Simulating termination analyzers only report on the
behavior that their input specifies.
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.
Simulating termination analyzers only report on the
behavior that their input specifies.
HOW MANY TIMES DO I HAVE TO REPEAT THIS BEFORE
YOU NOTICE THAT I SAID IT AT LEAST ONCE?
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer