scientific article; zbMATH DE number 1405577
From MaRDI portal
Publication:4938556
zbMATH Open0946.68043MaRDI QIDQ4938556
Publication date: 27 March 2000
Title of this publication is not available (Why is that?)
Undecidability and degrees of sets of sentences (03D35) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (2)
Computability and Complexity of Unconventional Computing Devices ⋮ Computability. Turing, Gödel, Church, and beyond
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938556)
