Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
146 views

Lower Bound of Solutions to P=NP?

Do we at least know that simulating polynomial time non-deterministic Turing machines requires more than a linear slowdown? That is, do we know there is some non-deterministic Turing machine with ...
4 votes
1 answer
248 views

Constructing hard inputs for the complement of bounded halting

If there is always a hard input for the complement of bounded halting, can that input be constructed? More precisely, suppose that for any deterministic TM $M$ accepting $$ \text{coBHP}=\{\...