AbstractThe first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive reformulation of Sierpinski's construction which produces a computable absolutely normal number
In a recent paper, Richard Crandall and the present author established that each of a certain class ...
Report sets new method of defining computable functions. This is formalization of traditional functi...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractThe first example of an absolutely normal number was given by Sierpinski in 1916, twenty yea...
We give an algorithm that computes an absolutely normal Liouville number. 1 The main result The set ...
A real number x is absolutely normal if, for every base b ≥ 2, every two equally long strings of dig...
Among the currently known constructions of absolutely normal numbers, the one given by Mordechay Lev...
We give an algorithm to compute an absolutely normal number so that the first n digits in its binary...
Graduation date: 2012The notion of a normal number and the Normal Number Theorem date back over 100 ...
La normalidad es una forma débil de azar. Un número real es normal en una base entera dada si su exp...
AbstractIn an unpublished manuscript, Alan Turing gave a computable construction to show that absolu...
For any class F of total functions in the set N of the natural numbers, we define the notion of F-co...
A number is normal to the base r if, in its expansion to that base, all possible digit strings of le...
In this paper, I present an introduction to computability theory and adopt contemporary mathematical...
We give a construction of an absolutely normal real number x such that for every integer b greater t...
In a recent paper, Richard Crandall and the present author established that each of a certain class ...
Report sets new method of defining computable functions. This is formalization of traditional functi...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
AbstractThe first example of an absolutely normal number was given by Sierpinski in 1916, twenty yea...
We give an algorithm that computes an absolutely normal Liouville number. 1 The main result The set ...
A real number x is absolutely normal if, for every base b ≥ 2, every two equally long strings of dig...
Among the currently known constructions of absolutely normal numbers, the one given by Mordechay Lev...
We give an algorithm to compute an absolutely normal number so that the first n digits in its binary...
Graduation date: 2012The notion of a normal number and the Normal Number Theorem date back over 100 ...
La normalidad es una forma débil de azar. Un número real es normal en una base entera dada si su exp...
AbstractIn an unpublished manuscript, Alan Turing gave a computable construction to show that absolu...
For any class F of total functions in the set N of the natural numbers, we define the notion of F-co...
A number is normal to the base r if, in its expansion to that base, all possible digit strings of le...
In this paper, I present an introduction to computability theory and adopt contemporary mathematical...
We give a construction of an absolutely normal real number x such that for every integer b greater t...
In a recent paper, Richard Crandall and the present author established that each of a certain class ...
Report sets new method of defining computable functions. This is formalization of traditional functi...
AbstractGiven a strictly increasing computable sequence (called a base sequence) of real numbers (wi...
DOI
Add to ORKG