Computer Science
>
>

CS 251 Great Ideas in Theoretical Computer Science

Fall 2022

Carnegie Mellon University

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.

Course Page

Overview

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.

Prerequisites

No data.

Learning objectives

No data.

Textbooks and other notes

No data

Other courses in Theoretical Computer Science

15-453 - Formal Languages, Automata, and Computability

Spring 2015

Carnegie Mellon University

CS 263 Counting and Sampling

Autumn 2022

Stanford University

CSE 311 Foundations of Computing I

Autumn 2021

University of Washington

Courseware availability

Texts available at Text

Lecture videos available on YouTube at Lectures

Practices available at Practice

No other materials available

Covered concepts