 One example of such a function is the halting function h. \(h(n) = 1\) if the nth (standard) Turing machine halts, and \(h(n) = 0\) if the nth (standard) Turing machine runs on endlessly. It is well known that no standard Turing machine can generate this function (Davis 1958); but an ATM can produce any of the function’s values in a finite period of time.