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`
OneSidedTuringMachineFind
​
OneSidedTuringMachineFind
[rule,maxInput,n,{s,k}]
finds all s-state, k-color rules that reproduce the outputs of rule for inputs 1 to maxInput, each within n steps.
​
​
OneSidedTuringMachineFind
[{{input,steps,value},…},{s,k}]
finds the rules matching the given
{input,steps,value}
triples.
​
​
OneSidedTuringMachineFind
[{values},n,{s,k}]
finds the rules producing values for inputs 1, 2, …, each within n steps.
​
Details and Options
Examples  
(1)
Scope  
(1)
Count how many s=2, k=2 rules share that behavior:
In[1]:=
Length
OneSidedTuringMachineFind
[{{1,3,3},{2,1,3}},{2,2}]
Out[1]=
132
SeeAlso
OneSidedTuringMachineFunction
 
▪
TuringMachineRuleCount
 
▪
TuringMachineOutput
RelatedGuides
▪
TuringMachine
Rule 1500's own s=2, k=2 family reproduces its behavior on inputs 1 and 2, so the search contains the rule itself:
In[1]:=
MemberQ
OneSidedTuringMachineFind
[{{1,3,3},{2,1,3}},{2,2}],1500
Out[1]=
True
""

© 2026 Wolfram. All rights reserved.

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