A Generalization of Chaitin's Halting Probability Ωand Halting Self-Similar Sets

Details A Generalization of Chaitin's Halting Probability Ωand Halting Self-Similar Sets A Generalization of Chaitin's Halting Probability Ωand Halting Self-Similar Sets

2002-12-02

arxiv.org/abs/nlin/0212001v1

Hokkaido Mathematical Journal, Vol. 31, No. 1, February 2002, 219-253

Nonlinear Sciences

Chaotic Dynamics

29 pages, LaTeX2e, AMSLaTeX1.2, \usepackage{a4wide}, no figures

Scientific paper

We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose degree of randomness is precisely D. On the basis of this generalization, we consider the degree of randomness of each point in Euclidean space through its base-two expansion. It is then shown that the maximum value of such a degree of randomness provides the Hausdorff dimension of a self-similar set that is computable in a certain sense. The class of such self-similar sets includes familiar fractal sets such as the Cantor set, von Koch curve, and Sierpinski gasket. Knowledge of the property of \Omega^D allows us to show that the self-similar subset of [0,1] defined by the halting set of a universal algorithm has a Hausdorff dimension of one.

Affiliated with

Also associated with

No associations

Rating

A Generalization of Chaitin's Halting Probability Ωand Halting Self-Similar Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Generalization of Chaitin's Halting Probability Ωand Halting Self-Similar Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalization of Chaitin's Halting Probability Ωand Halting Self-Similar Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602677