Non-low\(_2\)-ness and computable Lipschitz reducibility
type: Item
instance of: scholarly article
title: Non-low\(_2\)-ness and computable Lipschitz reducibility
zbMATH Open document ID: 1453.03038
author: Yun Fan
publication date: 2017-11-29T00:00:00Z
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 03D78
zbMATH DE Number: 6813694
zbMATH Keywords: non-low\(_2\)-ness
zbMATH Keywords: computable Lipschitz (cl) reducibility
zbMATH Keywords: complex
MaRDI profile type: Publication
full work available at URL: s10114-017-6585-5
OpenAlex ID: W2636394843
cites work: A c.e. real that cannot be sw-computed by any \(\Omega\) number
cites work: Random reals and Lipschitz continuity
cites work: Randomness and the linear degrees of computability
cites work: Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
cites work: Q4779154
cites work: Algorithmic Randomness and Complexity
cites work: Maximal pairs of c.e. reals in the computably Lipschitz degrees
cites work: A uniform version of non-\(\mathrm{low}_{2}\)-ness
cites work: Kolmogorov complexity and the Recursion Theorem
cites work: Computability Theory and Differential Geometry
cites work: There is no SW-complete c.e. real
DOI: 10.1007/S10114-017-6585-5
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 6813694