Search Results for ""

Every finite group G of order greater than one possesses a finite series of subgroups, called a composition series, such that I<|H_s<|...<|H_2<|H_1<|G, where H_(i+1) is a ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

The computational paradigm is a term introduced by Wolfram (2002, 2021) to describe the idea of using simple programs rather than mathematical equations (the latter of which ...

Two geometric figures are said to be concentric if their centers coincide. The region between two concentric circles is called an annulus. The following table summarizes some ...

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

It is conjectured that any convex body in n-dimensional Euclidean space has an interior point lying on normals through 2n distinct boundary points (Croft et al. 1991). This ...

Let X and Y be sets, and let R subset= X×Y be a relation on X×Y. Then R is a concurrent relation if and only if for any finite subset F of X, there exists a single element p ...

The conditional intensity lambda(t) associated to a temporal point process N is defined to be the expected infinitesimal rate at which events are expected to occur around ...

In voting theory, a Condorcet candidate is a candidate who always wins in a 2-person election but loses in larger election. For example, consider the 6-tuples of 6-sided die ...

The mapping of a grid of regularly ruled squares onto a cone with no overlap or misalignment. Cone nets are possible for vertex angles of 90 degrees, 180 degrees, and 270 ...