Page "Church–Turing thesis" Paragraph 25

Turing adds another definition, Rosser equates all three: Within just a short time, Turing's 1936 – 37 paper " On Computable Numbers, with an Application to the Entscheidungsproblem " appeared.

In it he stated another notion of " effective computability " with the introduction of his a-machines ( now known as the Turing machine abstract computational model ).

And in a proof-sketch added as an " Appendix " to his 1936 – 37 paper, Turing showed that the classes of functions defined by λ-calculus and Turing machines coincided.