Search Results for ""

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A map u:R^n->R^n from a domain G is called a map of class C^r if each component of u(x)=(u_1(x_1,...,x_n),...,u_m(x_1,...,x_n)) is of class C^r (0<=r<=infty or r=omega) in G, ...

Let a patch be given by the map x:U->R^n, where U is an open subset of R^2, or more generally by x:A->R^n, where A is any subset of R^2. Then x(U) (or more generally, x(A)) ...

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space for Y^X supplied with a compact-open topology is called a mapping space.

Let R(x) be the revenue for a production x, C(x) the cost, and P(x) the profit. Then P(x)=R(x)-C(x), and the marginal profit for the x_0th unit is defined by ...

A random process whose future probabilities are determined by its most recent values. A stochastic process x(t) is called Markov if for every n and t_1<t_2...<t_n, we have ...

A sequence X_1, X_2, ... of random variates is called Markov (or Markoff) if, for any n, F(X_n|X_(n-1),X_(n-2),...,X_1)=F(X_n|X_(n-1)), i.e., if the conditional distribution ...

If x takes only nonnegative values, then P(x>=a)<=(<x>)/a. (1) To prove the theorem, write <x> = int_0^inftyxP(x)dx (2) = int_0^axP(x)dx+int_a^inftyxP(x)dx. (3) Since P(x) is ...

The statistical index P_(ME)=(sump_n(q_0+q_n))/(sum(v_0+v_n)), where p_n is the price per unit in period n, q_n is the quantity produced in period n, and v_n=p_nq_n is the ...

If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...