你即將離開本站

並前往https://xlinux.nist.gov/dads/HTML/haltingProblem.html

halting problem

halting problem. (classic problem). Definition: Is there an algorithm to determine whether any arbitrary program halts? Turing proved the answer is, no.

確定！ 回上一頁

查詢 「Halting problem」的人也找了：

  1. 停機問題
    2.
  2. Halting problem
    3.
  3. Halting problem NP-hard
    4.
  4. halting problem中文
    5.
  5. Halting problem proof
    6.
  6. halting中文
    7.
  7. Entscheidungsproblem
    8.
  8. Halt NP-complete
    9.