Invariantization of Listings
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6907)
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.
© Springer-Verlag GmbH Berlin Heidelberg 2011