CSC 280: Computer Models and Limitations

Next Offered:
Spring 2010
CRN:
90127
Credit Hours:
4.0
Previous Offerings:

This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the Chomsky hierarchy, Turing machines and algorithmic universality, noncomputability and undecidability, tradeoffs between power and formal tractability.