Skip to content
Hallway
0:00 / 0:00

#turingmachine#automatatheory#finitestatemachine

Turing Machines

EngMicroLectures

14K subscribers • 1 video on Hallway

YouTube
  • Recommended by 1 person: 1 on Stack Overflow and its sister sites.

Beginner. No background in the topic needed.

530K views13 years ago1 recommendation

Computer scienceComputation and complexity

An overview of how Turing machines work and how they differ from finite state machines.

An overview of how Turing Machines work

Why it's here

1 person recommends this

What people say. Recommended as an enlightening explanation of the difference between a Turing machine and a finite state machine.

user5193682on Computer Science Stack Exchange • Recommends

On “Difference between a turing machine and a finite state machine?”

I had the same doubt and I saw two very enlightning videos and one explanation on Quora as follows: A finite state machine is just a set of states and transitions. The only memory it has is what state it is in. Thus, the number of memory states is... finite. A Turing machine is a finite state machine plus a tape memory. Each transition may be accompanied by an operation on the tape (move, read, write). I have understood from it that a turing machine uses/has a a finite state machine as part of its operating procedure, plus adding some editable memory to it. Please watch also those two videos, they are enlightning! link to this video link to this video
6View the answer