Search Results for ""

An additive cellular automaton is a cellular automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

If g(x) is differentiable at the point x and f(x) is differentiable at the point g(x), then f degreesg is differentiable at x. Furthermore, let y=f(g(x)) and u=g(x), then ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_4=f(x_4). Then Simpson's 3/8 rule ...

An outer-totalistic cellular automaton is a generalization of the totalistic cellular automaton. Totalistic rules are a proper superset of outer-totalistic rules. In ...

A mechanical device consisting of a sliding portion and a fixed case, each marked with logarithmic axes. By lining up the ticks, it is possible to do multiplication by taking ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

A tag system in which a list of n tag rules (each of a special form) is applied to a system in sequential order and then starting again from the first rule. In a cyclic tag ...

The box fractal is a fractal also called the anticross-stitch curve which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 0 ...

By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...