Lowness for genericity
type: Item
instance of: scholarly article
title: Lowness for genericity
zbMATH Open document ID: 1148.03033
author: Liang Yu
published in: Archive for Mathematical Logic
publication date: 2006-03-21T00:00:00Z
review text: Starting from the Nitzpon's definition of lowness for 1-genericity, the author shows that there is no Turing degree which is low for 1-genericity. He also proves partially Nitzpron's conjecture: the hyperimmune-free degrees are the same as the degrees low for weak 1-genericity. So, with Miller, the author proves that every computable traceable degree is low for weak 1-genericity.
Mathematics Subject Classification ID: 03D28
zbMATH DE Number: 5013640
zbMATH Keywords: Turing degree structures
reviewed by: Daniela Marinescu
MaRDI profile type: Publication
full work available at URL: s00153-005-0306-y
OpenAlex ID: W2139507368
cites work: Algorithmic Randomness and Complexity
cites work: Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
cites work: ∏ 0 1 Classes and Degrees of Theories
cites work: The definition of random sequences
cites work: The Degrees of Hyperimmune Sets
cites work: Lowness properties and randomness
cites work: Q3819052
cites work: Computational randomness and lowness
DOI: 10.1007/S00153-005-0306-Y
description: scientific article; zbMATH DE number 5013640