On 2024-05-12 19:27:01 +0000, olcott said:
Computable functions are the basic objects of study in computability
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.
There is no prohibition against such functions. In certain sense every
function reports about its own behaviour. For example, the function
cos, when ginven the argument π/3, answers the question "What value
does the function cos return when given the argument π/3?".
--
Mikko
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)