Great Ideas in Theoretical Computer Science: Countability and Diagonalization

Great Ideas in Theoretical Computer Science: Countability and Diagonalization

Ryan O'Donnell via YouTube Direct link

Introduction

1 of 21

1 of 21

Introduction

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Great Ideas in Theoretical Computer Science: Countability and Diagonalization

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 Quiz
  3. 3 Galileo
  4. 4 Characters
  5. 5 The Last Word
  6. 6 The Great Other Neutral Guy
  7. 7 Definition of Cardinality
  8. 8 Definition of bijection
  9. 9 Objection
  10. 10 Transitivity
  11. 11 Order of Complex Numbers
  12. 12 Countably Infinite
  13. 13 Countable
  14. 14 Notation
  15. 15 Surjections
  16. 16 Countability
  17. 17 Infinite Sets
  18. 18 Dedekind
  19. 19 Infinite Binary Strings
  20. 20 Diagonal Argument
  21. 21 Set Size Taxonomy

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.