Search Results for ""

The multiplicad is a simple example of an idea like the ruliad. It consists of a rulial multiway system based on the positive integers in which the rules simply multiply by ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

Continuum percolation can be thought of as a continuous, uncountable version of percolation theory-a theory which, in its most studied form, takes place on a discrete, ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

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 A and B be two algebras over the same signature Sigma, with carriers A and B, respectively (cf. universal algebra). B is a subalgebra of A if B subset= A and every ...

The game of life is the best-known two-dimensional cellular automaton, invented by John H. Conway and popularized in Martin Gardner's Scientific American column starting in ...

Take K a number field and L an Abelian extension, then form a prime divisor m that is divided by all ramified primes of the extension L/K. Now define a map phi_(L/K) from the ...