Computability
This is an old revision of this page, as edited by Jaques (talk | contribs) at 12:11, April 6, 2007. It may differ significantly from current revision.
An algorithm is called computable if it can be encoded into a set of instructions, which can be inputed into a Universal Turing machine for processing, and the Universal Turing machine eventually halts.