uniformity conjecture - Wolfram|Alpha

Uh oh! Wolfram|Alpha doesn't run without JavaScript.

Please enable JavaScript. If you don't know how, you can find instructionshere.Once you've done that, refresh this page to start using Wolfram|Alpha.

Input interpretation

uniformity conjecture

Alternate name

almost zero

Definition

The uniformity conjecture postulates a relationship between the syntactic length of expressions built up from the natural numbers using field operations, exponentials, and logarithms, and the smallest of nonzero complex numbers defined by such expressions. The Uniformity conjecture claims that if the expressions are written in an expanded form in which all the arguments of the exponential function have absolute value bounded by 1, then a small multiple of the syntactic length gives a bound for the number of decimal places needed to distinguish the defined number from zero. Richardson has systematically searched for counterexamples, but not found any.

More information »

Related terms

constant problem | Schanuel's conjecture

Subject classifications

MathWorld

transcendental numbers | unsolved problems

MSC 2010

11Jxx

POWERED BY THE WOLFRAM LANGUAGE

Related Queries:

Have a question about using Wolfram|Alpha?Contact Pro Premium Expert Support »

Give us your feedback »