Some Decision Problems of Enormous Complexity

Authors:
Harvey M. Friedman
Affiliations:
-
Venue:
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Year:
1999

Citing 0
Cited 3

Expressive power and abstraction in Essence

Constraints
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The parametric ordinal-recursive complexity of post embedding problems

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 \mathtime completeness to \mathtime completeness to \mathtime 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.