Search Results for ""

The infimum is the greatest lower bound of a set S, defined as a quantity m such that no member of the set is less than m, but if epsilon is any positive quantity, however ...

The Kubo-Martin-Schwinger (KMS) condition is a kind of boundary-value condition which naturally emerges in quantum statistical mechanics and related areas. Given a quantum ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

The decimal expansion of the natural logarithm of 2 is given by ln2=0.69314718055994530941... (OEIS A002162). It was computed to 10^(11) decimal digits by S. Kondo on May 14, ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

A quintic graph is a graph which is 5-regular. The only quintic graph on n<=7 nodes is the complete graph K_6. Quintic graphs exist only on even numbers of nodes, and the ...

Rule 220 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 222 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 ...