Here we look at the final variant of Turing Machines: the nondeterministic TM (NTM), which allows any number of transitions from any state and tape symbol observed. We show how to have a deterministic TM simulate such a machine with the "computation tree" approach (although it isn't actually a tree!). The idea is to do a "breadth first search" of the tree, one level at a time, and if a q_accept is reached, then we accept. If not, we have to do several things to make sure this machine is a decider iff the original nondeterministic machine was, but it can be done.
Easy Theory Website: www.easytheory.org
Become a member: / @easytheory
Donation (appears on streams): streamlabs.com/easytheory1/tip
Paypal: paypal.me/easytheory
Patreon: / easytheory
Discord: / discord
#easytheory
KZitem Live Streaming (Sundays) - subscribe for when these occur.
Social Media:
Facebook Page: / easytheory
Facebook group: / easytheory
Twitter: / easytheory
Merch:
Language Hierarchy Apparel: teespring.com/language-hierar...
Pumping Lemma Apparel: teespring.com/pumping-lemma-f...
If you like this content, please consider subscribing to my channel: / @easytheory
Gold Supporters: Micah Wood
Silver Supporters: Timmy Gy
▶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.
Негізгі бет Nondeterministic Turing Machines (NTMs), what are they?
Пікірлер: 6