To support our site, Class Central may be compensated by some course providers.

Introduction to Computation Theory

Santa Fe Institute via Complexity Explorer

students interested

Taken this course? Share your experience with other students. Write review

Overview

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.

 

Syllabus

  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

 

Taught by

Josh Grochow

Reviews for Complexity Explorer's Introduction to Computation Theory
Based on 0 reviews

  • 5 star 0%
  • 4 star 0%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free

Never stop learning Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.