CMPT 407/710 - Complexity Theory: Lecture 20

Do we have non-relativizing techniques? Yes, we do! In fact, already the proof of the CookLevin theorem is non-black-box: to reduce the computation of a nondeterministic TM on a given input x to a 3-cnf φx, we had to “open up” the TM and look inside at the sequence of configurations the TM goes through, and moreover, exploit a very special property of a TM… CONTINUE READING