In the theory of computation, the Church-Turing thesis is an equivalence between our intuitive idea of what algorithms are (defined with lambda calculus), and Turing machine algorithms. In other words, we can express any algorithm with a Turing machine algorithm. If a problem cannot be solved (i.e., decided) by a Turing machine, it too cannot be solved by a conventional algorithm.