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

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

Follow CSCI E-207: Introduction to Formal Systems and Computation - Audio
Share on
Copy link to clipboard

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…

Instructor: Harry R. Lewis, PhD, Harvard College Professor and Gordon McKay Professor of Computer Science, Harvard University.


    • Dec 21, 2007 LATEST EPISODE
    • infrequent NEW EPISODES
    • 1h 4m AVG DURATION
    • 24 EPISODES


    Search for episodes from CSCI E-207: Introduction to Formal Systems and Computation - Audio with a specific topic:

    Latest episodes from CSCI E-207: Introduction to Formal Systems and Computation - Audio

    Cook-Levin Theorem and PSPACE-L23

    Play Episode Listen Later Dec 21, 2007 70:47


    cook levin theorem
    Conclusion-L24

    Play Episode Listen Later Dec 21, 2007 41:50


    conclusion
    NP-Completeness-L22

    Play Episode Listen Later Dec 21, 2007 74:27


    completeness
    NP-L21

    Play Episode Listen Later Dec 21, 2007 70:55


    Polynomial Time-L20

    Play Episode Listen Later Dec 20, 2007 74:09


    polynomials
    Computational Complexity-L19

    Play Episode Listen Later Dec 20, 2007 68:03


    complexity computational
    Reductions and Rice's Theorem-L17

    Play Episode Listen Later Dec 20, 2007 71:04


    theorem reductions
    Undecidable Problems and Unprovable Theorems-L18

    Play Episode Listen Later Dec 20, 2007 60:01


    theorems
    Undecidability-L16

    Play Episode Listen Later Dec 18, 2007 63:39


    Pushdown Automata-L10

    Play Episode Listen Later Dec 10, 2007 67:28


    automata
    Decidability and a Universal Turing Machine-L15

    Play Episode Listen Later Dec 10, 2007 74:40


    universal turing machines
    Church's Thesis-L14

    Play Episode Listen Later Dec 10, 2007 72:10


    thesis
    Turing Machines-L13

    Play Episode Listen Later Dec 10, 2007 59:38


    turing machines
    Context-Free Recognition-L12

    Play Episode Listen Later Dec 10, 2007 62:07


    context recognition
    CFL Closure Properties, Non-CF Languages-L11

    Play Episode Listen Later Dec 10, 2007 60:22


    languages properties closure
    Context-Free Grammars-L09

    Play Episode Listen Later Dec 10, 2007 65:54


    context grammars
    Non-Regular Languages-L08

    Play Episode Listen Later Dec 10, 2007 61:34


    regular languages
    Countability and Uncountability-L07

    Play Episode Listen Later Dec 10, 2007 41:54


    Regular Expressions-L06

    Play Episode Listen Later Dec 10, 2007 69:45


    regular expressions
    Nondeterministic Finite Automata-L05

    Play Episode Listen Later Dec 4, 2007 70:26


    finite automata
    Finite Automata-L04

    Play Episode Listen Later Dec 4, 2007 64:58


    finite automata
    Proofs-L03

    Play Episode Listen Later Dec 4, 2007 63:28


    proofs
    Mathematical Preliminaries-L02

    Play Episode Listen Later Dec 4, 2007 71:28


    mathematical
    Introduction-L01

    Play Episode Listen Later Dec 4, 2007 57:39


    Claim CSCI E-207: Introduction to Formal Systems and Computation - Audio

    In order to claim this podcast we'll send an email to with a verification link. Simply click the link and you will be able to edit tags, request a refresh, and other features to take control of your podcast page!

    Claim Cancel