Banishing robust Turing completeness

DOI10.1007/BFB0023873MaRDI QIDQ2757852zbMATH OpenFDO

Authors Lane A. Hemaspaandra, Sanjay Jain, Nikolai K. Vereshchagin

Publication date 4 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0023873

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• BANISHING ROBUST TURING COMPLETENESS
• Robustness of PSPACE-complete sets
• Promise problems complete for complexity classes
• [[:Publication:1387830|\(R_{1-tt}^Template:\mathcal SN\)(NP) distinguishes robust many-one and Turing completeness]]
• scientific article; zbMATH DE number 874695

Cited in

(3)

• [[:Publication:1387830|\(R_{1-tt}^Template:\mathcal SN\)(NP) distinguishes robust many-one and Turing completeness]]
• Turing-Completeness Totally Free
• BANISHING ROBUST TURING COMPLETENESS

This page was built for publication: Banishing robust Turing completeness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757852)