6,068
edits
Changes
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...
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.
[[category:mathematics]]
[[category:mathematics]]