INF1A: Introduction to Computation [2020/2021]
INF1A: Introduction to Computation [2020/2021]
-
-
-
-
From Haoran Peng
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… -
This is the last FP video lecture, on Propositions as Types.
-
From Haoran Peng
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. -
From Haoran Peng
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. -
From Haoran Peng
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. -
-
From Haoran Peng
We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges. -
From Haoran Peng
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. -
-
This is the first video for the FP lecture on IO and Monads.
-
This is the second video on the FP lecture on IO and Monads.
-
From Haoran Peng
Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.
Search for ""
Public, Restricted and Moderated
- Managers:
- Appears In: