Learn More About
Find More Titles by
|
|
|
Theory of Computation
CSE 105 - UCSD Spring 2007 Course |
|
|
|
|
Title Details
Running Time
1 Hr. 20 Min.
Description
An introduction to the mathematical theory of computability. Formal languages. Finite automata and regular expression. Push-down automata and context-free languages. Computable or recursive functions: Turing machines, the halting problem. Undecidability.
People Who Liked Theory of Computation Also Liked These Titles:
Podcast Details
 Podcast RSS Feed URL: |
Podcast Website:
http://podcast.ucsd.edu/podcasts/default.aspx?PodcastId=13&v=0