Introduction to Computation Theory

Introduction to Computation Theory is an overview of some basic principles of computation and computational complexity, with an eye towards things that might actually be useful without becoming a researcher. Students will examine the formal mathematics for foundational computation proofs, as well as gain tools to analyze hard computational problems themselves. 

Students who take this course should have basic knowledge of the principles of graphs. Some tutorial material references linear algebra, but familiarity is not necessary. This tutorial uses proofs, and requires understandings of formal math notations.

1. What is an algorithm?
2. Absolute Limitations on Algorithms
3. Resource limitations on algorithms
4. Types of Algorithms
5. P versus NP
6. An algorithmic perspective on complex systems
7. Algorithms for NP-hard problems in the real world
8. Randomized algorithms and derandomization
9. Homework