Lectures
There are two lectures per week (weeks 12-23):
- Mondays 14.00-15.00 (Meston 6)
- Tuesdays 11.00-12.00 (KCT2)
NB: The schedule below is only tentative and may be modified.
|
Lectures
|
Topic
|
Support Material
|
| L1 |
Course Overview
|
Slides:
Powerpoint
|
| L1 |
Formal languages 1: basic terminology
|
Slides:
Powerpoint
pdf
|
| L2 |
Formal languages 2: FSAs
|
Slides:
Powerpoint
pdf
|
| L3 |
Formal languages 3: Regular Expressions
|
Slides:
Powerpoint
In praise of the empty string:
ppt
pdf
|
| L4 |
Formal languages 4: Equivalence of FSAs and Regular Expressions
|
Slides:
Powerpoint
pdf
|
| L5 |
Formal languages 5: Concluding remarks
|
Slides:
Powerpoint
pdf
|
| L6 |
Introduction to Lambda Calculus
|
Slides:
PDF
|
| L7 |
Lambda Conversion
|
Slides:
PDF
a brief note about beta-conversion
|
| L8 |
Introduction to Haskell
|
Slides:
PDF
|
| L9 |
Functions and Types
|
Slides:
PDF plus example in
PPT
|
| L10 |
Lists and Higher Order Functions
|
Slides:
PDF
|
| L11 |
Functions and Infinite Data
|
Slides:
PDF plus example in
PPT and
an illustration of folding .
|
| L12 |
More Examples
|
Slides:
PDF and more about
prime numbers.
|
| L13 |
Algebraic Types, Modules and Abstract Data Types
|
Slides:
PDF
|
| L14 |
Preliminaries to computability (bijections and cardinality)
|
Slides: POWERPOINT
|
|
L16-18
|
Computability and Complexity (I-II)
|
Slides:
PowerPoint
pdf
|
|
L19-21
|
Computability and Complexity (III-IV)
|
Slides:
PowerPoint
pdf
|
[an error occurred while processing this directive]
|
