Wolfram Language Paclet Repository

Community-contributed installable additions to the Wolfram Language

Primary Navigation

    • Cloud & Deployment
    • Core Language & Structure
    • Data Manipulation & Analysis
    • Engineering Data & Computation
    • External Interfaces & Connections
    • Financial Data & Computation
    • Geographic Data & Computation
    • Geometry
    • Graphs & Networks
    • Higher Mathematical Computation
    • Images
    • Knowledge Representation & Natural Language
    • Machine Learning
    • Notebook Documents & Presentation
    • Scientific and Medical Data & Computation
    • Social, Cultural & Linguistic Data
    • Strings & Text
    • Symbolic & Numeric Computation
    • System Operation & Setup
    • Time-Related Computation
    • User Interface Construction
    • Visualization & Graphics
    • Random Paclet
    • Alphabetical List
  • Using Paclets
    • Get Started
    • Download Definition Notebook
  • Learn More about Wolfram Language

TuringMachine

Guides

  • TuringMachine

Tech Notes

  • Exploring One-Sided Turing Machines

Symbols

  • MultiwayNonHaltedStatesLeft
  • MultiwayTuringMachineFunction
  • MultiwayTuringMachineRules
  • NonTerminatingTuringMachineQ
  • OneSidedTuringMachineFind
  • OneSidedTuringMachineFunction
  • OneSidedTuringMachinePlot
  • TuringMachineOutput
  • TuringMachineOutputWithStepsFloat
  • TuringMachineOutputWithSteps
  • TuringMachineOutputWithStepsWidthsFloat
  • TuringMachineOutputWithStepsWidths
  • TuringMachineRuleCases
  • TuringMachineRuleCount
  • TuringMachineSteps
  • TuringMachineStepsWidths
  • TuringMachineWidths

Overviews

  • TuringMachine
TuringMachine
This paclet provides tools for exploring and analyzing Turing machines, with an emphasis on the one-sided machines studied in A New Kind of Science. A machine is identified by its Wolfram enumeration number together with its state and color counts, written
{number,s,k}
. From that compact specification the paclet runs a machine on integer inputs and reads off its halting value, step count, and tape width; visualizes its space-time evolution; tabulates the behavior of whole rule spaces (backed by a Rust implementation); searches for rules that reproduce a given behavior; and explores nondeterministic (multiway) machines.
OneSidedTuringMachineFunction
— runs a one-sided machine on an integer input and returns its halting value, step count, or tape width
OneSidedTuringMachinePlot
— visualizes the space-time evolution of a one-sided machine
OneSidedTuringMachineFind
— finds the rules that reproduce a given set of outputs
TuringMachineRuleCount
— the number of distinct rules for given state and color counts
TuringMachineRuleCases
— the transition table of a single deterministic rule
TuringMachineOutput
— halted output values for every rule and input in a range
TuringMachineOutputWithSteps
— halted
{steps,output}
for every rule and input
TuringMachineOutputWithStepsWidths
— halted
{steps,output,width}
for every rule and input
TuringMachineSteps
— step counts for halting machines
TuringMachineWidths
— maximum head widths for halting machines
TuringMachineStepsWidths
—
{steps,width}
pairs for halting machines
TuringMachineOutputWithStepsFloat
— a numeric
{steps,output}
array
TuringMachineOutputWithStepsWidthsFloat
— a numeric
{steps,output,width}
array
MultiwayTuringMachineRules
— the multivalued transition table of a multiway machine
MultiwayTuringMachineFunction
— all tape values reachable from halted states
MultiwayNonHaltedStatesLeft
— how many states remain unexplored after a step bound
NonTerminatingTuringMachineQ
— tests whether a machine enters a cycle within a step bound
RelatedGuides
▪
ComputationalSystems
▪
One-sided Turing machines — A New Kind of Science | Online
""

© 2026 Wolfram. All rights reserved.

  • Legal & Privacy Policy
  • Contact Us
  • WolframAlpha.com
  • WolframCloud.com