Strong jump-traceability. I: The computably enumerable case (Q2474313): 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.aim.2007.09.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2171441747 / rank | |||
Normal rank |
Revision as of 21:46, 19 March 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