FoundationsTheory of Computation
Theory of Computation
Starting page for a quick review of Theory of Computation
Quick Review
This category is designed for quick review (Cheat Sheet), summarizing foundational theories of Computer Science on which problems can be computed and which cannot.
Theory of Computation (TOC)
Theory of Computation is a core branch of Computer Science that focuses on studying which problems a Computer can solve (Computability) and how much Resource is needed to solve them (Complexity), using Mathematics and Logic to create execution models.
Select a topic to review (Bento Grid):
Automata Theory
Abstract Machines, State, DFA, NFA, Regular Expressions, and CFG
Computability Theory
Turing Machines, Decidability, and the Halting Problem
Complexity Theory
Time / Space Complexity, P vs NP, and NP-Completeness
Interactive Labs (PBL)
Problem-Based Learning scenarios with Socratic AI Prompts