ConceptSystems & CS
Algorithm
Step-by-step instructions for solving some problem.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Problem solving2Basic programming concepts1Computation1Imperative knowledge1Input and output representation1Problem statement1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
David J. Malan
Ana Bell
A sequence of simple steps, a flow of control process, and a means of determining when to stop.Onur Mutlu
A step-by-step procedure that is guaranteed to terminate where each step is precisely stated and can be carried out by a computer.Erik Demaine
A computational procedure for solving a problem by taking some input and generating some output.
Lectures that assume it
71The first 12 are shown.
- Overview and Introduction to Lisp: Procedural & Symbolic Abstraction
- Large Deviations
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Graph Theory and Coloring
- Cantor Diagonalization and Metric Spaces
- The Sherali-Adams Proof System
- Computational Indistinguishability
- Randomized Complexity: RP, coRP, and ZPP
- Grover's Algorithm
- Taylor's Series
- Doing with Images Makes Symbols (Part 2)
- Hardness within P
Connections
84The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures77
- Introduction to Computation and Python Programming
- Digital Design & Computer Architecture: Introduction and Basics
- Models of Computation, Random Access Machine & Document Distance
- Algorithms
- Scratch
- Programming
Show 71 moreShow fewer
- Overview and Introduction to Lisp: Procedural & Symbolic Abstraction
- Large Deviations
- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Graph Theory and Coloring
- Cantor Diagonalization and Metric Spaces
- The Sherali-Adams Proof System
- Computational Indistinguishability
- Randomized Complexity: RP, coRP, and ZPP
- Grover's Algorithm
- Taylor's Series
- Doing with Images Makes Symbols (Part 2)
- Hardness within P
- Randomization: Matrix Multiply, Quicksort
- Introduction, Finite Automata, Regular Expressions
- Reasoning About Programs
- Constraint Satisfaction Problems
- Dynamic Programming I: Fibonacci, Shortest Paths
- Artificial Intelligence
- Course Overview and Formal Definition of Computation
- How Hard is too Hard? An Introduction to Complexity
- Bisection Search and Newton-Raphson
- AVL Trees, Tree Rotations & Guaranteed O(log n) Height
- Thinking Above the Code
- C Programming
- Arrays
- Dynamic Programming: Advanced DP
- Incremental Improvement: Matching
- Turing Machines
- The Complexity Class NP
- Reductions
- NP-Completeness Reductions
- Functional Programming I: Higher-Order Procedures in Scheme
- A Collectivist, Economic Perspective on AI Systems
- Retroactive Data Structures
- New Bodies, Unconventional Minds: A Continuum of Cognition and Consciousness
- Cognitive Science Tools for Understanding LLM Behavior
- Cognitive Neuroscience Methods I
- Digital Design and Computer Architecture - L1: Intro: Fundamentals, Transistors, Gates
- TM Variants, Church-Turing Thesis
- The Importance of Mathematics
- Random Variables
- Hierarchy Theorems
- Efficient Fine-Grained Algorithms
- NP-Completeness and the Cook-Levin Theorem
- What is Complexity?
- Computational Complexity
- Recursion Trees and Binary Search Trees (MIT 6.006 Recitation 5)
- Mathematics and Computation: The Landscape of P vs. NP
- Space Complexity, PSPACE, Savitch's Theorem
- The Exponential Time Hypothesis: Foundations of Computational Hardness
- Arithmetic Geometry and Computation
- Beyond Brute Force: The Era of Adaptive Intelligence
- 10^500 Parallel Universes
- Nondeterminism
- Tail Bounds
- Synchronous Distributed Algorithms: Symmetry-Breaking and Shortest-Paths Spanning Trees
- Quantum Complexity
- Probabilistic Computation, BPP
- Scaling Laws
- Beyond Worst-Case Analysis
- How to do CS Theory
- The Forgotten Ideas in Computer Science
- Probabilistically Checkable Proofs of Proximity
- HSE Kolmogorov Complexity, Lecture 1: Computability and Solomonoff Induction
- Could Computing Be Simpler Than It Seems To Be?
- Numerical Linear Algebra Background
- Majority Is Stablest Theorem
- Quantum Computing Overview
- Zeitlin's Model for Ideal Hydrodynamics on the Sphere
- Teaching Functional Programming with Clojure in Academia: Insights and Challenges
- 2018 Bishop Lecture featuring Barbara Koenig, PhD