Turing Machine Example 2: Exploring Additional Halting States
This more complex example of a Turing Machine introduces two states that halt the machine: Y and N. We will see that Turing Machines can solve a much broader range of problems.
Eric Haney
138 views • Mar 21, 2020
About this video
This more complex example of a Turing Machine introduces two states that halt the machine: Y and N. We will see that Turing Machines can solve a much broader variety of decision problems than DFAs can.
Video Information
Views
138
Duration
6:23
Published
Mar 21, 2020