Items related to Computability, Enumerability, Unsolvability: Directions...
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224) - Softcover
Synopsis
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists.
"synopsis" may belong to another edition of this title.
From the Back Cover
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.
"About this title" may belong to another edition of this title.
Search results for Computability, Enumerability, Unsolvability: Directions...
Seller Image
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Published by
Cambridge University Press, Cambridge, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Used
Paperback
Seller: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Cambridge: Cambridge University Press, 1996. 347 pp. 23 x 15 cm. Textured stiff paper wrappers printed teal and blue. Light wrinkle at head of spine. Light rubbing to extremities. Previous owner's bookplate pasted to inside of front cover. Interior otherwise clean and unmarked. Binding firm with no creases or cracks. . Soft Cover. Very Good. Seller Inventory # 626416
Quantity: 1 available
Stock Image
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Published by
Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Used
softcover
Seller: Moe's Books, Berkeley, CA, U.S.A.
Seller rating 4 out of 5 stars
softcover. Condition: very good. Seller Inventory # 1116677
Quantity: 1 available
Stock Image
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Published by
Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Used
Softcover
Seller: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. Cambridge University Press, 1996. Cover lightly rubbed/soiled, rear flap slightly creased at spine juncture, corners very ligthly rubbed, faintly bumped, spine ends very lightl rubbed, faintly bumped; edges very lightly soiled, fore-edge very lightly bumped; front endpaper has erasures; binding tight; cover, edges, and interior intact and clean except as noted. paperback. Good. Seller Inventory # 622989
Quantity: 1 available
Seller Image
Computability, enumerability, unsolvability directions in recursion theory ed. Lecture note series 224.
Published by
Cambridge, Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Used
Softcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 COM 9780521557368 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2508853
Quantity: 1 available
Seller Image
Computability, enumerability, unsolvability directions in recursion theory ed. Lecture note series 224.
Published by
Cambridge, Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Used
Softcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 COM 9780521557368 Sprache: Englisch Gewicht in Gramm: 550. Seller Inventory # 2502466
Quantity: 1 available
Stock Image
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224)
Published by
Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
New
Softcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190007111
Quantity: Over 20 available
Stock Image
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224)
Published by
Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521557368
Quantity: Over 20 available
Stock Image
Computability, Enumerability, Unsolvability (Paperback)
Published by
Cambridge University Press, Cambridge, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
New
Paperback
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists. The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521557368
Quantity: 1 available
Stock Image
Computability, Enumerability, Unsolvability
Published by
Cambridge University Press CUP, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
New
Softcover
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 356. Seller Inventory # 26555093
Quantity: 4 available
Stock Image
Computability, Enumerability, Unsolvability
Published by
Cambridge University Press, 2009
ISBN 10: 0521557364
ISBN 13: 9780521557368
Used
Softcover
Seller: Buchpark, Trebbin, Germany
Seller rating 5 out of 5 stars
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 2612280/202
Quantity: 1 available