Contact Admissions: (866) 967-7046


CPSC-61000 Theory of Computation


This course examines undecidability, computational complexity, and models of computations. Topics include languages and automata, Turing machines, reductions, time and space complexity classes, and completeness.

Learning Objectives:

  1. Present models of computation that can be used for analyzing decidability of problems and the efficiency of solutions.
  2. Study problems which are unsolvable by a computer.
  3. Examine the difficulty level associated with various problems and the efficiency of their solution algorithms.

Take the Next Step

Learn more about Lewis University's online programs. Call (866) 967-7046 to speak with a Graduate Admissions Counselor or click here to request more information.