A computable function is one for which an 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.