Affiliation:
1. Department of Mathematics, The University of Oslo, Norway. dnormann@math.uio.no
Abstract
Given a set A in the unit interval and the associated Lebesgue measure λ, it is a natural question whether we may (in some sense) compute the measure λ ( A ) in terms of the set A. Under the moniker measure theoretic uniformity, Tanaka and Sacks have (independently) provided a positive answer for the well-known class of hyperarithmetical sets of reals, and provided a basis theorem for such sets of positive measure. The hyperarithmetical sets are exactly the sets computable in terms of the functional 2 E, in the sense of Kleene’s S1–S9. In turn, Kleene’s 2 E essentially corresponds to arithmetical comprehension as in ACA 0 . In this paper, we generalise the aforementioned results to the ‘next level’, namely Π 1 1 -CA 0 , in the form of the Suslin functional, or the equivalent hyperjump. We also generalise the Tanaka-Sacks basis theorem to sets of positive measure that are semi-computability relative to the Suslin functional. Finally, we discuss similar generalisations for infinite time Turing machines.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference24 articles.
1. Classical hierarchies from a modern standpoint. Part I. C-sets;Burgess;Fundam. Math.,1983
2. Randomness via infinite computation and effective descriptive set theory;Carl;J. Symb. Log.,2018
3. General recursive functionals of finite type and hierarchies of functionals;Gandy;Ann. Fac. Sci. Univ. Clermond-Ferrand,1967
4. Infinite time Turing machines;Hamkins;J. Symb. Log.,2000
5. H. Herrlich, Axiom of Choice, Lecture Notes in Mathematics, Vol. 1876, Springer, 2006.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献