Most classic results in logic and recursivity use number theoretic algorithms. Coding non-trivial algorithm by means of additions and multiplications may become ridiculously cumbrous. Understanding logic and recursion may be significantly improved by rewriting the algorithms implied by their constructive proofs in languages "playing" with a data-type more sophisticated than mere "int" or "string". In the book readers will find definition and use for a new model of TM, called "list TM", which is based on the data-type their name suggests.