|
REF2020: Anurag Tripathi- Multiparton webs beyond three loops
Licence Type
All rights reserved The University of Edinburgh Date Created
December 7th, 2020
|
|
Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
VISS online seminar series Soliton Solutions of noncommutative anti self dual Yang Mills equations Claire Gilson (University of Glasgow) 11 November 2020 An automated programme is used to generate…
Licence Type
All rights reserved Language
english Date Created
November 11th, 2020
|
|
This video looks at the ordering of predicates. We first met thsis as the satisfaction ordering a ⊨ b.We look at the ordering of the 16 possible boolean functions of two variables. We can also view…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
In the first video, we learn how we can represent data from a multitude of sources as vectors. We show that these vectors can be stacked into a matrix to represent an entire dataset, and the…
|
|
First we see how to express the rules of Sudoku in Haskell. Given a total function s :: Int -> Int -> Int -> Bool that represents the way a sudoku puzzle is filled in by saying that s i j k…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
VISS online seminar series Orthogonal Polynomials and Random Matrices Walter Van Assche (KU Leuven) 28 October 2020 An automated programme is used to generate the subtitles on this talk. You can…
Licence Type
All rights reserved Language
english Date Created
October 28th, 2020
|
|
This video shows how to use a Karnaugh map to represent an arbitrary Boolean function of four variables as a conjunctive normal form (CNF) — a conjunction of disjunctions of literals.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
This video shows how blocks of zeros, which correspond to disjund=ctions of literals, lead us to conjunctive normal form (CNF) which we met earlier as the output of our reduction procedure. CNF is in…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
This video shows you how to find your way through the state space represented by a Karnaugh Map, and introduces features called blocks. In this video we focus on blocks of ones.
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
We use the rules to reduce a sequent to a conjunction of simpler
sequents. In this example we find that the expression asserted by the
sequent is a tautology — it is equivalent to the empty…
Course Code
INFR08025 Licence Type
All rights reserved The University of Edinburgh Language
English
|
|
What makes data tidy and why do we care?
Course Code
MATH08077 Licence Type
Creative Commons - Attribution Non Commercial Share A Like
|
|
Lecture 6a - Reliability by Prof Ian Underwood
Licence Type
Creative Commons - Attribution
|
|
Dr Fiona Borthwick talks to Indian potato farmer, Mr Sangha, about his experiences of farming practice.
Course Code
GSA1.1x Publisher
Lizzy Garner-Foy Licence Type
Creative Commons - Attribution Share A Like Language
English Date Created
July 24th, 2020
|
|
This video quickly shows you three different ways to implement for loops in Python.
Course Code
EASC09054, EASC08025 Licence Type
Creative Commons - Attribution
|
|
A short series aimed at upskilling distance learning students on how to make the best use of excel. In this lecture I cover some of Excel's capabilities including formulas and pivot tables. …
Publisher
R(D)SVS Licence Type
Creative Commons - Attribution Language
English
|