ChipsProcessorsEsoteric & theoretical › Turing machine

Turing machine

1936

The abstract machine Alan Turing described in 1936, a tape-and-head model that formally defines what is computable.

Turing machine Online Emulator

Play Turing machine using JavaScript directly in your browser.

Configurations

ConfigurationEmulatorMachineOSLegal
3-state Busy BeaverTuring machine simulatorTuring machineopenOpen ⛶
4-state Busy BeaverTuring machine simulatorTuring machineopenOpen ⛶
Binary incrementTuring machine simulatorTuring machineopenOpen ⛶

Machines

Emulators

EmulatorTypeLicenseSite
Morphett Turing Machine SimulatoronlineFreewareWebsite ↗
Turing Machine SimulatoronlineFreewareWebsite ↗
Turing machine simulatoronlinePublic domainWebsite ↗
turingmachine.ioonlineMITWebsite ↗

Reference & documentation

External technical references for programming Turing machine and for writing emulators.

ResourceTypeNotes
BB(5) champion machine - BusyBeaverWiki ↗FormatStandard compact TM text notation (1RB1LC_...)
Neary & Woods, Four Small Universal Turing Machines ↗Instruction setExplicit minimal universal transition tables to implement
Universal Turing machine (Wikipedia) ↗Instruction setTuring's action table and symbol encoding scheme
Morphett simulator - tuple language reference ↗Programmingstate symbol write direction newstate; documented tuple syntax
Turing, On Computable Numbers (1936, full text) ↗ReferenceOriginal paper defining the machine and its tables
Turing Machines (Stanford Encyclopedia of Philosophy) ↗ReferenceRigorous formal quadruple and transition-function definition
milosz08/turing-machine-simulator (source) ↗SourceDeterministic simulator with custom ASM compiler, TypeScript
The Busy Beaver Challenge - method & machine database ↗Test suite88M-machine database plus halting deciders to conform against
turingmachine.io interactive visualizer ↗ToolYAML-specified machines with animated tape execution
Morphett Turing machine simulator ↗ToolBrowser simulator with step, breakpoints, example programs