Some Decision Problems of Enormous Complexity

We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic logical notions. Their complexities range from iterated exponential time completeness to 0 time completeness to ( ,0) time completeness to (,,0) time completeness. These three ordinals are well known ordinals from proof theory, and their associated complexity classes represent new levels of computational complexity for natural decision problems. Proofs will appear in an extended version of this manuscript to be published elsewhere.

• Type: Conference
• Year: 1999
• Where: LICS
• Authors: Harvey Friedman
• Keywords: Automated Reasoning, Computational Complexity, Exponential Time Completeness, LICS 1999, Time Completeness