Все публикации

0:09:05

Residency Match (Stable Marriage Problem, Gale-Shapley Algorithm)

0:10:53

What Makes Mario NP-Hard? (Polynomial Reductions)

0:10:44

NP-Complete Explained (Cook-Levin Theorem)

0:08:26

What Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)

0:06:03

NP: How Non-determinism Relates to Verifiable Proofs

0:06:15

The Formal Definition of P (P vs NP)

0:10:10

P vs. NP - An Introduction

0:08:15

What Is Big O? (Comparing Algorithms)

0:12:57

Alan Turing - Giants of Computer Science

0:07:05

Gödel's Second Incompleteness Theorem, Proof Sketch

0:06:20

Gödel's First Incompleteness Theorem, Proof Sketch

0:06:54

Math's Existential Crisis (Gödel's Incompleteness Theorems)

0:06:50

Impossible Programs (The Halting Problem)

0:03:50

How to Abolish the Electoral College (National Popular Vote Interstate Compact)

0:06:57

Some Infinities ARE Bigger Than Other Infinities (Diagonalization)

0:05:44

How to Compare Infinities

0:06:23

How We Should Vote (Range Voting)

0:10:15

Is Democracy Impossible? (Arrow's Theorem)

0:03:27

What Is Computer Science?