Why Are Turing Machines So Powerful? 🤔

Get 20% off your next adventure with No One with my code DFATM!

Here we look at the question of *why* Turing Machines (TMs) are more powerful than deterministic finite automata (DFAs). TMs have the ability to (1) read/write cells, (2) move left and right, and (3) acquire new memory. The question we address here is what of 1, 2, or 3 cause TMs to be more powerful - is it that all three have to work in conjunction to finally escape the regular languages?

(In case it's not obvious - this video is NOT sponsored by any actual entity.)

Easy Theory Website: https://www.easytheory.org
Discord: https://discord.gg/SD4U3hs

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

▶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 many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.