Course 08: Theory of Computation (ArsDigita University)

A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course.

Text: Introduction to the Theory of Computation, Michael Sipser.

Reference: Introduction to Automata Theory, Languages and Computation by Hopcroft, Motwani and Ullman.

Requirements: Two exams, five problem sets.

This item is part of the collection: ArsDigita Computer Science University

About this Item

Date:

2001

Write a review Reviews

Downloaded 44,812 times Average Rating:

Reviewer: chamanbagga - - April 4, 2008
Subject: Amazing content


These lectures are very good, especially for somewhat tough subject like this... it makes the course pretty easy..

Reviewer: sarek - - March 6, 2008
Subject: The difference between passing and failing

I am currently enrolled a graduate version of this class based on the same book (the whole book in 16 weeks with doing 7 problems [much harder then the excercises]) at a on-line university and couldn't make heads or tails out of the book without these videos.

Reviewer: Ricardo Quiroz - - December 17, 2007
Subject: Awesome material

I´m downloading the videos and they helped me in my classroom. Even we follow another book to develop this topic at class, we found we´re imparting the same knowledge as we saw at the videos. Thanks to keep them online, I was unable to find something similar on the net.

Reviewer: 0404kumar3 - - October 6, 2007
Subject: Helps a lot

One of the best lectures I had ever seen

Reviewer: wackyStudent - - March 17, 2007
Subject: Help me get an A

Can't beat the price! Content is A+ and maybe better than some paid lectures