你即將離開本站

並前往https://dl.acm.org/doi/10.1145/321420.321426

The Solvability of the Halting Problem for 2-State Post Machines

A Post machine is a Turing machine which cannot both write and move on the same machine step. It is shown that the halting problem for the class of 2-state ...

確定！ 回上一頁

查詢 「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.