# Church-Turing Thesis Any [Computation](Computation.md) - that is, any finite sequence of steps applied to some input to produce some output - is equivalent to the operations of some [Turing Machine](Turing%20Machine.md). This means that all of computation - all [Algorithms](Algorithms%20and%20Representation.md) - may be thought of as [Turing Machines](Turing%20Machine.md). So if we make statements about [Turing Machines](Turing%20Machine.md), we can then apply those to all *programs*. Turing then was able to prove the [Halting Problem](Halting%20Problem.md) is not solvable. --- Date: 20241117 Links to: Tags: References: * []()