Strong jump-traceability. I: The computably enumerable case (Q2474313): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:24, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong jump-traceability. I: The computably enumerable case |
scientific article |
Statements
Strong jump-traceability. I: The computably enumerable case (English)
0 references
5 March 2008
0 references
strongly jump-traceable
0 references
\(K\)-trivial
0 references
Martin-Löf random
0 references
computability
0 references
computably enumerable
0 references
Turing degree
0 references
