This course addresses questions like What kind of problems can be algorithmically solved? and What are the limits of what a computer can compute? Students are introduced to a variety of issues in the mathematical development of computer science theory, particularly finite representations for languages and machines and Turing Machines. They also learn to determine the complexity and computability of algorithms, thereby obtaining insights into the capabilities and limitations of the computing machines.