10.2 Partial vs Total
A computable process may fail to produce an output for some inputs, not because the input is malformed, but because the process never halts. This distinction leads to two kinds of functions: total functions, which are defined on every input, and partial functions, which may be undefined on some inputs. In computability theory, partial functions are essential because algorithms are allowed to run forever. A computation that never halts produces...