CSE 105 - Theory of Computation, Spring 2025


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.


Homework problem sets:


Class times

TypeDayTimeLocation
LectureMW5-6:20pmCTL 0125
Discussion A01M4-4:50pmCTL 0125

Instructors

RoleNameEmailOffice hours
ProfessorShachar Lovettslovett@ucsd.eduF 12:30-1:30pm, CSE 4234
TAFarzan Byramjifbyramji@ucsd.eduF 6-7pm, CSE B240A
TALoukik Rainalraina@ucsd.eduT 9:30-10:30am, CSE B260A
TAHarsh Vardhan Sharmahvsharma@ucsd.eduW 9:45-10:45am, CSE B270A
TAAbhiraj Yogesh Srivastavaabs018@ucsd.eduTh 10-11am, CSE B240A
TAHaemanth Velmuruganhvelmurugan@ucsd.eduM 1-2pm, CSE B275

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 $20.
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, and 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 15% of the final grade. There will be 7 homeworks, the lowest one will be dropped. Homework is due on Mondays midnight. Submission is online via Gradescope.
You should already be enrolled; if not, enroll using your @ucsd.edu email and the code GV2RYR.
Instructions:

Participation

I want to keep this class as interactive as possible, to help you follow lectures better and to help identify mis-understood concepts early on. Participation will not be formally graded, but it will be considered when assigning the final letter grade (i.e. the +/- designation).
We will use Webclicker to run polls during class. Please sign in using your @ucsd.edu email and use the code PRDKWU to find the class.

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. Please use public posts for general questions about the class or material, and private posts for personally relevant questions or questions that can reveal a solution or approach to a homework problem.
You should already be enrolled; if not, enroll using your @ucsd.edu email and the code 362j7htu3kk.

Podcast

You can access all previous classes through podcast.

Academic integrity

Your goal is to excel in this class with integrity. It is an academic violation to: This is a partial list of common academic violations in this class. If you are not sure if some activity constitutes an academic violation or not, please ask us before doing it. We will report academic violations to the academic integrity office. See also the detailed academic integrity policy for more information.

Schedule

NOTE: Subject to change throughout the quarter.
Date Subject Chapter Slides HW due
03/31/2025 Logistics, introduction to automata Sipser 0, 1.1 slides
04/02/2025 Formal definition of Deterministic Finite Automata (DFA) Sipser 1.1 slides
04/07/2025 Regular languages, closure under: complementation, union Sipser 1.1, 1.2 slides HW1 due
04/09/2025 Formal definition of Nondeterministic Finite Automata (NFA) Sipser 1.1, 1.2 slides
04/14/2025 Equivalence of DFAs and NFAs Sipser 1.2, 1.3 slides HW2 due
04/16/2025 Equivalence of DFAs and regular expressions Sipser 1.2, 1.3 slides
04/21/2025 Limits of regular languages: the pumping lemma Sipser 1.4 slides HW3 due
04/23/2025 More examples of pumping lemma, intro to Context Free Grammar (CFG) Sipser 1.4, 2.1 slides
04/28/2025 Midterm 1 (in class)
04/30/2025 Context Free Grammar (CFG), Push Down Automata (PDA) Sipser 2.1, 2.2 slides
05/05/2025 More on Push Down Automata (PDA) Sipser 2.2 slides HW4 due
05/07/2025 Introduction to Turing machines (TM) Sipser 3.1 slides
05/12/2025 Turing machines: more examples and equivalent models Sipser 3.1, 3.2 slides HW5 due
05/14/2025 More on models, encodings of inputs and proving decidability Sipser 3.2, 4.1 slides
05/19/2025 Proving undecidability by diagonalization Sipser 4.2 slides HW6 due
05/21/2025 Reductions and the halting problem Sipser 5.1 slides
05/26/2025 No class: Memorial Day HW7 due
05/28/2025 Bonus / buffer
06/02/2025 Summary slides
06/04/2025 Midterm 2 (in class)
06/13/2025 Final exam