+A computable function is one for which an [algorithm](/wiki/algorithm) exists, allowing its output to be precisely determined through a finite sequence of mechanical steps. This concept defines the scope of what can be calculated by a theoretical device such as a [Turing machine](/wiki/Turing_machine).
+## See also
+- [Computability](/wiki/computability)
+- [Halting Problem](/wiki/halting_problem)
+- [Recursion](/wiki/recursion)
... 1 more lines