Second Lecture on Godel's Incompleteness Theorem
Second Lecture on Godel's Incompleteness Theorem
Completion of the lecture on Godel's first incompleteness theorem.
2 May 2014
•
15mins
Godel for Goldilocks: Godel's First Incompleteness Theorem
Godel for Goldilocks: Godel's First Incompleteness Theorem
Godel's first incompleteness theorem, requiring minimal background. You only need to know what an integer is, what a fun... Read more
1 May 2014
•
1hr 11mins
L26: Minimizing the number of states in a DFA
L26: Minimizing the number of states in a DFA
Completion of the method to minimize the number of states in a DFA for any regular language. A by-product is a proof tha... Read more
10 Feb 2012
•
1hr 25mins
L25: Minimizing Finite State Machines
L25: Minimizing Finite State Machines
In this supplemental lecture we define what is meant by a minimized DFA, and introduce an efficient algorithm to minimiz... Read more
27 Jan 2012
•
1hr 13mins
Most Popular Podcasts
The Joe Rogan Experience
TED Talks Daily
The Tim Ferriss Show
The Daily
Stuff You Should Know
Oprah's SuperSoul Conversations
Armchair Expert with Dax Shepard
L24: NP Completeness, Supplemental lecture 3
L24: NP Completeness, Supplemental lecture 3
Supplemental lecture 3 on less formal treatment of NP-completeness.
13 Dec 2011
•
50mins
L23: NP Completeness, Supplemental lecture 2
L23: NP Completeness, Supplemental lecture 2
A second supplemental lecture on a more informal treatment of NP-completeness.
9 Dec 2011
•
45mins
L22: A more informal introduction to NP-completeness, Supplemental Lecture 1
L22: A more informal introduction to NP-completeness, Supplemental Lecture 1
This is a supplemental lecture Introducing the concept of NP through reductions. It was given in another course, but sin... Read more
3 Dec 2011
•
48mins
L21: NP-completeness
L21: NP-completeness
Formal definition of NP-completeness and polynomial-time reductions to prove additional languages are NP-complete once o... Read more
1 Dec 2011
•
1hr 12mins
L20: P, NP and polynomial-time reductions
L20: P, NP and polynomial-time reductions
P, NP, and polynomial-time reductions. Is P = NP?
29 Nov 2011
•
32mins
L19: Uncomputable functions, and introduction to complexity
L19: Uncomputable functions, and introduction to complexity
Proof by diagonalization that there are uncomputable functions; introduction to complexity theory, big-Oh notation, defi... Read more
22 Nov 2011
•
1hr 21mins
