Search Results

CS 125. Computability and Complexity. 3 Credits.

Formal languages and expressiveness. Turing completeness and Church's Thesis. Decidability and tractability. Complexity classes and theory of NP completeness. Prerequisites: CS 064 or MATH 052. Co-requisite: CS 124.

Computer Science B.S.CS.

http://catalogue.uvm.edu/undergraduate/engineeringandmathematicalsciences/computerscience/computersciencebs/

1 C- or higher required in CS 021 and CS 110 . 2 MATH 019 and MATH 023 are acceptable substitutions for  MATH 021 and  MATH 022 .  3 BCOR 011 and BCOR 012 are acceptable substitutions for BIOL 001 and BIOL 002 . 4 CHEM 047  and CHEM 048 are acceptable substitutions for CHEM 031 and CHEM 032 . 5 PHYS 031 and PHYS 125 (& PHYS 022 ) are acceptable substitutions for PHYS 051 and PHYS 152 .

Computer Science Ph.D.

http://catalogue.uvm.edu/graduate/computerscience/computersciencephd/

...Organization (e.g., CS 121 ), and Theory of Computation (e.g., CS 125 ) may be...