Re: Turing computable functions

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?