Search Results for ""

An abstract machine is a model of a computer system (considered either as hardware or software) constructed to allow a detailed and precise analysis of how the computer ...

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

There are two camps of thought on the meaning of general recursive function. One camp considers general recursive functions to be equivalent to the usual recursive functions. ...

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

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function, and define the aliquot sequence of n by ...

The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...

A Bill picture is a sequence of nested regular polygons in which subsequent polygons are each rotated so that they begin one vertex further. The term was coined by Trott ...

A bounded operator T:V->W between two Banach spaces satisfies the inequality ||Tv||<=C||v||, (1) where C is a constant independent of the choice of v in V. The inequality is ...

Consider a unit circle and a radiant point located at (mu,0). There are four different regimes of caustics, illustrated above. For radiant point at mu=infty, the catacaustic ...