Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 61,52
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 99,14
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 196.
Librería: preigu, Osnabrück, Alemania
EUR 63,85
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Computability | A Mathematical Sketchbook | Douglas S. Bridges | Taschenbuch | Graduate Texts in Mathematics | xi | Englisch | 2013 | Springer | EAN 9781461269250 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 72,88
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 58,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer, Humana Jul 2013, 2013
ISBN 10: 1461269253 ISBN 13: 9781461269250
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 69,54
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included. 196 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 101,79
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 196 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
EUR 60,06
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also refe.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 102,26
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 196.
Idioma: Inglés
Publicado por Springer, Humana Jul 2013, 2013
ISBN 10: 1461269253 ISBN 13: 9781461269250
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 69,54
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 196 pp. Englisch.