Search Results for ""
5331 - 5340 of 13134 for complexity theorySearch Results
An operator in logic which returns either true or false.
Predictability at a time tau in the future is defined by (R(x(t),x(t+tau)))/(H(x(t))), and linear predictability by (L(x(t),x(t+tau)))/(H(x(t))), where R and L are the ...
A prime magic square is a magic square consisting only of prime numbers (although the number 1 is sometimes allowed in such squares). The left square is the 3×3 prime magic ...
An n-manifold which cannot be "nontrivially" decomposed into other n-manifolds.
A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...
The symbol p^e∥n means, for p a prime, that p^e|n, but p^(e+1)n.
If B superset A (B is a superset of A), then P(A)<=P(B).
A specific prescription for carrying out a task or solving a problem. Also called an algorithm, method, or technique
p^~=|phi_i(x)><phi_i(t)| (1) p^~sum_(j)c_j|phi_j(t)>=c_i|phi_i(x)> (2) sum_(i)|phi_i(x)><phi_i(x)|=1. (3)
The product of any number of perspectivities.
...
View search results from all Wolfram sites (28442 matches)

