Church-Turing thesis facts for kids
The Church-Turing thesis (also known as Church's thesis, Church's conjecture and Turing's thesis) is a statement about computers. It says that a very simple kind of computer now named a “Turing machine” is able to compute all computable functions. The Church-Turing thesis is linked to Gödel's incompleteness theorems. When a programming language is able to do what a Turing machine can do, that language is called Turing complete. If a problem is solvable in one such language then it is solvable in all of those.
See also
In Spanish: Tesis de Church-Turing para niños
National Hispanic Heritage Month on Kiddle
Hispanic athletes in American sports
 | Alex Rodriguez |
 | Manny Ramirez |
 | Mark Aguirre |
 | Carmelo Anthony |
All content from Kiddle encyclopedia articles (including the article images and facts) can be freely used under Attribution-ShareAlike license, unless stated otherwise. Cite this article:
Church-Turing thesis Facts for Kids. Kiddle Encyclopedia.