Alonzo Church had introduced the λ-calculus and Emil Leon Post introduced his combinatory process, both in 1936, the same year as Turing’s paper. Stephen Cole Kleene, also in 1936, extended the class of primitive recursive functions by recognizing that what was missing was the idea of unbounded search.
