Computational complexity of recursively enumerable sets
From MaRDI portal
Publication:4750632
DOI10.1016/S0019-9958(82)80082-XzbMath0512.03022MaRDI QIDQ4750632
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)
Related Items
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees, Lower bounds on degrees of game-theoretic structures, Index sets related to prompt simplicity, The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees, Implicit measurements of dynamic complexity properties and splittings of speedable sets, On computational complexity and honest polynomial degrees
