Difference between revisions of "Computability"
From Conservapedia
m (better cat) |
DavidB4-bot (Talk | contribs) m (→top: clean up) |
||
| Line 3: | Line 3: | ||
The definition of computability is largely a consequence of the [[Church-Turing thesis]]. | The definition of computability is largely a consequence of the [[Church-Turing thesis]]. | ||
| − | [[ | + | [[Category:Logic]] |
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
Revision as of 15:03, June 23, 2016
An algorithm is called computable if it can be encoded into a set of instructions, which can be input into an universal Turing machine for processing, and the universal Turing machine eventually halts. How to decide if an arbitrary algorithm is actually computable is called the halting problem. Alan Turing proved that the halting problem itself is uncomputable.
The definition of computability is largely a consequence of the Church-Turing thesis.
