Definition
Turing-Computable Arithmetic Function
An arithmetic function
is called Turing-computable if there exists a Turing machine with (see Turing machine). According to Church-Turing thesis, computability is equivalent to Turing-compatibility.
Turing-Computable Arithmetic Function
An arithmetic function
is called Turing-computable if there exists a Turing machine with (see Turing machine). According to Church-Turing thesis, computability is equivalent to Turing-compatibility.