CSCI 270 - Theory of Computation

Type of Course: 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: Prerequisites for this course require a grade of C- or better. CSCI 180 .


This course information is from the 2011-2012 Academic Catalog. View this catalog.
Print this page.