Search Results for ""

An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...

A recursively enumerable set A is creative if its complement is productive. Creative sets are not recursive. The property of creativeness coincides with completeness. Namely, ...

Let x->y and u->v be two rules of a term rewriting system, and suppose these rules have no variables in common. If they do, rename the variables. If x_1 is a subterm of x (or ...

An unsolvable problem in logic dating back to the ancient Greeks and quoted, for example, by German philosopher Carl von Prantl (1855). The dilemma consists of a crocodile ...

The science of adversarial information protection.

The symbol union , used for the union of sets, and, sometimes, also for the logical connective OR instead of the symbol v (vee). In fact, for any two sets A and B x in A ...

The Curry triangle, also sometimes called the missing square puzzle, is a dissection fallacy created by American neuropsychiatrist L. Vosburgh Lions as an example of a ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

A cyclic graph is a graph containing at least one graph cycle. A graph that is not cyclic is said to be acyclic. A cyclic graph possessing exactly one (undirected, simple) ...