Lowness properties and approximations of the jump (Q2478546): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.apal.2007.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015069877 / rank | |||
Normal rank | |||
Revision as of 01:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lowness properties and approximations of the jump |
scientific article |
Statements
Lowness properties and approximations of the jump (English)
0 references
28 March 2008
0 references
The paper compares two combinatorial lowness notions: strong jump-traceability and well-ap\-prox\-i\-mation of the jump. It constructs a non-computable strongly jump-traceable set and proves that if \(A'\) is well-approximable then \(A\) is strongly jump-traceable (for c.e.\ sets the converse is also true).
0 references
lowness
0 references
strong jump-traceability
0 references
well-approximation of the jump
0 references
