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
  • MultiwayTuringMachinePlot
  • MultiwayTuringMachineRules
  • NonTerminatingTuringMachineQ
  • OneSidedTuringMachineEvolution
  • OneSidedTuringMachineFind
  • OneSidedTuringMachineFunction
  • OneSidedTuringMachineFunctionPlot
  • OneSidedTuringMachinePlot
  • OneSidedTuringMachineRuntimePlot
  • TuringMachineOutput
  • TuringMachineOutputWithStepsFloat
  • TuringMachineOutputWithSteps
  • TuringMachineOutputWithStepsWidthsFloat
  • TuringMachineOutputWithStepsWidths
  • TuringMachineRuleCases
  • TuringMachineRuleCount
  • TuringMachineSteps
  • TuringMachineStepsWidths
  • TuringMachineWidths
  • TuringMachineWorstCasePlot
  • $PvsNPStyles

Overviews

  • TuringMachine
WolframInstitute`TuringMachine`
MultiwayTuringMachineFunction
​
MultiwayTuringMachineFunction
[rules,input,n]
traverses the nondeterministic Turing machine defined by the list of integer rules on input for at most n steps (assuming 2 states, 2 symbols).
​
​
MultiwayTuringMachineFunction
[{rules,s,k},input,n]
specifies the number of states s and symbols k.
​
​
MultiwayTuringMachineFunction
[{rules,s,k},input,target,n]
stops early if the target output is found.
​
Details and Options
Examples  
(1)
Scope  
(1)
Pass several inputs at once; the branch count traces how the three initial histories merge as the traversal proceeds:
In[1]:=
MultiwayTuringMachineFunction
[{12,13},{1,2,3},6]
Out[1]=
{{},{3,3,2,1,1,1,1},False}
SeeAlso
MultiwayTuringMachineRules
 
▪
MultiwayNonHaltedStatesLeft
 
▪
NonTerminatingTuringMachineQ
RelatedGuides
▪
TuringMachine
Traverse the multiway machine built from rules 12 and 13 on input 2 for 6 steps — it runs without halting, so no tape values are collected, the single branch stays active each step, and no cycle is detected:
In[1]:=
MultiwayTuringMachineFunction
[{12,13},2,6]
Out[1]=
{{},{1,1,1,1,1,1,1},False}
""

© 2026 Wolfram. All rights reserved.

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