Introduction to the Theory of Computation (Full Course) - Easy Theory

Here we start a brand new series about the entire TOC class, about what a computer actually fundamentally is. It turns out we can simplify the model very greatly, by restricting the number of possible inputs, and the number of possible outputs. Then we look at how the machine operates, as it relates to the "states" during the course of computation.

Contribute: Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs

Live Streaming (Saturdays, Sundays 2PM GMT):

Merch: Language Hierarchy Apparel: https://teespring.com/language-hierarchy?pid=2&cid=2122 Pumping Lemma Apparel: 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. Give an informal argument as to why NOT fixing the internal memory changes the model.
2. If there are n memory cells in a computer, how many possible states are there?

▶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=xilR6Ky6JhU