9.Which of the following statements best describes a key characteristic of a Universal Turing Machine (UTM)?
(A) A UTM can solve any mathematical problem, including those proven to be undecidable like the Halting Problem.
(B) A UTM is designed with a specific set instructions to solve one particular complex computational problem with maximum efficiency.
(C) A UTM can simulate any other Turing machine if provided with a description of that machine and its input.
(D) A UTM operates using quantum bits (qubits) to achieve computational power beyond classical Turing machines.

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