停止性問題
1. Halting problemIn computability theory, the halting problem can be stated as follows: Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.
Read “Halting problem” on English Wikipedia
Read “停止性問題” on Japanese Wikipedia
Read “Halting problem” on DBpedia
Read “Halting problem” on English Wikipedia
Read “停止性問題” on Japanese Wikipedia
Read “Halting problem” on DBpedia
Discussions
Log in to talk about this word.