The aim of this course is to reflect on fundamental concepts related to logic and computation (and computability theory in particular) in the context of computer programming. Students will reflect by reading, writing, and presenting their research findings on a weekly basis.|
Students will learn how to answer one or more of the following research questions by means of an actor-based methodology in which each question will be addressed from multiple perspectives.+ What is a program?+ What is a computer?+ What are the practical implications of undecidability?+ What is the distinction between a stored-program computer and a universal Turing machine?+ What is the difference between a model (of computation) and a physical computer? This is a reading &writing course. Attendance is obligatory. Homework will already be handed out during the first week of class with a firm deadline in the second week. Late arrivals in class will only be tolerated once; in other cases, they can lead to a deduction of the student’s final grade. The aim of the course on proofs as programs is to get an understanding of type theory and its role within logic, linguistics, and computer science and get acquainted to the Curry-Howard correspondence, relating types to propositions and programs to proofs. Students History and Philosophy of Science and Artificial Intelligence experiencing problems with enrollment, please contact the Student Desk Humanities, email@example.com|
This course is for Students History and Philosophy of Science, RMA Philosophy and Artificial Intelligents. Students of other MA-programmes, please contact the Course Coordinator.