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 ...

Have you seen an awesome talk which is currently missing on this website? Drop me an email at [email protected], send a tweet @matchilling or create a pull request on github.com/matchilling/org-programmingtalks.

programmingtalks.org is free and will always be! However, as maintaining this service costs $$$, we are glad to be sponsored by Jugendstil_IO.