29. Independent Set
Short Turing Machine Acceptance
(qa,happy)
Read b and (a,b) is not an edge.
(qa,happy) —> (QUIT)
30. Independent Set
Short Turing Machine Acceptance
(qa,happy)
Read b and (a,b) is not an edge.
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
31. Independent Set
Short Turing Machine Acceptance
(qa,happy)
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
32. Independent Set
Short Turing Machine Acceptance
(qa,happy)
Read an EOF symbol.
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
33. Independent Set
Short Turing Machine Acceptance
(qa,happy)
Read an EOF symbol.
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
(qa,happy) —> (q[move,a],happy); move left
34. Independent Set
Short Turing Machine Acceptance
(qa,happy)
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
(qa,happy) —> (q[move,a],happy); move left
35. Independent Set
Short Turing Machine Acceptance
(qa,happy)
Read a.
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
(qa,happy) —> (q[move,a],happy); move left
36. Independent Set
Short Turing Machine Acceptance
(qa,happy)
Read a.
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
(qa,happy) —> (q[move,a],happy); move left
(q[move,a],happy) —> (q[read],happy); move right
37. Independent Set
Short Turing Machine Acceptance
(qa,happy)
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
(qa,happy) —> (q[move,a],happy); move left
(q[move,a],happy) —> (q[read],happy); move right
38. Independent Set
Short Turing Machine Acceptance
(qa,happy)
(qa,happy) —> (QUIT)
(qa,happy) —> (qa,happy); move right
(qa,happy) —> (q[move,a],happy); move left
(q[move,a],happy) —> (q[read],happy); move right
(q[read],happy) —> (qb,happy); move right
48. Short Turing Machine Acceptance
Encode every configuration as a vertex.
At step i, the head is at j, and the transition is δ.
49. Short Turing Machine Acceptance
Encode every configuration as a vertex.
At step i, the head is at j, and the transition is δ.
At step i, the symbol at j is t, and the head is not at j.
50. [Step 3, Position 1, δ]
[Step 3, Position 2, δ]
[Step 3, Position 3, δ]
51. [Step 3, Position 1, a]
[Step 3, Position 1, b]
[Step 3, Position 2, a]
[Step 3, Position 2, b]
[Step 3, Position 3, a]
[Step 3, Position 3, b]
[Step 3, Position 1, δ]
[Step 3, Position 2, δ]
[Step 3, Position 3, δ]
52. [Step 3, Position 1, a]
[Step 3, Position 1, b]
[Step 3, Position 2, a]
[Step 3, Position 2, b]
[Step 3, Position 3, a]
[Step 3, Position 3, b]
[Step 3, Position 1, δ]
[Step 3, Position 2, δ]
[Step 3, Position 3, δ]
53. [Step 3, Position 1, a]
[Step 3, Position 1, b]
[Step 3, Position 2, a]
[Step 3, Position 2, b]
[Step 3, Position 3, a]
[Step 3, Position 3, b]
[Step 3, Position 1, δ]
[Step 3, Position 2, δ]
[Step 3, Position 3, δ]
54. [Step 3, Position 1, a]
[Step 3, Position 1, b]
[Step 3, Position 2, a]
[Step 3, Position 2, b]
[Step 3, Position 3, a]
[Step 3, Position 3, b]
[Step 3, Position 1, δ]
[Step 3, Position 2, δ]
[Step 3, Position 3, δ]
55. [Step 3, Position 1, a]
[Step 3, Position 1, b]
[Step 3, Position 2, a]
[Step 3, Position 2, b]
[Step 3, Position 3, a]
[Step 3, Position 3, b]
[Step 3, Position 1, δ]
[Step 3, Position 2, δ]
[Step 3, Position 3, δ]
61. Weighted Circuit Satisfiablity
Input
A circuit C, and an integer k.
Is there an assignment setting EXACTLY k variables
to one, that satisfies C?
Question