INF1A: Introduction to Computation [2020/2021]

INF1A: Introduction to Computation [2020/2021]

Show Details

Welcome to the media channel of the course INF1A: Introduction to Computation [2020/2021]!

Here you can find all the videos used in the two parts of the course, Functional Programming and Computation and Logic: lecture recordings, live-session recordings and other videos.

All the videos have automatically generated captions. Although we did our best to fix inaccuracies, we might have missed some. Please help us improve our captions by leaving a comment on the page of the appropriate video or, even better, by submitting a pull request on our GitHub page.

…Read more Less…

introduction to computation

functional programming

computation and logic

53:47

CL - 22 - Tseytin Satisfaction DPLL

CL - 22 - Tseytin Satisfaction DPLL

From Haoran Peng

0 likes 105 plays 0
N/A
50:26

CL - 21 - CNF KM Gentzen Tseytin

CL - 21 - CNF KM Gentzen Tseytin

From Haoran Peng

0 likes 114 plays 0
N/A
53:56

CL - 20 - syllogisms arrowrule

CL - 20 - syllogisms arrowrule

From Haoran Peng

0 likes 145 plays 0
N/A
55:01

CL - 18 - rules

CL - 18 - rules

From Haoran Peng

0 likes 210 plays 0
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…
37:11

FP - Lecture 19 - Propositions as Types

FP - Lecture 19 - Propositions as Types

From Claudia-Elena Chirita

0 likes 404 plays 0
This is the last FP video lecture, on Propositions as Types.
54:51

CL - 19 - regex DFA NFA

CL - 19 - regex DFA NFA

From Haoran Peng

0 likes 212 plays 0
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.
55:01

CL - 17 - regex: Arden's lemma

CL - 17 - regex: Arden's lemma

From Haoran Peng

0 likes 229 plays 0
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.
49:40

CL - 16 - ε-transitions and the subset…

CL - 16 - ε-transitions and the subset construction

From Haoran Peng

0 likes 232 plays 0
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.
02:48

CL - 15f - R* -- Iteration

CL - 15f - R* -- Iteration

From Haoran Peng

0 likes 230 plays 0
We construct an NFA for R*; then summarize the algebra of regular expressions.
05:47

CL - 15e - RS -- Concatenation

CL - 15e - RS -- Concatenation

From Haoran Peng

0 likes 259 plays 0
We use ε-transitions to connect two NFA and create a machine that recognises the concatenation of their languges.
02:02

CL - 15d - Using ε-transitions

CL - 15d - Using ε-transitions

From Haoran Peng

0 likes 244 plays 0
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.
06:09

CL - 15c - Introducing ε-transitions

CL - 15c - Introducing ε-transitions

From Haoran Peng

0 likes 277 plays 0
We introduce NFA - automata with ε-transitions
46:18

FP - Lecture 17 - IO and Monads

FP - Lecture 17 - IO and Monads

From Claudia-Elena Chirita

0 likes 354 plays 0
This is the first video for the FP lecture on IO and Monads.
47:13

FP - Lecture 18 - IO and Monads

FP - Lecture 18 - IO and Monads

From Claudia-Elena Chirita

0 likes 272 plays 0
This is the second video on the FP lecture on IO and Monads.
11:48

CL - 15b - Boolean operations on DFA-Regular…

CL - 15b - Boolean operations on DFA-Regular Languages

From Haoran Peng

0 likes 339 plays 0
Since DFA-regular languages are closed under complements and intersections, they are closed under all Boolean operations.

Search for ""

Public, Restricted and Moderated

119 Media

5 Members

Managers:: Claudia-Elena Chirita
Michael Fourman
Philip Wadler
Alex Burford
Haoran Peng
Appears In:

the university of edinburgh

University affiliations

The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336, VAT Registration Number GB 592 9507 00, and is acknowledged by the UK authorities as a “Recognised body” which has been granted degree awarding powers.

Any views expressed within media held on this service are those of the contributors, should not be taken as approved or endorsed by the University, and do not necessarily reflect the views of the University in respect of any particular issue.

Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh 2021 and may only be used in accordance with the terms of the licence.