Search Results for ""

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

A Room square (named after T. G. Room) of order n (for n even) is an arrangement in an (n-1)×(n-1) square matrix of n objects such that each cell is either empty or holds ...

A generalization of the factorial and double factorial, n! = n(n-1)(n-2)...2·1 (1) n!! = n(n-2)(n-4)... (2) n!!! = n(n-3)(n-6)..., (3) etc., where the products run through ...

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...

Let (K,L) be a pair consisting of finite, connected CW-complexes where L is a subcomplex of K. Define the associated chain complex C(K,L) group-wise for each p by setting ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

An ordinary differential equation of the form x^my^'=f(x,y), where m is a positive integer, f is analytic at x=y=0, f(0,0)=0, and f_y^'(0,0)!=0. Zwillinger (1997, p. 120), ...

The partial differential equation (1+f_y^2)f_(xx)-2f_xf_yf_(xy)+(1+f_x^2)f_(yy)=0 (Gray 1997, p. 399), whose solutions are called minimal surfaces. This corresponds to the ...

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. ...

Let 0<p_1<p_2<... be integers and suppose that there exists a lambda>1 such that p_(j+1)/p_j>lambda for j=1, 2, .... Suppose that for some sequence of complex numbers {a_j} ...