DocumentCode :
3069798
Title :
The Hausdorff dimension of the halting self-similar sets of T-universal prefix-free machines
Author :
Tadaki, Kohtaro
Author_Institution :
Res. & Dev. Initiative, Chuo Univ., Tokyo, Japan
fYear :
2010
fDate :
13-18 June 2010
Firstpage :
1287
Lastpage :
1291
Abstract :
In our former work [K. Tadaki, Hokkaido Math. J., vol. 31, pp. 219-253, 2002] we studied the notion of the halting self-similar set, which is a self-similar set on defined on the halting set of a universal prefix-free machine. Here the notion of universal prefix-free machine is used to define the notion of program-size complexity. We then showed that the halting self-similar set has a Hausdorff dimension of one. Recently, Calude, et al. [C. S. Calude, N. J. Hay, and F. C. Stephan, Research Report of CDMTCS, 365, May 2009] introduced the notion of T -universal prefix-free machine with a real T ∈ as a generalization of a universal prefix-free machine. In this paper, we first generalize our former results on the Hausdorff dimension of the halting self-similar set of a universal prefix-free machine over general prefix-free sets. We then apply the generalization to evaluate the Hausdorff dimension of the halting self-similar sets of various T -universal prefix-free machines, which include the particular T -universal prefix-free machines VT and VT,k introduced in the work of Calude, et al.
Keywords :
information theory; Hausdorff dimension; T-universal prefix-free machines; halting self-similar sets; program-size complexity; High definition video; Mathematics; Research and development; World Wide Web;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
Type :
conf
DOI :
10.1109/ISIT.2010.5513715
Filename :
5513715
Link To Document :
بازگشت