Abstract
A resource-bounded version of the statement “no algorithm recognizes all non-halting Turing machines” is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any (paddable) coNP -complete language and also equivalent to a superpolynomial speedup in proof length in propositional proof systems for tautologies, each of which implies P ≠ NP . This suggests a correspondence between the properties “has no algorithm at all” and “has no best algorithm” which seems relevant to open problems in computational and proof complexity.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
