 About the Tutorial:
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.
 About the Instructor(s):
Josh Grochow is an Assistant Professor in the Department of Computer Science at the University of Colorado at Boulder, where he is a member of the CS Theory Group. Before joining the University of Colorado, he was an Omidyar Fellow at the Santa Fe Institute. Prior to SFI, he was a postdoc in the University of Toronto CS Theory Group, and prior to that he got his Ph.D. at the University of Chicago.
His research has two main thrusts (with deep underlying relations beneath):
1) Interactions between theoretical computer science and mathematics (particularly algebraic geometry, representation theory, and group theory), and
2) Developing the theory of complex systems and complex networks, and applying this theory with his collaborators in a variety of fields, such as ecology, evolutionary biology, economics, climate, and beyond.
Read more about Josh Grochow at his website here.
 How to use Complexity Explorer:
 How to use Complexity Explorer
 Enrolled students:

1,358
 Prerequisites:
 Like this tutorial?
 Donate to help fund more like it
 Twitter link
Syllabus
 What is an algorithm?
 Absolute Limitations on Algorithms
 Resource limitations on algorithms
 Types of Algorithms
 P versus NP
 An algorithmic perspective on complex systems
 Algorithms for NPhard problems in the real world
 Randomized algorithms and derandomization
 Homework