\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (Q1387830): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s002240000090 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S002240000090 / rank | |||
Normal rank | |||
Latest revision as of 19:17, 10 December 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
1 October 1998
0 references
Turing-complete sets
0 references
