Theory of Computer Science A1. Organizational Matters Gabriele R¨oger
22
0
0
Volltext
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
ÄHNLICHE DOKUMENTE
For the undecidability of the halting problem, we will use an analogous argument, only with Turing machines instead of code and termination instead of return
I For the undecidability of the halting problem, we will use an analogous argument, only with Turing machines instead of code and termination instead of return values... The
I If you read a 1 at the first tape position, move every non-blank symbol on the tape one position to the right, write a 1 in the first tape position and accept...
for 2.: identical to (1), only that M B only recognizes B and therefore the simulation does not necessarily terminate if y 6∈ B. Since y 6∈ B iff x 6∈ A, the procedure still
for 2.: identical to (1), only that M B only recognizes B and therefore the simulation does not necessarily terminate if y 6∈ B. Since y 6∈ B iff x 6∈ A, the procedure still
I Instead, we prove a much more general result, Rice’s theorem, which shows that a very large class of different problems are undecidable.. I Rice’s theorem can be summarized
Clique , IndSet , VertexCover three classical routing problems:. DirHamiltonCycle , HamiltonCycle
Does this graph have a vertex cover of size 4?.. VertexCover is
