Search for tag: "a."

School of Informatics Sample Undergraduate Lecture

School of Informatics - Sample 1st year lecturePropositions as Types by Professor Philip WadlerSemester 1: Lecture 19 (INF1A)

From  Nicola Hopper on June 3rd, 2021 0 likes 14 plays 0  

David Deuber EVA Talk Preview

This talk has captions. You can remove these by pressing CC on the video toolbar. Name: David Deuber Talk Title: Extremal Quantile Treatment Effects for Heavy-Tailed Distributions Abstract: Causal…

From  Anna Munro on May 20th, 2021 0 likes 6 plays 0  

dapr1 - lab test instructions

Instructions for lab tests

From  Umberto Noe on February 8th, 2021 0 likes 326 plays 0  

FDS-S2-03-1-1 principle of A/B testing

We explain the principle of A/B testing, and how to derive confidence intervals for the difference in population proportions using the bootstrap.

From  David Sterratt on January 28th, 2021 0 likes 199 plays 0  

Jean-Simon Lemay (University of Oxford): The Theory of Differential Categories

Jean-Simon Lemay (University of Oxford): The Theory of Differential Categories The theory of differential categories uses category theory to study the foundations of differentiation. Differential…

From  OLLIE Quinn on December 9th, 2020 0 likes 35 plays 0  

CL - 15d - Using ε-transitions

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.

From  Haoran Peng on November 23rd, 2020 0 likes 240 plays 0  

FP - Lecture 17 - IO and Monads

This is the first video for the FP lecture on IO and Monads.

From  Claudia-Elena Chirita on November 23rd, 2020 0 likes 317 plays 0  

FP - Lecture 18 - IO and Monads

This is the second video on the FP lecture on IO and Monads.

From  Claudia-Elena Chirita on November 23rd, 2020 0 likes 261 plays 0  

CL - 13d - Black holes and DFA

We begin with a short discussion of the history and some applications of FSM. We then introduce Deterministic Finit-state Automata (DFA), and the use of the black hole convention when presenting…

From  Haoran Peng on November 18th, 2020 0 likes 295 plays 0  

CL - 13b - regex and FSM

We introduce some simple finite state machines, and three key ideas of the theory.The first idea is that of the language recognised by a machine. Given an alphabet of symbols, a language is a set…

From  Haoran Peng on November 17th, 2020 0 likes 367 plays 0  

CL - 12b - Binary Constraints

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…

From  Haoran Peng on November 9th, 2020 0 likes 268 plays 0  

Topic 46: Cramer-Rao Lower Bound (PETARS, Chapter 6)

In this video, the question of finding the lower bound on the performance of all estimators for a particular probabilistic problem, as a benchmark with which to compare the performance of a given…

From  James Hopgood on October 24th, 2020 0 likes 95 plays 0  

Topic 44: Minimum Mean Square Error Estimators (PETARS, Chapter 6)

This video introduces the simple mean square error (MSE) as a criterion which trades-off bias and variance for an estimator. The relationship between the MSE and bias and variance is defined. The…

From  James Hopgood on October 23rd, 2020 0 likes 76 plays 0  

CL - Barbara

Gentzen's rules provide a complete system that does not require the cut rule. For many logical systems, cut elimination (showing that uses of the cut rule may be eliminated from any sound proof)…

From  Haoran Peng on October 21st, 2020 0 likes 279 plays 0  

CL - Review 2 - Venn Apples

Venn diagrams on a sphere.

From  Haoran Peng on October 20th, 2020 0 likes 309 plays 0  

CL - Lecture 4.f - Sequents 1

We interpret additional predicates before the turnstile. These simply express validity in a sub-universe. This means that for any sound rule the corresponding rule with additional predicates is…

From  Claudia-Elena Chirita on October 15th, 2020 0 likes 414 plays 0