Skip to main content Accessibility help




In this article, we study an analogue of tt-reducibility for points in computable metric spaces. We characterize the notion of the metric tt-degree in the context of first-level Borel isomorphism. Then, we study this concept from the perspectives of effective topological dimension theory and of effective fractal dimension theory.



Hide All
[1]Andrews, U., Igusa, G., Miller, J. S., and Soskova, M. I., Characterizing the continuous degrees, submitted.
[2]Banakh, T. and Bokalo, B., On scatteredly continuous maps between topological spaces. Topology and Its Applications, vol. 157 (2010), no. 1, pp. 108122.
[3]Bauer, A. and Yoshimura, K., Reductions in computability theory from a constructive point of view, a talk at The Logic Coloquium, July 14–19, 2014.
[4]Bienvenu, L. and Merkle, W., Reconciling data compression and Kolmogorov complexity, Automata, Languages and Programming (Arge, L., Cachin, C., Jurdiński, T., and Tarlecki, A., editors), Lecture Notes in Computer Science, vol. 4596, Springer, Berlin, 2007, pp. 643654.
[5]Császár, Á. and Laczkovich, M., Discrete and equal convergence. Studia Scientiarum Mathematicarum Hungarica, vol. 10 (1975), no. 3–4, pp. 463472.
[6]Day, A. R. and Miller, J. S., Randomness for noncomputable measures. Transactions of the American Mathematical Society, vol. 365 (2013), no. 7, pp. 35753591.
[7]Downey, R. G. and Hirschfeldt, D. R., Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, New York, 2010.
[8]Engelking, R., Theory of Dimensions Finite and Infinite, Sigma Series in Pure Mathematics, vol. 10, Heldermann Verlag, Lemgo, 1995.
[9]Gregoriades, V., Kihara, T., and Ng, K. M., Turing degrees in Polish spaces and decomposability of Borel functions, preprint, arXiv:1410.1052.
[10]Grubba, T., Schröder, M., and Weihrauch, K., Computable metrization. Mathematical Logic Quarterly, vol. 53 (2007), no. 4–5, pp. 381395.
[11]Hurewicz, W. and Wallman, H., Dimension Theory, Princeton Mathematical Series, vol. 4, Princeton University Press, Princeton, New Jersey, 1941.
[12]Jayne, J. E. and Rogers, C. A., Borel isomorphisms at the first level. I. Mathematika, vol. 26 (1979), no. 1, pp. 125156.
[13]Jayne, J. E. and Rogers, C. A., Borel isomorphisms at the first level. II. Mathematika, vol. 26 (1979), no. 2, pp. 157179.
[14]Jayne, J. E. and Rogers, C. A., Piecewise closed functions. Mathematische Annalen, vol. 255 (1981), no. 4, pp. 499518.
[15]Jayne, J. E. and Rogers, C. A., First-level Borel functions and isomorphisms. Journal de Mathématiques Pures et Appliquées (9), vol. 61 (1982), no. 2, pp. 177205.
[16]Joyce, H., A relationship between packing and topological dimensions. Mathematika, vol. 45 (1998), no. 1, pp. 4353.
[17]Kenny, R., Effective zero-dimensionality for computable metric spaces. Logical Methods in Computer Science, vol. 11 (2015), pp. 1:11,25.
[18]Kihara, T. and Miyabe, K., Uniform Kurtz randomness. Journal of Logic and Computation, vol. 24 (2014), no. 4, pp. 863882.
[19]Kihara, T. and Miyabe, K., Unified characterizations of lowness properties via Kolmogorov complexity. Archive for Mathematical Logic, vol. 54 (2015), no. 3–4, pp. 329358.
[20]Kihara, T., Ng, K. M., and Pauly, A., Enumeration degrees and nonmetrizable topology, preprint.
[21]Kihara, T. and Pauly, A., Point degree spectra of represented spaces, submitted.
[22]Lutz, J. H. and Lutz, N., Algorithmic information, plane Kakeya sets, and conditional dimension, 34th Symposium on Theoretical Aspects of Computer Science (Vollmer, H. and Vallée, B., editors), LIPICS - Leibniz International Proceedings in Informatics, vol. 66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Wadern, 2017, Art. No. 53.
[23]Lutz, J. H. and Mayordomo, E., Dimensions of points in self-similar fractals. SIAM Journal on Computing, vol. 38 (2008), no. 3, pp. 10801112.
[24]Lutz, N. and Stull, D. M., Bounding the dimension of points on a line, Theory and Applications of Models of Computation (Gopal, T. V., Jäger, G., and Steila, S., editors), Lecture Notes in Computer Science, vol. 10185, Springer, Cham, 2017, pp. 425439.
[25]Lutz, N. and Stull, D. M., Dimension spectra of lines, Unveiling Dynamics and Complexity, Lecture Notes in Computer Science, vol. 10307, Springer, Cham, 2017, pp. 304314.
[26]Luukkainen, J., Assouad dimension: Antifractal metrization, porous sets, and homogeneous measures. Journal of the Korean Mathematical Society, vol. 35 (1998), no. 1, pp. 2376.
[27]McNicholl, T. H. and Rute, J., A uniform reducibility in computably presented Polish spaces, A talk at AMS Sectional Meeting AMS Special Session on “Effective Mathematics in Discrete and Continuous Worlds”, October 28–30, 2016.
[28]Miller, J. S., Degrees of unsolvability of continuous functions, this Journal, vol. 69 (2004), no. 2, pp. 555584.
[29]Nagata, J.-i., Modern Dimension Theory, revised ed., Sigma Series in Pure Mathematics, vol. 2, Heldermann Verlag, Berlin, 1983.
[30]Odifreddi, P., Classical Recursion Theory, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, Amsterdam, 1989.
[31]O’Malley, R. J., Approximately differentiable functions: The r topology. Pacific Journal of Mathematics, vol. 72 (1977), no. 1, pp. 207222.
[32]Pol, R. and Zakrzewski, P., On Borel mappings and σ-ideals generated by closed sets. Advances in Mathematics, vol. 231 (2012), no. 2, pp. 651663.
[33]Shakhmatov, D. B., Baire isomorphisms at the first level and dimension. Topology and Its Applications, vol. 107 (2000), no. 1–2, pp. 153159, 15th Anniversary of the Chair of General Topology and Geometry at Moscow State University.
[34]Soare, R. I., Turing computability, Theory and Applications, Theory and Applications of Computability, Springer-Verlag, Berlin, 2016.
[35]van Mill, J, The Infinite-Dimensional Topology of Function Spaces, North-Holland Mathematical Library, vol. 64, North-Holland, Amsterdam, 2001.
[36]Weihrauch, K., Computable Analysis, Springer, Berlin, 2000.
[37]Zapletal, J., Dimension theory and forcing. Topology and Its Applications, vol. 167 (2014), pp. 3135.





Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed