Search Results for ""

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

Let R[z]>0, 0<=alpha,beta<=1, and Lambda(alpha,beta,z)=sum_(r=0)^infty[lambda((r+alpha)z-ibeta)+lambda((r+1-alpha)z+ibeta)], (1) where lambda(x) = -ln(1-e^(-2pix)) (2) = ...

Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...

An equilibrium point in game theory is a set of strategies {x^^_1,...,x^^_n} such that the ith payoff function K_i(x) is larger or equal for any other ith strategy, i.e., ...

A moment sequence is a sequence {mu_n}_(n=0)^infty defined for n=0, 1, ... by mu_n=int_0^1t^ndalpha(t), where alpha(t) is a function of bounded variation in the interval ...

Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...

A real-valued univariate function f=f(x) has a jump discontinuity at a point x_0 in its domain provided that lim_(x->x_0-)f(x)=L_1<infty (1) and lim_(x->x_0+)f(x)=L_2<infty ...