1 - 10 of 96 for CellularAutomatonSearch Results
View search results from all Wolfram sites (321 matches)
CellularAutomaton   (Built-in Mathematica Symbol)
CellularAutomaton[rule, init, t] generates a list representing the evolution of the cellular automaton with the specified rule from initial condition init for t steps. ...
Cellular Automata   (Mathematica Tutorial)
Cellular automata provide a convenient way to represent many kinds of systems in which the values of cells in an array are updated in discrete steps according to a local ...
DataReversed   (Built-in Mathematica Symbol)
DataReversed is an option for ArrayPlot and related functions that specifies whether data should be plotted in reverse order.
Bitwise Operations   (Mathematica Guide)
Mathematica can represent bit vectors of arbitrary length as integers, and uses highly optimized algorithms—including several original to Wolfram Research—to perform bitwise ...
Computational Systems   (Mathematica Guide)
Mathematica 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 ...
PixelConstrained   (Built-in Mathematica Symbol)
PixelConstrained is an option for ArrayPlot which specifies how to constrain cells to align with displayed pixels.
Linear and Nonlinear Filters   (Mathematica Guide)
Mathematica's highly optimized filtering capabilities provide a wide range of linear and modern nonlinear local filters, as well as a variety of nonlocal filters, which can ...
Precollege Education   (Mathematica Guide)
Mathematica is widely used throughout the world for precollege education, in mathematics and many other fields. This page lists a few Mathematica functions used particularly ...
BitShiftRight   (Built-in Mathematica Symbol)
BitShiftRight[n, k] shifts the binary bits in the integer n to the right by k places, dropping bits that are shifted past the unit's position on the right. BitShiftRight[n] ...
BitShiftLeft   (Built-in Mathematica Symbol)
BitShiftLeft[n, k] shifts the binary bits in the integer n to the left by k places, padding with zeros on the right.BitShiftLeft[n] shifts one bit to the left.
1|2|3|4 ... 10 Next

...