(New page: In computability theory, the halting problem is a decision problem which can be stated as follows: A description of a program and a finite input, decide whether the program finishes runnin...) |
|||
| (11 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | + | according to wikipedia, the halting problem is a decision problem about properties of computer programs on a fixed Turing-complete model of computation. The problem is to determine, given a program and an input to the program, whether the program will eventually halt when run with that input. In this abstract framework, there are no resource limitations of memory or time on the program's execution; it can take arbitrarily long, and use arbitrarily much storage space, before halting. The question is simply whether the given program will ever halt on a particular input. | |
| − | + | ||
| − | + | ||
| + | --[[User:Kim297|Kim297]] 10:13, 20 November 2008 (UTC) | ||
Latest revision as of 19:36, 30 November 2008
according to wikipedia, the halting problem is a decision problem about properties of computer programs on a fixed Turing-complete model of computation. The problem is to determine, given a program and an input to the program, whether the program will eventually halt when run with that input. In this abstract framework, there are no resource limitations of memory or time on the program's execution; it can take arbitrarily long, and use arbitrarily much storage space, before halting. The question is simply whether the given program will ever halt on a particular input.
--Kim297 10:13, 20 November 2008 (UTC)
