9783642631023 - Computable Analysis: An Introduction di Weihrauch, Klaus (9 risultati)

Condizione: New.

Condizione: New. In.

Paperback. Condizione: Brand New. reprint edition. 298 pages. 9.20x6.10x0.80 inches. In Stock.

Taschenbuch. 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.

Taschenbuch. Condizione: Neu. Computable Analysis | An Introduction | Klaus Weihrauch | Taschenbuch | Texts in Theoretical Computer Science. An EATCS Series | x | Englisch | 2013 | Springer | EAN 9783642631023 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. 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.

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.

Taschenbuch. 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 304 pp. Englisch.