COURSE START: Tuesday study week 1, , room EB, 4th floor, EDIT-building, Johanneberg. Important: Frequently do "refresh", to avoid watching a cached page, since this web-page is updated during the course.
COURSE-PM 7,5 Hgskolepong Grades: U (failed), 3, 4, 5 Educational Level: Advanced Institution: 37 - DATA- OCH INFORMATIONSTEKNIK Teaching language: English Course Plan Teacher and Examiner: Erik Sintorn phone: 21 email: (erik dot sintorn at chalmers dot se) office: room 4118, floor 4, the corridor along Rnnvgen, EDIT-huset Course assistants: Sverker Rasmuson, Dan Dolonius Course Description The compulsory introductory course TDA362/DIT223 Computer Graphics was highly theoretically intensive, giving a brief introduction to a vast amount of topics within computer graphics.
For higher grades, the student shall implement and present a more advanced graphics-related project (see below).
Description: This paper discusses the various arguments on why a machine can not be intelligent and asserts that none of those arguments are convincing.
Specifically, this paper introduced the winnow algorithm.
Description: LR parser, which does bottom up parsing for deterministic context-free languages.Description: The IBM System/360 (S/360) is a mainframe computer system family announced by IBM on April 7, 1964.It was the first family of computers making a clear distinction between architecture and implementation.The paper also suggested the Turing test, which it calls "The Imitation Game" as according to Turing it is pointless to ask whether or not a machine can think intelligently, and checking if it can act intelligently is sufficient.Description: This summer research proposal inaugurated and defined the field.Research in this area is remarkable because (1) the algorithms and proofs tend to be very simple and beautiful, and (2) the model makes no statistical assumptions about the data.In other words, the data need not be random (as in nearly all other learning models), but can be chosen arbitrarily by "nature" or even an adversary.A procedure is given which determines all the definitions which can possibly reach each node of the control flow graph of the program and all the definitions that are live on each edge of the graph." Description: Formalized the concept of data-flow analysis as fixpoint computation over lattices, and showed that most static analyses used for program optimization can be uniformly expressed within this framework.Description: The Colossus machines were early computing devices used by British codebreakers to break German messages encrypted with the Lorenz Cipher during World War II.There is an 80% compulsory attendance to the seminars.To pass the course, each student shall have presented one paper, have prepared questions for three other papers, and achieve a passing grade on the individual project.