DESCRIPTION:
Theory of Recursive Functions and Effective Computability by Hartley Rogers, Jr. McGraw-Hill, 1967. Hardcover with dust jacket, McGraw-Hill Series in Higher Mathematics, 482 pages.
A foundational, canonical text in computability and recursion theory, still widely cited today and later reprinted by MIT Press (1987). Covers recursive functions, Turing computability, the arithmetical hierarchy, recursively enumerable sets and degrees, and effective reducibility, presented with Rogers\'s noted semi-formal, intuitive approach. This remains a standard graduate reference in mathematical logic and theoretical computer science.
Condition: green cloth boards are solid with tight binding, corner bumped; text block is clean with no markings apart from a prior owner\'s name (\"Blattner\") penciled on the front free endpaper. The dust jacket, present but worn, shows chipping and closed tears at the spine ends and corners, along with some edge wear; it is intact and displays the title and design clearly. Copies of this title are notably scarce with any dust jacket at all.
Thank you
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.