A universally hard set of formulae with respect to non-deterministic Turing acceptors

DOI10.1016/0020-0190(77)90077-1zbMath0353.68064OpenAlexW2032224798MaRDI QIDQ1236428

H. Klupp, Claus Peter Schnorr

Publication date: 1977

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(77)90077-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Turing machines and related notions (03D10)

Cites Work

• Unnamed Item

This page was built for publication: A universally hard set of formulae with respect to non-deterministic Turing acceptors