A crucial concept in the theory of computability which examines whether a Turing machine (or other computational device) can determine whether another program, given an input, will eventually stop running or if it will run infinitely.
A crucial concept in the theory of computability which examines whether a Turing machine (or other computational device) can determine whether another program, given an input, will eventually stop running or if it will run infinitely.