Computational Systems
The Wolfram System is the tool that has made possible Stephen Wolfram's exploration of the computational universe, and the emerging field of Wolfram Science (NKS). Whether for modeling, algorithm discovery, or basic NKS, the Wolfram Language has immediate built-in capabilities for the systematic study of a broad range of computational systems.
CellularAutomaton — general cellular automaton in 1D, 2D, etc.
TuringMachine — general Turing machine in 1D, 2D, etc.
SubstitutionSystem — general string, array, etc. substitution system in 1D, 2D, etc.
ShiftRegisterSequence — sequence from a linear or nonlinear feedback shift register
expr/.rule — apply a rule
NestList — iteratively apply a function or evolution rule
NestWhileList — iterate while checking for looping or termination
StringReplace, StringReplaceList — rewrite, substitution, and multiway systems
ArrayFlatten — flatten out steps in 2D substitution systems etc.
Groupings — generate all possible trees applying binary etc. operators to a list
RulePlot — visualize rules and evolutions of computational systems
ArrayPlot, ListPlot — visualize arrays of data
GraphPlot, TreePlot — visualize networks
AnglePath, AnglePath3D — generate paths from 2D, 3D angles
FindSequenceFunction — find functional forms for integer sequences