[理工] [計概]雲科大98-資工所
Suppose the currenl state in a Turing machine is 1, and the current
symbol is 0, and that (1.0,1,2.R)
(1.0,0,3.L) both appear in the same collection of instructions. Then
the machine?
(A) would proceed as normal
(B) has a conflict
(C) would fix the problem and continue
(D) would eliminateone of the instructions
The ____ states that if there exists an algorithm to do a symbol
manipulation task,then there exists a Turing machine to do that task.
(A)church-turing thesis
(B)Church-alan theorem
(C)church-zimmerman thesis
(D)alan-zimmerman thesis
以上兩題~感謝~希望還可以提供TURING的基本運用
或者是教學連結~~~
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 125.230.149.33
推
03/18 08:39, , 1F
03/18 08:39, 1F