Podcasts in These Categories
Find More Titles by
|
|
|
Theory of Computation
CSE 105 - UCSD Spring 2007 Course |
|
|
|
|
Product 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 Podcasts:
Reviews & Ratings
User Reviews Rate this title
Podcast Episodes
If this Podcast isn't working, please let us know by emailing us and we will try to fix it ASAP:
 Podcast Feed URL: |
Podcast Website:
http://podcast.ucsd.edu/podcasts/default.aspx?PodcastId=13&v=0
More Details
- LearnOutLoud.com Product ID:
T023779
Available On
Volumes
ISBN-10
ISBN-13