Skip to content
lectern.tv
Probability, Primes & Computational Hardness →0/6
1

Introduction and Proofs (MIT 6.042J, Lecture 1)

Tom Leighton · 44:09

2

Probability and Counting

Joe Blitzstein · 46:29

3

Story Proofs, Axioms of Probability

Joe Blitzstein · 45:40

4

Structure and Randomness in the Prime Numbers

Terence Tao · 47:51

5

Mathematics and Computation: The Landscape of P vs. NP

Avi Wigderson · 1:02:49

6

What Can the Theory of Cryptography Tell Us About AI Verification?

Shafi Goldwasser · 1:02:15

Introduction and Proofs (MIT 6.042J, Lecture 1)

Tom LeightonMIT

Professor of Applied Mathematics

44:09·2012·undergraduate level
Path step 1: Establishes mathematical proof structure, predicates, and axiomatic deduction for CS.

This introductory lecture establishes fundamental concepts of mathematical reasoning, including direct proofs, proofs by contradiction, and the structure of propositions and predicates within discrete mathematics.

Systems & CSMathematical LogicProof TheorySet TheoryDiscrete Mathematics

Lecture 1: Introduction and Proofs

Instructor: Tom Leighton

View the complete course: http://ocw.mit.edu/6-042JF10

More courses at http://ocw.mit.edu

Next · Step 2

Probability and Counting

Comments

Add a comment...Sign in