Podcasts Technology CSCI E-207: Introduction to Formal Systems and Computation - Video
CSCI E-207: Introduction to Formal Systems and Computation - Video

CSCI E-207: Introduction to Formal Systems and Computation - Video

24 episodes

This course is a rigorous introduction to formal systems and the theory of computation. Elementary treatment of automata, formal languages, computability, uncomputability, computational complexity, NP-completeness, and mathematical logic are covered. The recorded lectures are from the Harvard School of Engineering and Applied Sciences course Computer Science 121.

Podcasts

Conclusion-L24

Published: Dec. 21, 2007, 4:15 p.m.
Duration: 41 minutes 47 seconds

Listed in: Technology

NP-Completeness-L22

Published: Dec. 21, 2007, 3:14 p.m.
Duration: 1 hour 14 minutes 24 seconds

Listed in: Technology

Cook-Levin Theorem and PSPACE-L23

Published: Dec. 21, 2007, 3:13 p.m.
Duration: 1 hour 10 minutes 44 seconds

Listed in: Technology

Polynomial Time-L20

Published: Dec. 21, 2007, 2:38 p.m.
Duration: 1 hour 14 minutes 6 seconds

Listed in: Technology

NP-L21

Published: Dec. 21, 2007, 2:38 p.m.
Duration: 1 hour 10 minutes 51 seconds

Listed in: Technology

Computational Complexity-L19

Published: Dec. 20, 2007, 11:40 p.m.
Duration: 1 hour 8 minutes

Listed in: Technology

Reductions and Rice's Theorem-L17

Published: Dec. 20, 2007, 4:14 p.m.
Duration: 1 hour 11 minutes

Listed in: Technology

Undecidable Problems and Unprovable Theorems-L18

Published: Dec. 20, 2007, 4:06 p.m.
Duration: 59 minutes 58 seconds

Listed in: Technology

Undecidability-L16

Published: Dec. 18, 2007, 5:35 p.m.
Duration: 1 hour 3 minutes 36 seconds

Listed in: Technology

Decidability and a Universal Turing Machine-L15

Published: Dec. 11, 2007, 12:10 a.m.
Duration: 1 hour 14 minutes 36 seconds

Listed in: Technology

Church's Thesis-L14

Published: Dec. 11, 2007, 12:04 a.m.
Duration: 1 hour 12 minutes 6 seconds

Listed in: Technology

Turing Machines-L13

Published: Dec. 10, 2007, 11:35 p.m.
Duration: 59 minutes 34 seconds

Listed in: Technology

Context-Free Recognition-L12

Published: Dec. 10, 2007, 11:30 p.m.
Duration: 1 hour 2 minutes 3 seconds

Listed in: Technology

CFL Closure Properties, Non-CF Languages-L11

Published: Dec. 10, 2007, 10:51 p.m.
Duration: 1 hour 19 seconds

Listed in: Technology

Pushdown Automata-L10

Published: Dec. 10, 2007, 10:46 p.m.
Duration: 1 hour 7 minutes 24 seconds

Listed in: Technology

Non-Regular Languages-L08

Published: Dec. 10, 2007, 10:08 p.m.
Duration: 1 hour 1 minute 31 seconds

Listed in: Technology

Context-Free Grammars-L09

Published: Dec. 10, 2007, 10:05 p.m.
Duration: 1 hour 5 minutes 51 seconds

Listed in: Technology

Regular Expressions-L06

Published: Dec. 10, 2007, 9:41 p.m.
Duration: 1 hour 9 minutes 41 seconds

Listed in: Technology

Countability and Uncountability-L07

Published: Dec. 10, 2007, 9:37 p.m.
Duration: 41 minutes 52 seconds

Listed in: Technology

Nondeterministic Finite Automata-L05

Published: Dec. 7, 2007, 5:49 p.m.
Duration: 1 hour 10 minutes 23 seconds

Listed in: Technology

Finite Automata-L04

Published: Dec. 7, 2007, 5:41 p.m.
Duration: 1 hour 4 minutes 55 seconds

Listed in: Technology

Proofs-L03

Published: Dec. 4, 2007, 9:11 p.m.
Duration: 1 hour 3 minutes 24 seconds

Listed in: Technology

Mathematical Preliminaries-L02

Published: Dec. 4, 2007, 7:44 p.m.
Duration: 1 hour 11 minutes 25 seconds

Listed in: Technology

Introduction-L01

Published: Dec. 4, 2007, 7:33 p.m.
Duration: 57 minutes 36 seconds

Listed in: Technology