Re: Turing computable functions

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.
--
Mikko