CSE 105 - Theory of Computation, Spring 2019


Welcome to CSE 105! This course will help you answer fundamental questions about computing: In this course, we will explore what it means to be "computable". We begin with a very simple model of computation, and work our way to the most powerful, the Turing machine, named after Alan Turing, who formalized the notion of "algorithm" in this last model even before there were any physical computers. You'll also learn about the relationship of these models to some essential tools in a computer scientist's toolkit, such as regular expressions and context-free grammars. Finally, you'll develop your technical communication skills in writing formal arguments and proofs.


Mid-quarter feedback form: click here

Review quizzes:

Homework:

Instructors

RoleNameEmailOffice hours
ProfessorShachar Lovettslovett@ucsd.eduW 10am-noon, room 4234
TAKaave Hosseiniskhossei@ucsd.eduTh 5-7pm, room 4217
TAVenkatesh Kumarvrkumar@ucsd.eduTh 10am-noon, room B240A
TASai Kishan Pampanaspampana@ucsd.eduF 5-6pm, room B260A; and 6-7pm, room B250A
TASudarshan Shyamsushyam@ucsd.eduTu 8-10am, room B270A
TAIgors Stepanovsistepano@ucsd.eduMon 6:30-8:30pm, room 4217
TARitwik Vatsyayanrvatsyay@ucsd.eduF noon-1pm and 4-5pm, room B270A
TAZiying Xuezixue@ucsd.eduTu 9-10am, room B260A; and 3-4pm, room B240A
TAJiapeng Zhangjiz173@ucsd.eduF 10-11am and 3-4pm, room B270A

Class times

TypeDayTimeLocation
LectureMW5-6:20pm Galbraith Hall 242
Discussion A01M11-11:50amPepper Canyon Hall 122
Discussion A02M12-12:50pmPepper Canyon Hall 122
Discussion A03T5-5:50pmPepper Canyon Hall 122
Discussion A04W11-11:50amPepper Canyon Hall 122

Textbook

Michael Sipser, Introduction to the Theory of Computation, 3rd ed.
We will use the international edition, which is much more affordable. It is available on Amazon for about $19, or the bookstore for $17.50.
See also the errata for a list of known typos/errors in the book.

Grading

The final grade will be composed as follows: A passing grade in the final exam (at least 50%) is required to pass the class. Letter grades will be assigned as follows: The designation of +/- inside a grade range is based on the instructor discretion. It will depend on the grade distribution as well as your particiaption in class and discussion, coming to office hours, and improvement throughout the class.

Homework

Homework is 20% of the final grade. There will be 7 homeworks, your lowest grade will be dropped. Homework is due on Mondays 11pm, except for weeks with midterms. Submission is online via Gradescope (you should already be enrolled; if not, enroll using your @ucsd.edu email and the code MYRWVG).
Instructions:

Participation

Participation is 10% of the total grade. For full participation grade, you need to collect 20 participation points. There are several ways in which you can get particiaption points:

i-Clicker

Please register your i-Clicker here. Please use the following options when registering: (1) iClicker classic (2) My institution does not use an LMS. If you are asked to pay a fee when registering, please use instead this form, and we will update your information manually.

Discussion forums

We use Piazza for discussion forums: any questions that you have on the material, and finding other students for group study and homework.

Podcast

You can access all previous classes through podcast.

Schedule

NOTE: Subject to change throughout the quarter
Date Subject Chapter Slides HW
04/01/2019 Logistics, introduction to automata Sipser 0, 1.1 slides
04/03/2019 Formal definition of Deterministic Finite Automata (DFA) Sipser 1.1 slides
04/08/2019 Regular languages, closure under: complementation, union Sipser 1.1,1.2 slides HW1 due
04/10/2019 Formal definition of Nondeterministic Finite Automata (NFA) Sipser 1.1,1.2 slides
04/15/2019 Equivalence of DFAs and NFAs Sipser 1.2,1.3 slides HW2 due
04/17/2019 Equivalence of DFAs and regular expressions Sipser 1.2,1.3 slides
04/22/2019 Limits of regular languages: the pumping lemma Sipser 1.4 slides HW3 due
04/24/2019 More examples of pumping lemma, intro to Context Free Grammar (CFG) Sipser 1.4, 2.1 slides
04/29/2019 Midterm 1 (in class)
05/01/2019 Context Free Grammar (CFG), Push Down Automata (PDA) Sipser 2.1, 2.2 slides
05/06/2019 More on Push Down Automata (PDA) Sipser 2.2, 2.3 slides HW4 due
05/08/2019 Introduction to Turing machines (TM) Sipser 3.1 slides
05/13/2019 Turing machines: more examples and equivalent models Sipser 3.1,3.2 slides HW5 due
05/15/2019 More on models, encodings of inputs and proving decidability Sipser 3.2,4.1 slides
05/20/2019 Proving decidability Sipser 4.1 slides HW6 due
05/22/2019 Proving undecidability by diagonalization Sipser 4.2 slides
05/27/2019 Memorial Day (no class) HW7 due
05/29/2019 Reductions and the halting problem Sipser 5.1 slides
06/03/2019 Reductions and the halting problem Sipser 5.1 slides
06/05/2019 Midterm 2 (in class)
06/14/2017 Final exam
Extra slides we did not have time to cover: