[earleybird]

Turing was working on his Phd[0] and went to Princeton where Church was. Turing recognized that Church's lambda calculus answered the question of what it means to compute (effectively calculable). I think it was Phil Wadler that noted that at this point Turing pivoted his thesis to show equivalence to the lambda calculus.

I find it interesting that Gentzen was not convinced by Church's assertion that the lambda calculus demonstrated effectively calculable functions; however when Gentzen saw that Turning explanation he was finally convinced.

Based on this I'd say that computing has 3 fathers, alternately, a holy trinity :-)

[0] https://www.dcc.fc.up.pt/~acm/turing-phd.pdf

[groby_b]

TIL that Turing used LaTeX ;) OK, fine, somebody probably typeset it, but it was still an odd experience to read it that way.

Either way, thanks for sharing that link!