Title :
Undecidability results for low complexity degree structures
Author :
Downey, Rod ; Nies, André
Author_Institution :
Victoria Univ., Wellington, New Zealand
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
Keywords :
Boolean algebra; Turing machines; computational complexity; encoding; formal languages; Boolean algebras; EXPTIME degrees; coding method; hyper-polynomial time classes; ideal lattices; low complexity degree structures; many-one reducibility; polynomial time Turing; undecidability results; Boolean algebra; Complexity theory; Lattices; Polynomials;
Conference_Titel :
Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference)
Conference_Location :
Ulm
Print_ISBN :
0-8186-7907-7
DOI :
10.1109/CCC.1997.612308
