A uniform version of non-\(\mathrm{low}_{2}\)-ness
type: Item
instance of: scholarly article
title: A uniform version of non-\(\mathrm{low}_{2}\)-ness
zbMATH Open document ID: 1422.03087
author: Yun Fan
published in: Annals of Pure and Applied Logic
publication date: 2016-12-23T00:00:00Z
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 6668384
zbMATH Keywords: (uniformly) non-\(\mathrm{low}_2\)-ness
zbMATH Keywords: computable Lipschitz reducibility
zbMATH Keywords: common upper bound
MaRDI profile type: Publication
full work available at URL: j.apal.2016.10.013
OpenAlex ID: W2535167946
cites work: A c.e. real that cannot be sw-computed by any \(\Omega\) number
cites work: Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
cites work: Turing degrees of reals of positive effective packing dimension
cites work: Algorithmic Randomness and Complexity
cites work: Q4863240
cites work: Randomness and reducibility
cites work: Maximal pairs of c.e. reals in the computably Lipschitz degrees
cites work: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
cites work: Random reals and Lipschitz continuity
cites work: Randomness and the linear degrees of computability
cites work: Q4040892
cites work: Computability Theory and Differential Geometry
cites work: There is no SW-complete c.e. real
DOI: 10.1016/J.APAL.2016.10.013
description: scientific article; zbMATH DE number 6668384