Search Results for ""

Some computations allow shortcuts which can be used to speed them up. Consider the operation of raising a number to a positive integer power. It is possible, for example, to ...

In machine learning theory and artificial intelligence, a concept c over a domain X is a Boolean function c:X->{0,1}. A collection of concepts is called a concept class. In ...

"The" continuity axiom is an additional Axiom which must be added to those of Euclid's Elements in order to guarantee that two equal circles of radius r intersect each other ...

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