Formalizing Computation

Finite Automata

Limits of Computation

Limits of Human Reasoning

Computational complexity

Time Complexity

Graph Theory

P vs NP

Randomized Algorithms

Cryptography

CS 251 Great Ideas in Theoretical Computer Science Carnegie Mellon University Fall 2022 A course offering rigorous study of computation, examining the central results and questions about the nature of computation, including finite automata, computational complexity, and cryptography. This course is about the rigorous study of computation, which is a fundamental component of our universe, the societies we live in, the new technologies we discover, as well as the minds we use to understand these things. Therefore, having the right language and tools to study computation is important. In this course, we explore some of the central results and questions regarding the nature of computation.   

CS 251 Great Ideas in Theoretical Computer Science

Theoretical Computer Science

Formalizing Computation

1 courses cover this concept

CS 251 Great Ideas in Theoretical Computer Science