Lectures on the Philosophy of Mathematics

by Joel David Hamkins

A partial function f… ℕ → ℕ is Turing computable if there is a Turing-machine program that can compute the function according to the procedure we have described.