Search Results for ""

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

A metatheorem stating that every theorem on partially ordered sets remains true if all inequalities are reversed. In this operation, supremum must be replaced by infimum, ...

A Julia set J consisting of a set of isolated points which is formed by taking a point outside an underlying set M (e.g., the Mandelbrot set). If the point is outside but ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

A hyperfunction, discovered by Mikio Sato in 1958, is defined as a pair of holomorphic functions (f,g) which are separated by a boundary gamma. If gamma is taken to be a ...

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...

In many cases, the Hausdorff dimension correctly describes the correction term for a resonator with fractal perimeter in Lorentz's conjecture. However, in general, the proper ...

A near noble number is a real number 0<nu<1 whose continued fraction is periodic, and the periodic sequence of terms is composed of a string of p-1 1s followed by an integer ...

A noble number nu is defined as an irrational number having a continued fraction that becomes an infinite sequence of 1s at some point, nu=[0,a_1,a_2,...,a_n,1^_]. The ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...