Abstract
We consider a halting problem for nondeterministic Turing machines and show via invariantization of listings the relationship of its complexity to
-
the existence of almost optimal algorithms for the set of propositional tautologies;
-
the existence of hard sequences for all algorithms deciding a given problem;
-
the existence of logics capturing polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Flum, J. (2011). Invariantization of Listings. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-22993-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22992-3
Online ISBN: 978-3-642-22993-0
eBook Packages: Computer ScienceComputer Science (R0)