메뉴 건너뛰기




Volumn 93, Issue 1-3, 1998, Pages 195-216

On the computability of fractal dimensions and Hausdorff measure

Author keywords

Hausdorff dimension; Julia sets; Polynomial time computable real functions; Recursive real numbers; Recursively approximable sets

Indexed keywords


EID: 0032574619     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(97)00060-2     Document Type: Article
Times cited : (18)

References (16)
  • 2
    • 84968516134 scopus 로고
    • On a theory of computation and complexity over the real numbers; NP completeness, recursive functions and universal machines
    • [2] L. Blum, M. Shub, S. Smale, On a theory of computation and complexity over the real numbers; NP completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989) 1-46.
    • (1989) Bull. Amer. Math. Soc. , vol.21 , pp. 1-46
    • Blum, L.1    Shub, M.2    Smale, S.3
  • 3
    • 0028712369 scopus 로고
    • On hausdorff and topological dimensions of the Kolmogorov complexity of the real line
    • [3] J.-Y. Cai, J. Hartmanis, On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line, J. Comput. System Sci. 49 (1994) 605-619.
    • (1994) J. Comput. System Sci. , vol.49 , pp. 605-619
    • Cai, J.-Y.1    Hartmanis, J.2
  • 4
    • 0010197472 scopus 로고
    • Effective real dynamics
    • J.N. Crossley, J.B. Remmel, R.A. Shore, M.E. Sweedler (Eds.), Birkhäuser, Boston
    • [4] D. Cenzer, Effective real dynamics, in: J.N. Crossley, J.B. Remmel, R.A. Shore, M.E. Sweedler (Eds.), Logical Methods, Birkhäuser, Boston, 1993, pp. 162-177.
    • (1993) Logical Methods , pp. 162-177
    • Cenzer, D.1
  • 5
    • 0029525043 scopus 로고
    • Computational complexity of two-dimensional regions
    • [5] A. Chou, K. Ko, Computational complexity of two-dimensional regions, SIAM J. Comput. 24 (1995) 923-947.
    • (1995) SIAM J. Comput. , vol.24 , pp. 923-947
    • Chou, A.1    Ko, K.2
  • 9
    • 0010078464 scopus 로고
    • A polynomial-time computable curve whose interior has a nonrecursive measure
    • [9] K. Ko, A polynomial-time computable curve whose interior has a nonrecursive measure, Theoret. Comput. Sci. 145 (1995) 241-270.
    • (1995) Theoret. Comput. Sci. , vol.145 , pp. 241-270
    • Ko, K.1
  • 10
    • 0029694620 scopus 로고    scopus 로고
    • On the measure of two-dimensional regions with polynomial-time computable boundaries
    • [10] K. Ko, K. Weihrauch, On the measure of two-dimensional regions with polynomial-time computable boundaries, in: Proc. 11th IEEE Conf. on Computational Complexity, 1996, pp. 150-159.
    • (1996) Proc. 11th IEEE Conf. on Computational Complexity , pp. 150-159
    • Ko, K.1    Weihrauch, K.2
  • 11
    • 0001240819 scopus 로고
    • Les ensembles récursivement ouverts on fermès et leurs applications à l'analyse récursive
    • [11] D. Lacombe, Les ensembles récursivement ouverts on fermès et leurs applications à l'analyse récursive, Comptes Rendus 244 (1957) 838-840.
    • (1957) Comptes Rendus , vol.244 , pp. 838-840
    • Lacombe, D.1
  • 13
    • 0001438253 scopus 로고
    • Fractals, dimension, and formal languages
    • [13] W. Merzenich, L. Staiger, Fractals, dimension, and formal languages, RAIRO Inform. Théor. 28 (1994) 361-386.
    • (1994) RAIRO Inform. Théor. , vol.28 , pp. 361-386
    • Merzenich, W.1    Staiger, L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.