Strong jump-traceability. I: The computably enumerable case (Q2474313)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5242986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong jump-traceability. I: The computably enumerable case |
scientific article; zbMATH DE number 5242986 |
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
0.9460354
0 references
0.9221057
0 references
0.87970436
0 references
0.8772439
0 references
0.8765648
0 references
0 references
0 references
0 references
0.8464509
0 references
