> For the complete documentation index, see [llms.txt](https://mandober.gitbook.io/math-debrief/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mandober.gitbook.io/math-debrief/600-toc/630-computability-theory/_papers-on-computability.md).

# Effective Computability

• Alonzo Church: `Lambda calculus`. *An unsolvable problem of elementary number theory*. Bulletin the American Mathematical Society, May 1935

• Stephen C. Kleene: `Recursive functions`. *General recursive functions of natural numbers*. Bulletin the American Mathematical Society, July 1935

• Alan M. Turing: `Turing machines`. *On computable numbers, with an application to the Entscheidungsproblem*. Proceedings of the London Mathematical Society, received 25 May 1936

• Emil L. Post: `Finite combinatory processes`. *Finite combinatory processes - Formulation 1*. Bulletin the American Mathematical Society, Nov 1936