ECS 120: Undergraduate Theory of Computation
ECS 120: Undergraduate Theory of Computation
These are lectures for the course ECS 120, Undergraduate Theory of Computation, taught by David Doty. They were recorded for the Spring 2020 offering of the course, on a Monday-Wednesday-Friday lecture schedule. In the current quarter, the exact days and weeks are likely to be slightly different.
To list the videos in order, view the whole playlist, or select Sort By: Alphabetically - A to Z. (Except that it will put week 10 out of order, near the start.)
There are also playlists breaking them up by chapter in the lecture notes for the course:
Videos are labeled as follows. ECS 120 [week][day]:[topic] where [week] is a number 0,1,2,...,10 (0 is for lectures reviewing discrete math prerequisite material), [day] is a letter (a=Monday, b=Wednesday, c=Friday), and [topic] starts with a number to indicate viewing order within that lecture day (there are several short videos for each lecture day, each 5-15 minutes long). For example, ECS 120 2c:5 formal definition of NFA semantics is week 2, Friday, topic 5 for that day: formal definition of NFA semantics.
This naming convention only makes sense for Spring quarter dates; for instance in Fall 2021, the quarter starts on a Wednesday instead of a Monday, so all lectures would be shifted by one for that quarter. Refer to the current course webpage for which videos correspond to which lectures, instead of using the names on the AggieVideo website.
To list the videos in order, view the whole playlist, or select Sort By: Alphabetically - A to Z. (Except that it will put week 10 out of order, near the start.)
There are also playlists breaking them up by chapter in the lecture notes for the course:
- discrete math review (chapter 1)
- 1/2 (intro)
- 3 (DFAs)
- 4 (regex, CFG, NFA)
- 5 (closure properties)
- 6 (equivalence of regular language models)
- 7 (pumping lemma)
- 8 (Turing machines)
- 9 (polynomial time deciders, the class P)
- 10 (polynomial time verifiers and reductions, the class NP)
- 11 (undecidability)
Videos are labeled as follows. ECS 120 [week][day]:[topic] where [week] is a number 0,1,2,...,10 (0 is for lectures reviewing discrete math prerequisite material), [day] is a letter (a=Monday, b=Wednesday, c=Friday), and [topic] starts with a number to indicate viewing order within that lecture day (there are several short videos for each lecture day, each 5-15 minutes long). For example, ECS 120 2c:5 formal definition of NFA semantics is week 2, Friday, topic 5 for that day: formal definition of NFA semantics.
This naming convention only makes sense for Spring quarter dates; for instance in Fall 2021, the quarter starts on a Wednesday instead of a Monday, so all lectures would be shifted by one for that quarter. Refer to the current course webpage for which videos correspond to which lectures, instead of using the names on the AggieVideo website.
-
ECS 120 1a:2 course policies
-
ECS 120 0:3.5 equivalence relations (discrete…
-
ECS 120 5b:4 a non-regular unary language
-
ECS 120 5b:3 more examples of using Myhill-Nerode…
-
ECS 120 5b:2 proof of non-regularity using…
-
ECS 120 5b:1 examples of using the Myhill-Nerode…
-
ECS 120 5a:5 corollary of Myhill-Nerode Theorem…
-
ECS 120 5a:4 statement of Myhill-Nerode Theorem
-
ECS 120 5a:3 example of separating extension
-
ECS 120 5a:2 definition of separating extension…
-
ECS 120 0:7 combinatorics (discrete math review)
-
ECS 120 0:6 pigeonhole principle (discrete math…
-
ECS 120 10b:3 diagonalization to show the halting…
-
ECS 120 10b:2 the real numbers are uncountable…
-
ECS 120 10b:1 diagonalization to show a set is…
Search for ""