"synopsis" may belong to another edition of this title.
"About this title" may belong to another edition of this title.
Book Description Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEOCT23-191989
Book Description Condition: New. Brand New Original US Edition.We Ship to PO BOX Address also. EXPEDITED shipping option also available for faster delivery.This item may ship from the US or other locations in India depending on your location and availability. Seller Inventory # ABTR-221520
Book Description Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed. This item may ship from the US or our Overseas warehouse depending on your location and stock availability. We Ship to PO BOX Location also. Seller Inventory # ABRR-221520
Book Description Hardcover. Condition: new. Seller Inventory # 9783540668176
Book Description Condition: New. pp. 304. Seller Inventory # 26348310
Book Description Hardback or Cased Book. Condition: New. Computable Analysis: An Introduction 1.33. Book. Seller Inventory # BBS-9783540668176
Book Description Condition: New. pp. 304 Illus. Seller Inventory # 7532361
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783540668176_lsuk
Book Description 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
Book Description Buch. Condition: 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. Seller Inventory # 9783540668176