A Turing machine is theoretical computer consisting of a finite set of internal states, a finite alphabet that includes a blank symbol, and a finite set of instructions. It has a physical head and a physical infinitely long tape, which is divided into cells. The cell values consist of the alphabet. The tape has a finite number of non-blank cells. The head can read and write to the cells and move the tape one cell to the left and one cell to the right. The Virtual Turing Machine lets you input tape values and an instruction set to see the output of a turing machine.


  • Computer Science > General
  • Mathematics > General

Education Levels:

  • Grade 1
  • Grade 2
  • Grade 3
  • Grade 4
  • Grade 5
  • Grade 6
  • Grade 7
  • Grade 8
  • Grade 9
  • Grade 10
  • Grade 11
  • Grade 12


Informal Education,Middle School,NSDL,oai:nsdl.org:2200/20110907110903814T,Computational Science,NSDL_SetSpec_ncs-NSDL-COLLECTION-000-003-112-055,Computer Science,Vocational/Professional Development Education,Mathematics,Computing and Information



Access Privileges:

Public - Available to anyone

License Deed:

Creative Commons Attribution Non-Commercial Share Alike


This resource has not yet been aligned.
Curriki Rating
'NR' - This resource has not been rated
'NR' - This resource has not been rated

This resource has not yet been reviewed.

Not Rated Yet.

Non-profit Tax ID # 203478467