Computable Functions

Computable functions can be defined as idealized symbol manipulation machines that obey the laws of physics. Examples of such machines include random access machines and Turing machines. Describing processes in terms of these machines removes ambiguity. Not all functions are computable!