ScratchData LogoScratchData
Back to Unlocked's profile

Turing Machine

UNUnlocked•Created January 4, 2019
Turing Machine
3
2
407 views
View on Scratch

Instructions

You can change the Turing machine ruleset in the project. It will support any ruleset and any number of states, though it only supports the values 1 and 0 (internally "true" and "false"). If a rule does not exist for a given value and state, the machine is considered to have entered a halt state. The default ruleset provided is the three-state "Busy Beaver" machine.

Description

This represents a Turing machine with binary values. (https://en.wikipedia.org/wiki/Turing_machine)

Project Details

Project ID277001161
CreatedJanuary 4, 2019
Last ModifiedJanuary 8, 2019
SharedJanuary 4, 2019
Visibilityvisible
CommentsAllowed