| Title: |
Theory of Computing
|
| GE Status: |
|
| U.S. History and Government: |
|
| Prerequisites: |
CSC 213, MATH 325, and MATH 330 or CSC 330 with grades of C or better.
|
| Term(s) Offered: |
|
| Units: |
(3)
|
| Description: |
Automata, formal languages, and the notion of computability. Sequential machines as language acceptors. Context free and context sensitive grammars. Computable and recursive functions, universal
turing machines. Unsolvable problems.
|
| Effective: |
Fall 1994
|
| Latest Offering: |
Spring 2008
|
Home
Search
Need Help?
1600 Holloway Avenue, San Francisco, CA 94132 (415) 338-1111
Last modified April 02, 2008 by bulletin@sfsu.edu