Low upper bounds in the LR degrees
type: Item
instance of: scholarly article
title: Low upper bounds in the LR degrees
zbMATH Open document ID: 1247.03073
published in: Annals of Pure and Applied Logic
publication date: 2012-04-13T00:00:00Z
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6023580
zbMATH Keywords: computability theory
zbMATH Keywords: randomness
zbMATH Keywords: K-trivials
zbMATH Keywords: lowness
author: David Diamondstone
MaRDI profile type: Publication
full work available at URL: j.apal.2011.10.001
OpenAlex ID: W2034570600
cites work: Elementary differences between the degrees of unsolvability and degrees of compressibility
cites work: Chaitin's halting probability and the compression of strings using oracles
cites work: The importance of Π10 classes in effective randomness
cites work: \(\Pi_1^0 \) classes, LR degrees and Turing degrees
cites work: Randomness, lowness and degrees
cites work: Low for random reals and positive-measure domination
cites work: The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
cites work: Lowness properties and randomness
cites work: Q3611832
cites work: Almost everywhere domination and superhighness
DOI: 10.1016/J.APAL.2011.10.001
description: scientific article; zbMATH DE number 6023580