Lowness properties for strong reducibilities and the computational power of maximal sets (Q6128323): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 06:29, 10 July 2024
scientific article; zbMATH DE number 7832588
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lowness properties for strong reducibilities and the computational power of maximal sets |
scientific article; zbMATH DE number 7832588 |
Statements
Lowness properties for strong reducibilities and the computational power of maximal sets (English)
0 references
15 April 2024
0 references
computably enumerable sets
0 references
maximal sets
0 references
hh-simple sets
0 references
dense simple sets
0 references
post's programme
0 references
Turing degrees
0 references
wtt-reducibility
0 references
ibT-reducibility
0 references
jump
0 references
bounded jump
0 references
lowness
0 references
bounded lowness
0 references
bounded jump traceability
0 references
array (non)computability
0 references
totally \(\omega\)-c.a. sets
0 references
Downey-Greenberg hierarchy
0 references
