Theory of Computation (a brief introduction)

This is a brief introduction to what is the theory of computation, and why should we care. With the help of a friend, Emile, we explain 4 subfields of the ~Theory of Computation~ (language theory, automata theory, computability theory, and complexity theory) and go through an example, 3-COLORABLE. Hopefully you gain a better understanding of how these theories enhance our knowledge of computer science, and build upon each other 👩‍💻. Links to resources if you'd like to learn more: ⭐️ http://users.cms.caltech.edu/~umans/cs21/lec1.pdf (some of this video was based off the first lecture of Caltech's CS21 course) ⭐️ https://cs.lmu.edu/~ray/notes/cstheories/ (where the 4 languages graphic is from) ⭐️ https://www.youtube.com/channel/UCZh5kO3E9oC91ZSLYpiDtQw/videos (Lydia make super helpful animated videos breaking down CS theory that helped me understand!) This video was made as a part of Cards Against Humanity's Science Ambassador Scholarship. As the 2021 recipient, each semester throughout my undergraduate education at Caltech I'll be creating new videos about the cool STEM topics that I am studying! Subscribe to see more.