Originally Posted By: confusedNotle
Come up with a bounded version of the REGULARTM problem from class such that this variant is now NP complete under Karp-reductions. Prove this.
We came up with a bounded version of the REGULARTM problem from class by coming up with a TM REGULARClockedTM.
Since the map can be viewed as a reduction from REGULARTM to ATM, the map can be viewed as a reduction from REGULARClockedTM to AClockedTM.
AClockedTM := {|M is a nondeterministic machine that accepts w in at most t steps} is Karp-complete for NP.
We first show AClockedTM is in NP. A nondeterministic algorithm to recognize this language is as follows: On input , nondeterministically guess a string v of length t^2, then verify that v codes a sequence of configurations of M of length t, the first being the start configuration of M on w, and such that the i + 1st configuration follows from the ith. If it does, M accepts w, then accept, else reject. Now suppose L is in NP. Then, it can be decided by some nondeterministic machine M in time p(n) for some polynomial p. The function w is polynomial time computable and gives a reduction from L to AClockedTM.
Thus, REGULARClockedTM is now NP complete under Karp-reductions, assuming it accepts.
Elton Murillo
Pin Chang
Jake Askeland
Jerry Wong
Jeremy Lozano
'''Originally Posted By: confusedNotle'''
Come up with a bounded version of the REGULARTM problem from class such that this variant is now NP complete under Karp-reductions. Prove this.<br><br>We came up with a bounded version of the REGULARTM problem from class by coming up with a TM REGULARClockedTM.<br><br>Since the map can be viewed as a reduction from REGULARTM to ATM, the map can be viewed as a reduction from REGULARClockedTM to AClockedTM.<br><br>AClockedTM := {|M is a nondeterministic machine that accepts w in at most t steps} is Karp-complete for NP.<br><br>We first show AClockedTM is in NP. A nondeterministic algorithm to recognize this language is as follows: On input , nondeterministically guess a string v of length t^2, then verify that v codes a sequence of configurations of M of length t, the first being the start configuration of M on w, and such that the i + 1st configuration follows from the ith. If it does, M accepts w, then accept, else reject. Now suppose L is in NP. Then, it can be decided by some nondeterministic machine M in time p(n) for some polynomial p. The function w is polynomial time computable and gives a reduction from L to AClockedTM. <br><br>Thus, REGULARClockedTM is now NP complete under Karp-reductions, assuming it accepts.<br><br>Elton Murillo<br>Pin Chang<br>Jake Askeland<br>Jerry Wong<br>Jeremy Lozano