\(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness (Q1387830)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness |
scientific article; zbMATH DE number 1160534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(R_{1-tt}^{{\mathcal SN}}\)(NP) distinguishes robust many-one and Turing completeness |
scientific article; zbMATH DE number 1160534 |
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
