Skip to main content Accessibility help
×
Home

Non-cupping, measure and computably enumerable splittings

  • GEORGE BARMPALIAS (a1) and ANTHONY MORPHETT (a2)

Abstract

We show that there is a computably enumerable function f (that is, computably approximable from below) that dominates almost all functions, and fW is incomplete for all incomplete computably enumerable sets W. Our main methodology is the LR equivalence relation on reals: ALRB if and only if the notions of A-randomness and B-randomness coincide. We also show that there are c.e. sets that cannot be split into two c.e. sets of the same LR degree. Moreover, a c.e. set is low for random if and only if it computes no c.e. set with this property.

Copyright

References

Hide All
Barmpalias, G., Lewis, A. E. M. and Soskova, M. (2008) Randomness, lowness and degrees. J. Symbolic Logic 73 (2)559577.
Barmpalias, G., Lewis, A. E. M. and Stephan, F. (to appear) Π01 classes, LR degrees and Turing degrees. To appear in Annals of Pure and Applied Logic.
Barmpalias, G. and Montalbán, A. (2007) A cappable almost everywhere dominating computably enumerable degree. Electronic Notes in Theoretical Computer Science 167.
Binns, S., Kjos-Hanssen, B., Lerman, M. and Solomon, R. (2006) On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symbolic Logic 71 (1)119136.
Cholak, P., Greenberg, N. and Miller, J. S. (2006) Uniform almost everywhere domination. Journal of Symbolic Logic 71.
Cooper, S. B., Lempp, S. and Watson, P. (1989) Weak density and cupping in the d-r.e. degrees. Israel Journal of Mathematics 67 137152.
de Leeuw, K., Moore, E. F., Shannon, C. E. and Shapiro, N. (1956) Computability by probabilistic machines. Automata studies, Annals of mathematics studies 34, Princeton University Press 183212.
Dobrinen, N. L. and Simpson, S. G. (2004) Almost everywhere domination. J. Symbolic Logic 69 (3)914922.
Downey, R. G. and Hirschfeldt, D. (to appear) Algorithmic Randomness and Complexity, Springer-Verlag (in preparation).
Downey, R. G. and Slaman, T. A. (1989) Completely mitotic r.e. degrees. Ann. Pure Appl. Logic 41 (2)119152.
Downey, R. G. and Stob, M. (1993) Splitting theorems in recursion theory. Ann. Pure Appl. Logic 65 (1)1106.
Kjos-Hanssen, B. (2007) Low for random reals and positive-measure domination. Proceedings of the American Mathematical Society 135 37033709.
Kjos-Hanssen, B., Miller, J. S. and Solomon, D. R. (unpublished) Lowness notions, measure and domination (unpublished draft).
Lachlan, A. H. (1967) The priority method I. Z. Math. Logik Grundlagen Math. 13 110.
Ladner, R. E. (1973a) Mitotic Recursively Enumerable Sets. Journal of Symbolic Logic 38 (2)199211.
Ladner, R. E. (1973b) A Completely Mitotic Nonrecursive R. E. Degree. Transactions of the AMS 184 479507.
Li, A., Slaman, T. A. and Yang, Y. (unpublished) A nonlow2 c.e. degree which bounds no diamond bases (unpublished draft).
Martin, D. (unpublished) Measure, Category, and Degrees of Unsolvability (unpublished manuscript, dating from the late 60's).
Miller, D. P. (1981) High recursively enumerable degrees and the anti-cupping property. In: Lerman, M. et al. (eds.) Logic Year 1979-80. Springer-Verlag Lecture Notes in Mathematics 859.
Nies, A. (2005) Lowness properties and randomness. Advances in Mathematics 197 274305.
Nies, A. (to appear) Computability and Randomness, Oxford University Press (in preparation).
Sacks, G. (1963) Degrees of Unsolvability, Princeton University Press.
Simpson, S. G. (2007) Almost everywhere domination and superhighness. Mathematical Logic Quarterly 53 462482.
Soare, R. I. (1987) Recursively Enumerable Sets and Degrees, Springer-Verlag.
Yu, L. and Yang, Y. (2005) On the definable ideal generated by nonbounding c.e. degrees. Journal of Symbolic Logic 20.

Related content

Powered by UNSILO

Non-cupping, measure and computably enumerable splittings

  • GEORGE BARMPALIAS (a1) and ANTHONY MORPHETT (a2)

Metrics

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.