Skip to main content
Conference Proceedings

Lowness for demuth randomness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5635 LNCS 154-166
DOI: 10.1007/978-3-642-03073-4_17
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that every real low for Demuth randomness is of hyperimmune-free degree. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Downey, R., & Ng, K. M. (2009). Lowness for demuth randomness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 154–166). https://doi.org/10.1007/978-3-642-03073-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free