4. Which of the following is not true of the halting problem? (5%)
(A) It was studied by Alan Turing.
(B) It is harder than intractable.
(C) Someday a clever algorithm may be found to solve it.
(D) It involves a program that analyzes other programs.

答案:登入後查看
統計: 尚無統計資料