Lowness for genericity (Q818521)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lowness for genericity |
scientific article; zbMATH DE number 5013640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lowness for genericity |
scientific article; zbMATH DE number 5013640 |
Statements
Lowness for genericity (English)
0 references
21 March 2006
0 references
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.
0 references
Turing degree structures
0 references
0.8632771372795105
0 references
0.8320717811584473
0 references
0.7939451932907104
0 references
0.7772689461708069
0 references
0.768584132194519
0 references
