CPSC 562 Theory of Computation

This course will introduce abstract counterparts of physical machines and algorithms. Turing machines and other automata will be presented. The notions of algorithms, computability and unsolvability will be rigorously defined and studied. Some problems not solvable by instruction-obeying machines will be examined.

Credits

3 credits