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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Klaus Weihrauch ist seit 1990 bei der SAP AG und dort im Umfeld der Lösung Produktionsplanung und -steuerung (PP) tätig. Unter anderem erstellte er das Daten- und Prozessmodell für die R/3-Komponente PP und war im Rahmen von AcceleratedSAP für den Bereich der Produktionsplanung verantwortlich. Zurzeit ist Klaus Weihrauch Projektleiter im Bereich Best Practices for mySAP SCM, in dem vorkonfigurierte Lösungen für das Supply Chain Management erstellt werden.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: California Books, Miami, FL, USA
Zustand: New. Artikel-Nr. I-9783540668176
Anzahl: Mehr als 20 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9783540668176_new
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 918870-n
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 1st edition. 285 pages. French language. 9.50x6.25x1.00 inches. In Stock. Artikel-Nr. x-3540668179
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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. Artikel-Nr. 9783540668176
Anzahl: 1 verfügbar
Anbieter: Home-set, Mannheim, Deutschland
Gebundene Ausgabe. Zustand: Neu. 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. Sprache: Englisch Gewicht in Gramm: 627. Artikel-Nr. IB-89117
Anzahl: 2 verfügbar
Anbieter: BennettBooksLtd, Los Angeles, CA, USA
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Artikel-Nr. Q-3540668179
Anzahl: 1 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: As New. Unread book in perfect condition. Artikel-Nr. 918870
Anzahl: Mehr als 20 verfügbar