\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (Q1387830): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Edith Hemaspaandra / rank
Normal rank
 
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
Normal rank
 
Property / author
 
Property / author: Harald Hempel / rank
Normal rank
 
Property / author
 
Property / author: Edith Hemaspaandra / rank
 
Normal rank
Property / author
 
Property / author: Hemaspaandra, Lane A. / rank
 
Normal rank
Property / author
 
Property / author: Harald Hempel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s002240000090 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057527249 / rank
 
Normal rank

Latest revision as of 01:48, 20 March 2024

scientific article
Language Label Description Also known as
English
\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness
scientific article

    Statements

    \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (English)
    0 references
    0 references
    1 October 1998
    0 references
    0 references
    Turing-complete sets
    0 references
    0 references
    0 references
    0 references
    0 references