Universal turing machine, Slides of Theory of Automata

Download Universal turing machine and more Slides Theory of Automata in PDF only on Docsity!

Universal Turing

Machine

• (^) In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading both the description of the machine to be simulated as well as the input thereof from its own tape.

What is Universal Turing Machine?

Tape Content Read 1 st letter of tape Read first instruction Is the next state HALT? Update Tape Read the letter pointing head Go to next instruction

YES

NO

HALT & ACCEPT Find & remember what to write & where to move Update Tape write & Move LEFT,RIGHT or Stay If machine halts in a final state HALT & REJECT

YES

NO