 |
CSCI270
- Theory of Computation/Lecture
Studies the nature and formal models of computation (by computers), its power and limitation (computability versus uncomputability), the computational complexity of various problems and the applications in logic and computer science. Turing machines, general recursive functions and other standard models of computation are introduced. Other aspects of recursion theory, such as unsolvable problems and recursively enumerable languages, are introduced. We also address the more practical question, “What is an efficient program?” in an introduction to modern complexity theory. Prerequisites for this course require a grade of C- or better. Prerequisite: CSCI180. Mr. Green/Offered every other year
Faculty
Frederic Green, Ph.D. - Professor and Chair, Department of Mathematics
and Computer Science
|
| |
|
Additional Resources
|
|
|
|
