CONTENTS
1.1.2 Sets and their Operations
1.1.3 Alphabets, Strings and Languages
1.3 Big and Small Infinite Sets; Diagonalization
1.4 Induction from a User’s Perspective
1.4.1 Complete, or Course-of-Values, Induction
1.4.4 The Equivalence of Induction and the Least Principle
1.7 Recursive Definitions of Functions
2 Algorithms, Computable Functions and Computations
2.1.1 A Programming Framework for Computable Functions
2.1.2 Primitive Recursive Functions
2.1.3 Simultaneous Primitive Recursion
2.2 A Programming Formalism for the Primitive Recursive Functions
2.3 URM Computations and their Arithmetization
2.4 A Double Recursion that Leads Outside the Primitive Recursive Function Class
Get Theory of Computation now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.