(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 the future.
Stanford University:
http://www.stanford.edu/
School of Engineering:
http://soe.stanford.edu/
Stanford Center for Professional Development:
http://scpd.stanford.edu/
Stanford University Channel on YouTube:
http://www.youtube.com/stanford
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 ...
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 ...
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 ...