CIS 560: Theoretical Comp Science

Theoretical basis of the development of computer science. The course details particular formalisms used in the design of hardware and software systems. Intrinsic limitations of computation are described. Advanced topics of automata theory and analysis of algorithms are included. The course also covers Turing machines, the halting problem, models of computation, intractable computations, polynomial reductions, P vs. NP, parallel algorithms, various formal descriptions and specifications of programs and computations, and proofs of program correctness and interactive proof systems.

2021 Fall
Class#SctTypeSeatsUnits
12140 01 Lecture 50 3.00
DaysStartEndLocation
MON TUE WED THU FRI SAT 3:30 PM EST 4:45 PM EST
Instructor: Haiping Xu Class status:
Enrollment Section
Class instruction mode: In Person

Course search