Mortality (computability theory)

In computability theory, mortality refers to a specific property of a computational process, particularly in the context of Turing machines. A Turing machine is said to be "mortal" if it eventually enters a halting state after a finite number of steps for every input. In simpler terms, a mortal Turing machine will always stop (halt) when run on any given input.