08:19
Creating the Euclidean Algorithm
07:10
Divisibility and the GCD
03:59
The Division Algorithm
04:37
The Fundamental Theorem of Arithmetic
08:23
Properties of Primes
08:12
Prime Divisors of a Product
07:43
Introduction to Primes
06:18
Divisibility
09:47
The Knapsack Problem: Example
07:51
The Knapsack Problem: Creating the Algorithm
08:43
Introduction to Dynamic Programming
05:32
Solving Linear Recurrence Relations With Exponential Forcing
07:07
Solving Linear Recurrence Relations With Polynomial Forcing Terms
08:15
Rewriting Nonhomogeneous Recurrence Relations
05:23
Introduction to Nonhomogeneous Recurrence Relations
03:27
Linear Recurrence Relation: Repeated Roots
05:06
Solving Linear Recurrence Relations
08:11
Time Complexity: Multidigit Multiplication
05:42
Time Complexity: Multidigit Addition
09:20
Time Complexity: Merge Sort
07:03
Recurrence Relations: Closed Forms
04:45
Time Complexity from a Recurrence Relation: Introduction
09:19
Divide and Conquer: Horner's Method
09:23
Divide and Conquer: Merge Sort
06:28
Finding Big O
05:08
Logarithmic and Exponential Complexity
08:55
Ranking Complexity Categories
07:52
Finding the Order of a Function
04:49
Finding the Order Not
07:58
Big O, Omega, and Theta
07:07
Complexity Functions
05:45
Introduction to Time Complexity Analysis
00:56
Just Go Do It
06:35
Time Complexity: Search Algorithms
06:38
Introduction to Algorithms
01:04
First Time Comedy Act
06:24
Undecidability
07:18
Description Numbers
07:51
The Halting Problem
04:48
More Turing Machines
07:16
Combinatorics in India
09:23
Turing Machines With Doubly Infinite Tapes
07:28
A Turing Machine for a Non CFL, Part Two
05:39
A Turing Machine for a Non CFL, Part One
05:49
Creating a Turing Machine Part Two
08:59
Combinatorics and Poetry
09:43
Creating a Turing Machine: Part One
06:53
Turing Machines: Halt States
08:59
Turing Machines
07:03
Introduction to Turing Machines
09:16
Hamilton and Complex Numbers
06:20
Using the Pumping Lemma for CFGs
06:55
The Pumping Lemma for CFGs
08:42
Derivative Trees for Chomsky Normal Forms
05:12
Chomsky Normal Form
07:55
Computing with Roman Numerals
08:40
Derivations Using a PDA
05:59
The Two Types of Acceptance
06:25
Acceptance by Empty Stack
08:53
Constructing a Pushdown Automaton
X
About
"Specialization is for insects" (Robert Heinlein). While most of these videos relate to college-level and pre-service mathematics, you'll find videos on other topics as well.
If you're looking to learn mathematics, then it is my objective and completely unbiased opinion that these are the best video lectures available anywhere: trust me, I'm on the internet.
But learning mathematics takes a little more than just watching videos. It's like becoming a tennis player. You can watch all the videos you want on how to throw a touchdown, but sooner or later you have to jump into the water. I've put together the videos in a self-directed study site; you can find more information about it at:
www.myopenmath.com/course/public.php?cid=107664
Tags