更改

例如，在伪代码中，程序

例如，在伪代码中，程序

 

The halting problem is a decision problem about properties of computer programs on a fixed [[Turing-complete]] model of computation, i.e., all programs that can be written in some given [[programming language]] that is general enough to be equivalent to a Turing machine. 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 on the amount of memory or time required for the program's execution; it can take arbitrarily long and use an arbitrary amount of storage space before halting. The question is simply whether the given program will ever halt on a particular input.

The halting problem is a decision problem about properties of computer programs on a fixed [[Turing-complete]] model of computation, i.e., all programs that can be written in some given [[programming language]] that is general enough to be equivalent to a Turing machine. 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 on the amount of memory or time required for the program's execution; it can take arbitrarily long and use an arbitrary amount of storage space before halting. The question is simply whether the given program will ever halt on a particular input.