L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBNLes informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Frais de port :
Gratuit
Vers Etats-Unis
Description du livre Soft Cover. Etat : new. N° de réf. du vendeur 9783642631023
Description du livre Etat : New. N° de réf. du vendeur ABLIING23Mar3113020231785
Description du livre Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. N° de réf. du vendeur ria9783642631023_lsuk
Description du livre Etat : New. Book is in NEW condition. N° de réf. du vendeur 3642631029-2-1
Description du livre Etat : New. New! This book is in the same immaculate condition as when it was published. N° de réf. du vendeur 353-3642631029-new
Description du livre Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642631023
Description du livre Paperback. Etat : Brand New. reprint edition. 298 pages. 9.20x6.10x0.80 inches. In Stock. N° de réf. du vendeur x-3642631029
Description du livre Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642631023
Description du livre Etat : 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. N° de réf. du vendeur 5065432