Mathematical theory of computation

PUSHDOWN AUTOMATA | THEORY OF AUTOMATA AND FORMAL LANGUAGES | LECTURE 02 BY MR. AMIT GOEL | AKGEC

Quantum Algorithms Pt. 4 Optimization | Sabina Dragoi |QGSS26

Lec 28: CTL Encoding Exmaples

Lec 25: LTL_ Equivalence of Formulas, Adequate Set, Encoding Examples

Relation Algebra and the Limits of What Computers Can Decide Jas Semrl FAI CDT

Lec 24: LTL Encoding Examples

Lec 23: LTL: Syntax and Semantics

Sampling from the Sherrington-Kirkpatrick model up to β＜1/2

FINITE AUTOMATA | THEORY OF AUTOMATA & FORMAL LANGUAGES | LECTURE 01 MS. VIBHA SRIVASTAVA | AKGEC

Ground Energy estimation of Quantum Impurity model is in BQP

Gap Amplification for Local Hamiltonians with Combinatorial Soundness

Yang Wang: On regular copying languages

Classical algorithms for quantum Gibbs states

Two classical oracle separations between QMA and QCMA

Fault-Tolerance Against Adversarial Errors & PCPs

École d'été | 10 juin 2026: Applications of SAT Solvers par Joao Marques-Silva

Summer School | 10 June 2026: Applications of SAT Solvers by Joao Marques-Silva

École d'été | 10 juin 2026 : Bridging Theory and Practice with SAT and MaxSAT par Ruben Martins

Summer School | June 10, 2026: Bridging Theory and Practice with SAT and MaxSAT by Ruben Martins

École d'été | 10 juin 2026 : Boolean Is Not Too Restrictive par Pouya Shati

Summer School | June 10, 2026: Boolean Is Not Too Restrictive by Pouya Shati

How Hard is too Hard? An Introduction to Complexity - Colva Roney-Dougal

2.7.2 The minimisation of finite automata: the formal construction

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

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

Irit Dinur | Polylogues

#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

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

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