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.

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2011

Authors and Affiliations

  • Jörg Flum
    • 1
  1. 1.Albert-Ludwigs-Universität FreiburgGermany

Personalised recommendations