Starting a new Lecture Notes Series on MIT RES.9-003 Brains, Minds and Machines Summer Course, Summer 2015
.png)
Youtube Lecture Playlist CreditsChannel Name: MIT OpenCourseWare
So Let Us Start to This Journey of Learning
MIT RES.9-003 Brains, Minds and Machines Summer Course, Summer 2015 By Lecture Notes together!
Lecture 1: 1.1.1 Welcome to 6.042
Lecture 2: 1.1.2 Intro to Proofs: Part 1
Lecture 3: 1.1.3 Intro to Proofs: Part 2
Lecture 4: 1.2.1 Proof by Contradiction
Lecture 5: 1.2.3 Proof by Cases
Lecture 6: 1.3.1 Well Ordering Principle 1: Video
Lecture 7: 1.3.3 Well Ordering Principle 2: Video
Lecture 8: 1.3.5 Well Ordering Principle 3: Video
Lecture 9: 1.4.1 Propositional Operators: Video
Lecture 10: 1.4.3 Digital Logic: Video
Lecture 11: 1.4.4 Truth Tables: Video
Lecture 12: 1.5.1 Predicate Logic 1: Video
Lecture 13: 1.5.2 Predicate Logic 2: Video
Lecture 14: 1.5.4 Predicate Logic 3: Video
Lecture 15: 1.6.1 Sets Definitions: Video
Lecture 16: 1.6.2 Sets Operations: Video
Lecture 17: 1.7.1 Relations: Video
Lecture 18: 1.7.3 Relational Mappings: Video
Lecture 19: 1.7.5 Finite Cardinality: Video
Lecture 20: 1.8.1 Induction: Video
Lecture 21: 1.8.2 Bogus Induction: Video
Lecture 22: 1.8.4 Strong Induction: Video
Lecture 23: 1.8.6 WOP vs Induction: Video [optional]
Lecture 24: 1.9.1 State Machines Invariants: Video
Lecture 25: 1.9.3 Derived Variables: Video
Lecture 26: 1.10.1 Recursive Data: Video
Lecture 27: 1.10.4 Structural Induction: Video
Lecture 28: 1.10.7 Recursive Functions: Video
Lecture 29: 1.11.1 Cardinality: Video
Lecture 30: 1.11.3 Countable Sets: Video
Lecture 31: 1.11.4 Cantor's Theorem: Video
Lecture 32: 1.11.7 The Halting Problem: Video [Optional]
Lecture 33: 1.11.9 Russell's Paradox: Video
Lecture 34: 1.11.11 Set Theory Axioms: Video [Optional]
Lecture 35: 2.1.1 GCDs & Linear Combinations: Video
Lecture 36: 2.1.2 Euclidean Algorithm: Video
Lecture 37: 2.1.4 Pulverizer: Video
Lecture 38: 2.1.6 Revisiting Die Hard: Video
Lecture 39: 2.1.7 Prime Factorization: Video
Lecture 40: 2.2.1 Congruence mod n: Video
Lecture 41: 2.2.3 Inverses mod n: Video
Lecture 43: 2.3.3 The Ring Z: Video
Lecture 44: 2.4.1 RSA Public Key Encryption: Video
Lecture 45: 2.4.3 Reducing Factoring To SAT: Video
Lecture 46: 2.5.1 Digraphs: Walks & Paths: Video
Lecture 47: 2.5.3 Digraphs: Connected Vertices: Video
Lecture 48: 2.6.1 DAGs: Video
Lecture 49: 2.6.3 Scheduling: Video
Lecture 50: 2.6.5 Time versus Processors: Video
Lecture 51: 2.7.1 Partial Orders: Video
Lecture 53: 2.7.4 Equivalence Relations: Video
Lecture 54: 2.8.1 Degree: Video
Lecture 55: 2.8.3 Isomorphism: Video
Lecture 56: 2.9.1 Coloring: Video
Lecture 57: 2.9.3 Connectivity: Video