Turing Machine, summarized and illustrated, 2nd edition

Turing Machine describes computing requirements. Abstract machines can perform any algorithm, effective procedure, or recursive procedure, such as adding or multiplying, that has a finite number of instructions and has enumerable elements, such as integers and rational numbers.