Liste des Groupes | Revenir à c theory |
Computable functions are the basic objects of study in computability*MORE PRECISE WORDING* (this may take a few more rewrites)
theory. Computable functions are the formalized analogue of the
intuitive notion of algorithms, in the sense that a function is
computable if there exists an algorithm that can do the job of the
function, i.e. given an input of the function domain it can return the
corresponding output. https://en.wikipedia.org/wiki/Computable_function
A computable function that reports on the behavior of its actual
self (or reports on the behavior of its caller) is not allowed.
A decider must halt whereas simulating a pathological input
that would never halt unless aborted can only halt by aborting.
This causes the direct execution of this input after it has been aborted
to have different behavior than the simulated input that cannot possibly
stop running unless aborted.
Since no one here understands that a simulating partial halt decider--
is not even allowed to report on its own behavior or the behavior of its
caller they do not understand that the behavior of the directly executed
machine is irrelevant.
Les messages affichés proviennent d'usenet.