INF1A: Introduction to Computation [2020/2021]
INF1A: Introduction to Computation [2020/2021]
Welcome to the media channel of the course INF1A: Introduction to Computation [2020/2021]!
Here you can find all the videos used in the two parts of the course, Functional Programming and Computation and Logic: lecture recordings, live-session recordings and other videos.
All the videos have automatically generated captions. Although we did our best to fix inaccuracies, we might have missed some. Please help us improve our captions by leaving a comment on the page of the appropriate video or, even better, by submitting a pull request on our GitHub page.
-
N/A
CL - 22 - Tseytin Satisfaction DPLL
-
N/A
CL - 21 - CNF KM Gentzen Tseytin
-
N/A
CL - 20 - syllogisms arrowrule
-
This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.This…
CL - 18 - rules
-
This is the last FP video lecture, on Propositions as Types.
FP - Lecture 19 - Propositions as Types
-
This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.
CL - 19 - regex DFA NFA
-
This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.
CL - 17 - regex: Arden's lemma
-
This is a raw video from 2019. I've not yet had time to edit it into chunks. If you have any questions, or find any errors, please let me know on Piazza.
CL - 16 - ε-transitions and the subset…
-
We construct an NFA for R*; then summarize the algebra of regular expressions.
CL - 15f - R* -- Iteration
-
We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.
CL - 15e - RS -- Concatenation
-
We present a first example of the use of ε-transitions to concstruct new mahines, and pose a problem to be answered in the following video.
CL - 15d - Using ε-transitions
-
We introduce NFA - automata with ε-transitions
CL - 15c - Introducing ε-transitions
-
This is the first video for the FP lecture on IO and Monads.
FP - Lecture 17 - IO and Monads
-
This is the second video on the FP lecture on IO and Monads.
FP - Lecture 18 - IO and Monads
-
Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.
CL - 15b - Boolean operations on DFA-Regular…
Search for ""
Public, Restricted and Moderated
119
Media
5
Members
- Managers:
- Appears In: