6,068
edits
Changes
Jump to navigation
Jump to search
mLine 1:
Line 1: + +
no edit summary
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.
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.
The definition of computability is largely a consequence of the [[Church-Turing thesis]].
[[category:mathematics]]
[[category:mathematics]]