Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

TCS
2002

favoriteEmaildiscussreport

67views Theoretical Computer Science» more TCS 2002»

An example of a computable absolutely normal number

13 years 4 months ago

An example of a computable absolutely normal number

Download www.glyc.dc.uba.ar

The 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.

Verónica Becher, Santiago Figueira

Real-time Traffic

Absolutely Normal Number | Recursive Reformulation | Sierpinski | TCS 2002 | Theoretical Computer Science |

claim paper

Related Content

» Syntactic Normalization Of Spontaneous Speech

» Bounds on the distribution of the number of gaps when circles and lines are covered by fra...

» Normalized Cuts Revisited A Reformulation for Segmentation with Linear Grouping Constraint...

» Learning kernels for variants of normalized cuts Convex relaxations and applications

» The NearMe Wireless Proximity Server

» Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut

» Computing ray class groups conductors and discriminants

» Importance of SIMD Computation Reconsidered

» A Framework for Energy and Transient Power Reduction during Behavioral Synthesis

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TCS
Authors	Verónica Becher, Santiago Figueira

Comments (0)