Search Results for ""

"At least one" is a mathematical term meaning one or more. It is commonly used in situations where existence can be established but it is not known how to determine the total ...

The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...

An automorphic function f(z) of a complex variable z is one which is analytic (except for poles) in a domain D and which is invariant under a countably infinite group of ...

Propositional calculus, first-order logic, and other theories in mathematical logic are defined by their axioms (or axiom schemata, plural: axiom schemata) and inference ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a and a formula A(y) of a set x consisting of all elements of a satisfying A(y), exists x ...

Every irrational number x has an approximation constant c(x) defined by c(x)=lim inf_(q->infty)q|qx-p|, where p=nint(qx) is the nearest integer to qx and lim inf is the ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

Barban's constant is defined as C_(Barban) = product_(p)[1+(3p^2-1)/(p(p+1)(p^2-1))] (1) = 2.596536... (2) (OEIS A175640), where the product is over the primes p.

If a contour in the complex plane is curved such that it separates the increasing and decreasing sequences of poles, then ...