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
WolframInstitute`TuringMachine`
MultiwayNonHaltedStatesLeft
​
MultiwayNonHaltedStatesLeft
[rules,input,n]
gives the number of non-halted states left in the traversal queue after exploring the multiway machine rules for up to n steps (assuming 2 states, 2 symbols).
​
​
MultiwayNonHaltedStatesLeft
[rules,s,k,input,n]
specifies the number of states s and symbols k.
​
Details and Options
▪
A multiway machine is given by a list of integer rule numbers; its traversal branches wherever transitions disagree.
▪
The result is the size of the frontier — branches not yet halted — after n steps, so a value of
0
means every branch has halted within the bound.
Examples  
(0)
SeeAlso
MultiwayTuringMachineFunction
 
▪
MultiwayTuringMachineRules
 
▪
NonTerminatingTuringMachineQ
RelatedGuides
▪
TuringMachine
After 5 steps the multiway machine built from rules 12 and 13 on input 2 has no unexplored branches:
In[1]:=
MultiwayNonHaltedStatesLeft
[{12,13},2,5]
Out[1]=
0
""

© 2026 Wolfram. All rights reserved.

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