Hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 58,15
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 60,51
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,63
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 60,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Revaluation Books, Exeter, Regno Unito
EUR 81,52
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 1st edition. 285 pages. French language. 9.50x6.25x1.00 inches. In Stock.
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Is the exponential function computable Are union and intersection of closed subsets of the real plane computable Are differentiation and integration computable operators Is zero finding for complex polynomials computable Is the Mandelbrot set decidable And in case of computability, what is the computational complexity Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 132,48
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 122,95
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 154,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Sep 2000, 2000
ISBN 10: 3540668179 ISBN 13: 9783540668176
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text. 304 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2000
ISBN 10: 3540668179 ISBN 13: 9783540668176
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. First textbook of this kind: a broad systematic introduction to computable analysis connecting analysis with computability and complexity theorySets a standardWith many examples and figures and numerous exercisesMerging fundamental concepts of a.
Lingua: Inglese
Editore: Springer, Springer Vieweg Sep 2000, 2000
ISBN 10: 3540668179 ISBN 13: 9783540668176
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Is the exponential function computable Are union and intersection of closed subsets of the real plane computable Are differentiation and integration computable operators Is zero finding for complex polynomials computable Is the Mandelbrot set decidable And in case of computability, what is the computational complexity Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 304 pp. Englisch.
Da: preigu, Osnabrück, Germania
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Computable Analysis | An Introduction | Klaus Weihrauch | Buch | Texts in Theoretical Computer Science. An EATCS Series | x | Englisch | 2000 | Springer | EAN 9783540668176 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.