Computability, Enumerability, Unsolvability: Directions in Recursion Theory - Brossura
Libro 199 di 387: London Mathematical Society Lecture Notes
Sinossi
Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Descrizione del libro
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.
Product Description
Book by None
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Computability, Enumerability, Unsolvability: Directions...
Immagini fornite dal venditore
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Editore:
Cambridge University Press, Cambridge, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Antico o usato
Paperback
Da: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 626416
Compra usato
EUR 39,57
EUR 1,66 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Editore:
Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Antico o usato
softcover
Da: Moe's Books, Berkeley, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
softcover. Condizione: very good. Codice articolo 1116677
Compra usato
EUR 43,97
EUR 5,55 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Editore:
Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Antico o usato
Brossura
Da: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 622989
Compra usato
EUR 49,25
EUR 1,66 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Computability, enumerability, unsolvability directions in recursion theory ed. Lecture note series 224.
Editore:
Cambridge, Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Antico o usato
Softcover
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2508853
Compra usato
EUR 39,27
EUR 16,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Computability, enumerability, unsolvability directions in recursion theory ed. Lecture note series 224.
Editore:
Cambridge, Cambridge University Press, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Antico o usato
Softcover
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2502466
Compra usato
EUR 39,51
EUR 16,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190007111
Compra nuovo
EUR 62,48
EUR 3,41 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series, Series Number 224)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9780521557368
Compra nuovo
EUR 71,23
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Computability, Enumerability, Unsolvability (Paperback)
Editore:
Cambridge University Press, Cambridge, 1996
ISBN 10: 0521557364
ISBN 13: 9780521557368
Nuovo
Paperback
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
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 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. Codice articolo 9780521557368
Compra nuovo
EUR 76,70
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series)
Editore:
Cambridge University Press 2009-06-01, 2009
ISBN 10: 0521557364
ISBN 13: 9780521557368
Nuovo
Paperback
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521557368
Compra nuovo
EUR 78,41
EUR 17,69 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 10 disponibili
Foto dell'editore
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 347 pages. 9.00x6.25x0.75 inches. In Stock. This item is printed on demand. Codice articolo __0521557364
Compra nuovo
EUR 81,87
EUR 14,28 shipping
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili