What are sets (in theory of computation)?

Here we do a different video than usual, by looking at the underlying object used in theory: sets. This is a background material video for anyone who wants to understand any other video on this channel, and to do theory at all. Sets are very simple objects, but they have incredibly powerful behavior when we look at more "complicated" sets. Here we look at some simple operations, such as union, intersection, set difference, powerset, and the Cartesian product of two small sets.

Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs Teespring: https://teespring.com/pumping-lemma-for-regular-lang

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

▶ADDITIONAL QUESTIONS◀

1. Can you describe, using set operations, given three sets A, B, C, the set of all elements that are in at least two of the three sets?
2. How can one show that |A| = |B| if A, B are infinitely large sets? For example, if A was the integers, and B were the positive integers?
3. Is there a "set of all sets"?

▶SEND ME THEORY QUESTIONS◀ ryan.e.dougherty@icloud.com

▶ABOUT ME◀ I am a professor of Computer Science, and am passionate about CS theory. I have taught over 12 courses at Arizona State University, as well as Colgate University, including several sections of undergraduate theory. ... https://www.youtube.com/watch?v=-X7X78X6C7c