PDF | In theory of computability , the halting problem is a decision problem which can be stated as follows: Given a explanation of a program , decide.
確定! 回上一頁