REF2020: Anurag Tripathi- Multiparton webs beyond three loops

N/A

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 lecture introduces a very important…

This is the last FP video lecture, on Propositions as Types.

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.

We introduce NFA - automata with ε-transitions

We give a second definition of regular language as the languages generated from the empty and singleton languages by the operations of, concatenation, alternation, and iteration.

Screencast by Dr Kimberley Czajkowski for Running the Roman Empire: Week 10

In this video we look at more complicated patterns of implications, and introduce a method for counting the satisfying valuations.

In this video we look at the next simplest example, chains of implications between atoms. We introduce the arrow rule.

In this video we focus on binary constraints: clauses with two literals. A 2-SAT problem is a conjunction of binary constraints. We will represent it as a partial ordering on literals.In this video…

We introduce the idea of using a divide and conquer algorithm.

We return to the example introduced in the previous video, and begin to represent the problem in Haskell.

This video is a brief recap of most of the logic we have covered so far. You may find it useful, to jog your memory and check your understanding.