11:16
ECS 220 8c:8.6-2 PSPACE-completeness
06:44
ECS 220 7c:7.5-2 existence of universal machines…
ECS 220 7c:7.5-2 existence of universal machines and the Church-Turing thesis
05:26
ECS 220 6c:7.2-4 Gödel’s…
ECS 220 6c:7.2-4 Gödel’s Incompleteness Theorem (consistency)
06:36
ECS 220 6c:7.2-3 Gödel’s…
ECS 220 6c:7.2-3 Gödel’s Incompleteness Theorem (soundness)
05:55
ECS 220 6c:7.2-2 From undecidable problems to…
ECS 220 6c:7.2-2 From undecidable problems to unprovable truths
14:13
ECS 220 6a:7.1 axiomatic foundation of mathematics
07:50
ECS 220 5c:6.6 why is it hard to prove P neq NP
09:25
ECS 220 5b:6.6-4 two lemmas and full proof of…
ECS 220 5b:6.6-4 two lemmas and full proof of Ladner_s theorem
05:38
ECS 220 5b:6.6-3 clocked programs
08:37
ECS 220 4b:6.1-2 relation of NP to finding…
ECS 220 4b:6.1-2 relation of NP to finding mathematical proofs
04:42
ECS 220 2b:4.3-4 logical structure of NP and coNP
15:52
ECS 120 10b:2 the real numbers are uncountable…
ECS 120 10b:2 the real numbers are uncountable and the Continuum Hypothesis
06:58
ECS 120 5a:4 direct proof that uu is not regular
11:48
ECS 120 2b:3 formal definition of CFG semantics
03:16
ECS 120 1b:2 formal models of computation
03:36
ECS 120 0:5 Boolean logic (discrete math review)
AggieVideo video portal by Academic Technology ServicesUC Davis | Information and Educational Technology | User Guides and Technical Documentation