Computability, Complexity & Algorithms. Georgia Institute of Technology
It focuses on the big fundamental questions of computing, and how understanding the power and limitations of algorithms helps us develop the tools to make real-world computers smarter, faster and safer.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Intro to Theoretical Computer Science udacity.com
It teaches basic concepts in theoretical computer science, such as NP-completeness, and what they imply for solving tough algorithmic problems.
-
Goldreich. Computational Complexity: A Conceptual Perspective wisdom.weizmann.ac.il
A grad introduction to computation complexity theory, emphasizing the idea behind concepts of complexity theory.
-
Copeland, Posy & Shagrir (editors). Computability: Turing, Gödel, Church, and Beyond mitpress.mit.edu
Computer scientists, mathematicians, and philosophers discuss the conceptual foundations of the notion of computability as well as recent theoretical developments.
-
Advanced Algorithms courses.csail.mit.edu
-
Rudich & Wigderson. Computational Complexity Theory ams.org
Three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. Topics include reductions, lower-bounds, average-case complexity, randomness, interactive proof systems, probabilistically checkable proofs, quantum computing, and…
-
Computational Complexity youtube.com
Collection of workshops.
Theoretical Computer Science › Introductory > MOOC: “It focuses on the big fundamental questions of computing, and how understanding the power and limitations of algorithms helps us develop the tools to make real-world computers smarter, faster and safer.”