What do you think?
Rate this book
Theory of Recursive Functions and Effective Computability
(Reprint of the 1967 edition)
506 pages, Paperback
First published January 1, 1967
2 people are currently reading
96 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 4 of 4 reviews
October 11, 2021
This book deserves and needs to be used as a textbook for any computer science curriculum. Henry Rogers narrates the unfolding of the theory of computation in a simple, yet engaging manner.
October 28, 2008
This is really fun stuff.
July 5, 2017
If you are CS student, it will help you understand the recursive algorithms better.
November 12, 2017
complicated!
Displaying 1 - 4 of 4 reviews