Difference between revisions of "Computability"
Jump to navigation
Jump to search
m (New page: 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 Tu...) |
(No difference)
|
Revision as of 12:11, April 6, 2007
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.