+The Church-Turing Thesis proposes that any function computable by an [algorithm](/wiki/algorithm) can also be computed by a [Turing Machine](/wiki/turing_machine). This fundamental hypothesis bridges the intuitive idea of effective computation with a precise mathematical model, defining the boundaries of what is mechanically solvable.
+## See also
+- [Computability](/wiki/computability)
+- [Lambda Calculus](/wiki/lambda_calculus)
+- [Undecidability](/wiki/undecidability)