Search Results for ""

A function H that maps an arbitrary length message M to a fixed length message digest MD is a one-way hash function if 1. It is a one-way function. 2. Given M and H(M), it is ...

Consider the sequence {x_n}_(n=0)^infty defined by x_0=1 and x_(n+1)=[3/2x_n], where [z] is the ceiling function. For n=0, 1, ..., the first few terms are 1, 2, 3, 5, 8, 12, ...

In its simplest form, the principle of permanence states that, given any analytic function f(z) defined on an open (and connected) set U of the complex numbers C, and a ...

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...

An idealized computing machine consisting of a fixed set of data registers and set of instructions for operating on them. Register machines are also known as counter machines ...

The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

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

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

One of the beautiful arrangements of circles found at the Temple of Osiris at Abydos, Egypt (Rawles 1997). The pattern also appears in Italian art from the 13th century ...

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...