In 1936, to define what method should be used to prove the axioms Hilbert’s Program, two mathematicians Alan Turing and Alonzo Church both defined the decidability of a problem and computability. The thesis is so called because Alan Turing and Alonzo Church both, independently, developed formalisms for defining what constitutes an algorithm. The two formalisms are equivalent.
Alan Turing’s Turing Machine
Turing stated that any function can be run on a Turing Machine is considered computable.
Alonzo Church’s Lambda Calculus
Alonzo Church created lambda calculus as a way to define functions. In it, a function is first defined, and it’s arguments are put after it. Don’t need to cover on it too much (I think). #TOSEE