9780521557368 - Computability, Enumerability, Unsolvability: Directions in Recursion Theory (22 risultati)

Condizione: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

softcover. Condizione: very good.

Condizione: 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.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

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.

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.

Condizione: New. In.

Paperback. Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 356 | Sprache: Englisch | Produktart: Bücher | 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.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condizione: New. Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. Editor(s): Cooper, S. B.; etc.; Slaman, T. A. (University of Chicago); Wainer, S. S. (University of Leeds). Series: London Mathematical Society Lecture Note Series. Num Pages: 356 pages, Illustrations. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 20. Weight in Grams: 507. . 1996. paperback. . . . . Books ship from the US and Ireland.

Condizione: New. Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. Editor(s): Cooper, S. B.; etc.; Slaman, T. A. (University of Chicago); Wainer, S. S. (University of Leeds). Series: London Mathematical Society Lecture Note Series. Num Pages: 356 pages, Illustrations. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 20. Weight in Grams: 507. . 1996. paperback. . . . .

Paperback. Condizione: 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, 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 for specialists and non-specialists alike. The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. This volume provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Condizione: Brand New. 347 pages. 9.00x6.25x0.75 inches. In Stock. This item is printed on demand.

Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.

Paperback. Condizione: 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, 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 for specialists and non-specialists alike. The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. This volume provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Paperback. Condizione: 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, 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 for specialists and non-specialists alike. The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. This volume provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.