Mathematics for Computer Science (2015)

Mathematics for Computer Science (2015)

Follow Mathematics for Computer Science (2015)

Share on

This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer c…

Albert R. Meyer

Sep 7, 2016 LATEST EPISODE
infrequent NEW EPISODES
10m AVG DURATION
111 EPISODES

Search for episodes from Mathematics for Computer Science (2015) with a specific topic:

Latest episodes from Mathematics for Computer Science (2015)

1.2.1 Proof by Contradiction

Play Episode Listen Later Sep 7, 2016 7:56

proof contradictions

1.1.3 Intro to Proofs: Part 2

Play Episode Listen Later Sep 7, 2016 7:07

1.1.1 Welcome to 6.042

Play Episode Listen Later Sep 7, 2016 2:14

1.1.2 Intro to Proofs: Part 1

Play Episode Listen Later Sep 7, 2016 9:31

3.2.6 Asymptotic Blunders

Play Episode Listen Later Aug 30, 2016 4:33

blunders asymptotic

1.9.1 State Machines Invariants: Video

Play Episode Listen Later Aug 10, 2016 26:00

state machines invariants

2.4.1 RSA Public Key Encryption: Video

Play Episode Listen Later Aug 10, 2016 21:45

encryption public key

2.10.3 Tree Coloring: Video

Play Episode Listen Later Aug 10, 2016 2:03

4.1.1 Tree Model: Video

Play Episode Listen Later Aug 10, 2016 25:24

1.8.1 Induction: Video

Play Episode Listen Later Aug 10, 2016 21:41

1.8.6 WOP vs Induction: Video [optional]

Play Episode Listen Later Jan 22, 2016 7:52

2.1.7 Prime Factorization: Video

Play Episode Listen Later Jan 22, 2016 7:48

prime factorization

2.3.3 The Ring Z: Video

Play Episode Listen Later Jan 22, 2016 16:50

2.10.1 Trees: Video

Play Episode Listen Later Jan 22, 2016 8:07

1.3.5 Well Ordering Principle 3: Video

Play Episode Listen Later Jan 22, 2016 6:03

principle ordering

1.4.4 Truth Tables: Video

Play Episode Listen Later Jan 22, 2016 12:57

1.11.11 Set Theory Axioms: Video [Optional]

Play Episode Listen Later Jan 22, 2016 9:19

optional axioms set theory

1.3.1 Well Ordering Principle 1: Video

Play Episode Listen Later Jan 22, 2016 5:38

principle ordering

1.3.3 Well Ordering Principle 2: Video

Play Episode Listen Later Jan 22, 2016 5:24

principle ordering

1.6.1 Sets Definitions: Video

Play Episode Listen Later Jan 22, 2016 12:00

2.8.3 Isomorphism: Video

Play Episode Listen Later Jan 22, 2016 11:03

1.8.4 Strong Induction: Video

Play Episode Listen Later Jan 22, 2016 10:03

2.11.5 Optimal Stable Matching: Video

Play Episode Listen Later Jan 22, 2016 9:06

optimal stable matching

3.1.9 Stirling's Formula: Video

Play Episode Listen Later Jan 22, 2016 5:51

4.1.3 Simplified Monty Hall Tree: Video

Play Episode Listen Later Jan 22, 2016 7:40

simplified monty hall hall tree

4.8.2 Stationary Distributions: Video

Play Episode Listen Later Jan 22, 2016 16:01

distributions stationary

1.10.4 Structural Induction: Video

Play Episode Listen Later Jan 22, 2016 6:15

2.11.1 Stable Matching: Video

Play Episode Listen Later Jan 22, 2016 11:19

stable matching

2.11.2 Mating Ritual: Video

Play Episode Listen Later Jan 22, 2016 9:18

2.6.3 Scheduling: Video

Play Episode Listen Later Jan 22, 2016 13:16

2.8.1 Degree: Video

Play Episode Listen Later Jan 22, 2016 11:18

2.10.5 Spanning Trees: Video

Play Episode Listen Later Jan 22, 2016 10:38

1.6.2 Sets Operations: Video

Play Episode Listen Later Jan 22, 2016 9:15

2.4.3 Reducing Factoring To SAT: Video

Play Episode Listen Later Jan 22, 2016 7:10

reducing factoring

2.9.1 Coloring: Video

Play Episode Listen Later Jan 22, 2016 16:20

2.9.3 Connectivity: Video

Play Episode Listen Later Jan 22, 2016 3:08

2.9.4 k-Connectivity: Video

Play Episode Listen Later Jan 22, 2016 8:14

2.3.1 Modular Exponentiation Euler's Function: Video

Play Episode Listen Later Jan 22, 2016 6:12

function modular

2.7.1 Partial Orders: Video

Play Episode Listen Later Jan 22, 2016 10:34

4.4.2 Random Variables: Independence: Video

Play Episode Listen Later Jan 22, 2016 15:31

independence variables

1.7.1 Relations: Video

Play Episode Listen Later Jan 22, 2016 25:12

1.10.7 Recursive Functions: Video

Play Episode Listen Later Jan 22, 2016 14:03

functions recursive

1.11.9 Russell's Paradox: Video

Play Episode Listen Later Jan 22, 2016 13:26

3.3.1 Sum And Product Rules: Video

Play Episode Listen Later Jan 22, 2016 7:27

4.4.1 Bigger Number Game: Video

Play Episode Listen Later Jan 22, 2016 12:19

4.4.4 Random Variables: Uniform & Binomial: Video

Play Episode Listen Later Jan 22, 2016 11:33

uniform variables binomial

4.8.1 Random Walks: Video

Play Episode Listen Later Jan 22, 2016 10:34

1.10.1 Recursive Data: Video

Play Episode Listen Later Jan 22, 2016 12:42

2.7.3 Representing Partial Orders As Subset Relations: Video

Play Episode Listen Later Jan 22, 2016 6:58

relations orders representing partial subset

1.4.1 Propositional Operators: Video

Play Episode Listen Later Jan 22, 2016 9:21

operators propositional

3.5.1 The Pigeonhole Principle: Video

Play Episode Listen Later Jan 22, 2016 4:13

principle pigeonhole

Claim Mathematics for Computer Science (2015)

In order to claim this podcast we'll send an email to with a verification link. Simply click the link and you will be able to edit tags, request a refresh, and other features to take control of your podcast page!