Search Results for ""

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

For a simple continued fraction x=[a_0,a_1,...] with convergents p_n/q_n, the fundamental recurrence relation is given by p_nq_(n-1)-p_(n-1)q_n=(-1)^(n+1).

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

A group having continuous group operations. A continuous group is necessarily infinite, since an infinite group just has to contain an infinite number of elements. But some ...

A functor F is called contravariant if it reverses the directions of arrows, i.e., every arrow f:A-->B is mapped to an arrow F(f):F(B)-->F(A).

The look and say sequence generated from a starting digit of 3, as given by Vardi (1991).

The apodization function A(x)=cos((pix)/(2a)). Its full width at half maximum is 4a/3. Its instrument function is I(k)=(4acos(2piak))/(pi(1-16a^2k^2)), which has a maximum of ...

A set function mu is said to possess countable subadditivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

A functor F is called covariant if it preserves the directions of arrows, i.e., every arrow f:A-->B is mapped to an arrow F(f):F(A)-->F(B).

The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...