From Jeremy Norman's historyofscience, Novato, CA, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since January 9, 1999
About this Item
Shepherdson, John C. (1926-2015); H. E. Sturgis. Computability of recursive functions. Offprint from Journal of the Association for Computing Machinery 10 (1963). 217-255pp. 248 x 175 mm. Without wrappers; stapled. Some soiling, wear and creasing. Good to very good. First Edition, Offprint Issue. "Shepherdson was a British mathematician who worked in ring theory and mathematical logic . . . His interest in recursive functions led to many other papers on the topic, in particular his joint paper with Howard Sturgis entitled "Computability of recursive functions" (1963). This paper contained an idea similar to a Turing machine, now known as the Shepherdson-Sturgis Register machine. In many ways this is easier to work with than a Turing machine and has proved an important idea" (MacTutor). "John Shepherdson - Biography." Maths History (web). Accessed 22 Dec. 2023. From the library of Martin Davis. . Seller Inventory # 51674
Bibliographic Details
Title: Computabiity of recursive functions. Offprint
Publication Date: 1963
Binding: Soft cover
Edition: 1st Edition
Store Description
Shipping charges will be applied to all orders. All items are guaranteed as described and all purchases may
be returned for any reason within two weeks of receipt. Please notify us in advance if you are making a
return.
Legal entity: Jeremy Norman & Co., Inc.
Business address: 936-B Seventh St., PMB 238, Novato, CA 94945-3000
Email address: orders@jnorman.com
Phone: 415-892-3181
Federal Tax ID Number:94-2261335
Authorized representative: Jeremy M. Norman
Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping cost is required.
Payment Methods
accepted by seller
