|
|
|
REF2020: Anurag Tripathi- Multiparton webs beyond three loops
Licence Type
All rights reserved The University of Edinburgh Date Created
December 7th, 2020
|
|
N/A
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
This is the last FP video lecture, on Propositions as Types.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We introduce NFA - automata with ε-transitions
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
Screencast by Dr Kimberley Czajkowski for Running the Roman Empire: Week 10
Course Code
PGHC11501 Publisher
The University of Edinburgh Licence Type
All rights reserved The University of Edinburgh
|
|
In this video we look at more complicated patterns of implications, and introduce a method for counting the satisfying valuations.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
In this video we look at the next simplest example, chains of implications between atoms. We introduce the arrow rule.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We introduce the idea of using a divide and conquer algorithm.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We return to the example introduced in the previous video, and begin to represent the problem in Haskell.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
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.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|