Philip Wadler: Church's Coincidences

Philip Wadler, Professor of Theoretical Computer Science at the University of Edinburgh, contends that the foundations of computing lay in a coincidence: Church's lambda calculus (1933), Herbrand and Godel's recursive functions (1934), and Turing's machines (1935) all defined the same model of computation. He gave this lecture on the occasion of Princeton University's centennial celebration of Alan Turing. Learn more at www.princeton.edu/turing #turingprinceton

Related Talks

Lambda Calculus Then and Now

Talk by ACM A.M. Turing Laureate Dana S. Scott during the ACM A.M. Turing Centenary Celebration, June, 2012. Abstract: A very fast development in the early 1930s, following Hilbert's codification of Mathematical Logic, led to the Incompleteness Theorems, Computable Functions, Undecidability Theorems, and the general formulation of recursive Function Theory. The so-called ...

Parsing with Derivatives

(February 9, 2011) Matthew Might focuses on a new way to write parsers and how it will affect computer science in the future. Might discusses these parsers and overall language theory, to help explain how there is demand for better parsing tools and how computer science will be improved in ...

Elixir Conf 2014 - Keynote: Elixir by Jose Valim

Help us caption & translate this video! http://amara.org/v/FGYe/ ...

John Myles White on Fundamental Concepts in Programming Languages

Meetup: http://www.meetup.com/papers-we-love/events/220902753/ Paper: http://www.cs.cmu.edu/~crary/819-f09/Strachey67.pdf Slides: http://bit.ly/1BnBb08 Audio: http://bit.ly/1HAdXci --------------------------------------------------------------------------------------------- Sponsored by Two Sigma (@twosigma) and The Ladders (@TheLaddersDev) --------------------------------------------------------------------------------------------- Description --------------- Strachey's lectures on "Fundamental Concepts in Programming Languages" provided an extremely broad survey of core issues in programming language design that provided much of the terminology we use today, including definitions of the kinds of polymorphism and the ...

Barbara Liskov: Programming the Turing Machine

Barbara Liskov, Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, discusses "Programming the Turing Machine" in a lecture given on the occasion of Princeton University's centennial celebration of Alan Turing. Learn more at www.princeton.edu/turing #turingprinceton ...

Andrew Odlyzko: Turing and the Riemann zeta function

Andrew Odlyzko, Professor of Mathematics at the University of Minnesota, discusses "Turing and the Riemann zeta function" in a lecture given on the occasion of Princeton University's centennial celebration of Alan Turing. Learn more at www.princeton.edu/turing #turingprinceton ...