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.
Book Description
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this text provide a picture of current ideas and methods in investigations into the structure of the computable and noncomputable universe.
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.
- PublisherCambridge University Press
- Publication date1996
- ISBN 10 0521557364
- ISBN 13 9780521557368
- BindingPaperback
- LanguageEnglish
- Edition number1
- Number of pages356
- EditorCooper S. B., Slaman T. A., Wainer S. S.
Search results for Computability, Enumerability, Unsolvability: Directions...
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 (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: Directions in Recursion Theory (London Mathematical Society Lecture Note Series)
Published by
Cambridge University Press 2009-06-01, 2009
ISBN 10: 0521557364
ISBN 13: 9780521557368
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521557368
Quantity: 10 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: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521557368_new
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, Fairfield, 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: Directions in Recursion Theory
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 347 pages. 9.00x6.25x0.75 inches. In Stock. This item is printed on demand. Seller Inventory # __0521557364
Quantity: 1 available
Stock Image
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Published by
Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 550. Seller Inventory # C9780521557368
Quantity: Over 20 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 - Gepflegter, sauberer Zustand. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 356 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 2612280/202
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