Turing projectability (Q1102947): Difference between revisions

A number-theoretic function f is called ``Turing projectable'' if there is a Turing computable function g such that for each fixed n, g(n,m) is constant for sufficiently large m, and \(f(n)=\lim_{m\to \infty}g(n,m)\). Some elementary recursion-theoretic properties of this notion are derived, for example that the Turing projectable functions are exactly those recursive in the halting problem. Some of the properties considered are loosely connected to ``inductive logic'', where the problem of guessing an infinite sequence (or its law) from a finite initial segment arises.