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.
"synopsis" may belong to another edition of this title.
Seller: Books From California, Simi Valley, CA, U.S.A.
hardcover. Condition: Very Good. Seller Inventory # mon0004152893
Seller: HPB-Red, Dallas, TX, U.S.A.
Hardcover. Condition: 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! Seller Inventory # S_330547724
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 918870-n
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783540668176
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service. Seller Inventory # POD-329373
Seller: medimops, Berlin, Germany
Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages. Seller Inventory # M03540668179-V
Quantity: 1 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540668176_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: 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. Seller Inventory # 9783540668176
Quantity: 2 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 918870-n
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 285 pages. French language. 9.50x6.25x1.00 inches. In Stock. Seller Inventory # x-3540668179
Quantity: 2 available