NEW YORK TIMES BESTSELLER • From the bestselling author of Dark Matter and the Wayward Pines trilogy comes a relentless thriller about time, identity, and memory—his most mind-boggling, irresistible work to date, and the inspiration for ...

This project-based guide contains complete, runnable programs to help you learn: How recursive functions make use of the call stack, a critical data structure almost never discussed in lessons on recursion How the head-tail and “leap of ...

This project-based guide contains complete, runnable programs to help you learn: How recursive functions make use of the call stack, a critical data structure almost never discussed in lessons on recursion How the head-tail and “leap of ...

Both are concerned with notions of definability and with the classification of mathematical objects according to their complexity. These are the common themes which run through the topics discussed here.

This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic.

This text will serve as a useful guide for anyone who wants to learn how to think and program recursively, by analyzing a wide variety of computational problems of diverse difficulty.

This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.

This monograph carries out the program which the author formulated in earlier work, the formalization of the theory of recursive functions of type 0 and 1 and of the theory of realizability.