Models of computation
Pavel Panchekha
Tue Jan 25, Thu Jan 27, 07-09:00pm, 4-237
No enrollment limit, no advance sign up
Participants requested to attend all sessions (non-series)
Prereq: None
Everyone knows that the greatest programming language in the world is Haskell. Except of course that it is actually Lisp, and also Prolog, though of course it it Java. Computer Science has a long history of LtU-esque language debates, going back all the way to its inception in the 1930s. This class will cover early models of computation: Turing machines, lambda calculus, and combinators. Just like modern language debates, no one wins, and so we'll cover the equivalence of all of these forms. Some discussion of the influence on modern languages of each of these paradigms will be included.
Web: http://sipb.mit.edu/iap/models
Contact: sipb-iap-models@mit.ed
Sponsor: Student Information Processing Board
Latest update: 21-Jan-2011
|
|
