Mathematical theory of computation

2.3.1 What is a finite automaton?

LIMDD A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States

Venkatesan Guruswami | Polylogues

On the Complexity of Decoded Quantum Interferometry

Prof. Jeremy Avigad | The Lean Theorem Prover

No Entendiste El Juego De La Vida (Hasta Ver ESTE Video)

You Didn't Understand The Game Of Life (Until Watching THIS Video)

Lightning Talks by Simons Institute Fellows

Forum Numerica - Andrea CLEMENTI - Investigating the collective behaviour of elementary agents

Les Machines de Turing

Turing Machines

Computation and the Foundations of Physics, Mathematics and AI

This Forgotten Idea Is Taking Over Computing

Models of Computation

Lecture 4: State Machines

5 SAT Problems (English)

4 P, NP, NP completeness (English)

13 Approximability and Decidability (English)

Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 1

Irit Dinur | Polylogues

QEC and Quantum Information Theory: Lecture 17 Fault-tolerant Quantum Computing

#69/100: The order of measuring doesn't matter || Quantum Computer Programming in 100 Easy Lessons

#54/100 Grover's Algorithm, Part 1 || Quantum Computer Programming in 100 Easy Lessons

Random Reversible Circuits || For Tim Gowers's 60th Birthday Workshop

Surface codes: Towards practical large-scale quantum computation

Quantum Finite Automata: A Modern Introduction

Polynomial Nonlinear Algorithms for NP & #P Problems

A problem re the k-Consistency Algorithm for CSPs || @ CMU || Recitation 11 of CS Theory Toolkit

Quantum Computation and Quantum Information: Lecture 37 (Fourier transform and phase-estimation)

Moments, Concentration, and Initializing an Array || @ CMU || Recitation 4 of CS Theory Toolkit

Panteleev--Kalachev Codes: Asymptotically good quantum LDPC codes and classical LTCs

The Switching Lemma

IQIS Lecture 6.2 — Abstract computation and reversible computation

P=NP?

AQIS '20: Zhengfeng Ji, Spooky complexity at a distance

AQIS '20: François Le Gall, Average-Case Quantum Advantage with Shallow Circuits

Noisy Variational Quantum Algorithm Simulation lecture by Yipeng Huang

Dinur's proof of the PCP Theorem: the Powering step || @ CMU || Lecture 27d of CS Theory Toolkit

Dinur's PCP: degree-reduction, expanderizing, mini-PCP || @ CMU || Lecture 27c of CS Theory Toolkit

Dinur's Proof of the PCP Theorem: outline || @ CMU || Lecture 27b of CS Theory Toolkit

Statement of the PCP Theorem || @ CMU || Lecture 27a of CS Theory Toolkit

NP-Hardness of Approximation || @ CMU || Lecture 26e of CS Theory Toolkit