\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (Q1387830): 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.1007/s002240000090 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057527249 / rank | |||
Normal rank | |||
Revision as of 00: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
1 October 1998
0 references
Turing-complete sets
0 references
