|Homework (HW)||8 × 30|
|Course project (CP)||4 × 30|
|Midterm exams (ME)||2 × 60|
|Final exam (FE)||120|
[SP17] links point to notes from last year's offering in Spring 2017.
Unless otherwise indicated, each assignment is due on Thursday at 10pm of the week in which it is listed.
|Unit||Week of||Topic||Assignment Due|
|01/16||Introduction and background [slides]|
|02/13||Review and midterm|
|II||02/20||Context free grammars, pushdown automata||HW3|
|02/27||CFG = PDA||HW4|
|III||03/20||Turing machines [slides]||HW5|
|The universal TM and undecidability||HW6|
|04/10||Review and midterm|
|IV||04/17||P and NP||HW7|
Throughout the semester, you will implement some of the ideas you've learned in a series of three text-processing tools.
In Project 1, you'll implement nondeterministic finite automata (NFA). Nondeterminism (essentially, unbounded parallelism) is one of the core concepts in the course, and implementing it will demonstrate how to simulate nondeterminism on deterministic hardware.
In Project 2, you'll write a parser for regular expressions and combine it with NFAs to build a regular expression matcher like grep. Your implementation will be asymptotically much faster than an implementation would be that uses Perl or Python's built-in regular expressions.
In Project 3, you'll use your regular expression engine to implement a fragment of sed. You'll also show how, in principle, any computer program could be compiled into this fragment of sed.
In Project 4, you'll extend your regular expression matcher to handle backreferences. Although this has a large speed penalty, you'll show how this extended matcher can be used to solve the Boolean satisfiability problem.
<regex>) or Python (including all standard libraries except
re). Python is recommended. You can also write in another language with permission from the instructor.
Students are expected to attend all classes. Foreseeable absences should be discussed with the instructor ahead of time.
In the case of a serious illness or other excused absence, as defined by university policies, coursework submissions will be accepted late by the same number of days as the excused absence.
Otherwise, you may submit some problems on time for full credit, and other problems late with a penalty of 10% per day (rounded down to the nearest point). No problem can be submitted more than once.
Any student who has a documented disability and is registered with Disability Services should speak with the professor as soon as possible regarding accommodations. Students who are not registered should contact the Office of Disability Services.
Students in this course are expected to abide by the Academic Code of Honor Pledge: “As a member of the Notre Dame community, I will not participate in or tolerate academic dishonesty.”
The following table summarizes how you may work with other students and use print/online sources:
If an instructor sees behavior that is, in his judgement, academically dishonest, he is required to file either an Honor Code Violation Report or a formal report to the College of Engineering Honesty Committee.
All course materials written by the instructor and published on this website are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License, which prohibits reuse for commercial purposes.
All course materials written by the instructor and distributed privately (including through Sakai) should not be redistributed in any way; doing so is a violation of both US copyright law and the University of Notre Dame Honor Code.
|The Universal Computer: The Road from Leibniz to Turing by Martin Davis. Short biographies of the pioneers of computability theory and their contributions.|
|The Annotated Turing by Charles Petzold. Contains the text of Turing's 1936 paper with detailed and understandable commentary.|
|Logicomix: An Epic Search for Truth by Christos Papadimitriou. Graphic novel about Bertrand Russell. Only tangentially related to this course, but did I mention it's a graphic novel?|
|The Golden Ticket by Lance Fortnow. Popular account of P and NP and the history and future of the question.|