Undecidability Results For Low Complexity Degree Structures

Authors:
R. Downey;A. Nies
Affiliations:
-;-
Venue:
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Year:
1997

Citing 5
Cited 0

Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets

Information Processing Letters
Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
On the theory of the PTIME degrees of the recursive sets

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which is introduced A. Nies. The method can be applied in fact to all hyper-polynomial time classes.