hertling peter (34 Ergebnisse)

kart. 158 S. Abb. mit Umschlag guter Zustand.

549 Seiten, gebunden, Leineneinband mit Schutzumschlag, Seiten leicht angegilbt, sonst guter Zustand, ISBN 3-87070-875-1.

Zustand: Gut. 549 Seiten mit einigen Farb- und Schwarz-weiß-Abbildungen, Orig.-Pappband in Leinenoptik mit Silberprägung und farbig illustr. Orig.-Umschlag mit Silberprägung, auch zahlreiche andere Bände der Reihe vorrätig - guter Zustand - 2000. HM 6117 Buchversand erfolgt aus Deutschland. Sprache: Deutsch Gewicht in Gramm: 720.

Gr.-8°. VIII, 393 Pages. Original Flexible Boards. Very good Condition with only minimal Signs of Usage at the Cover. No Markings in the Text! No Underlinings! No Owner's Note. (Lecture Notes in Computer Science, No. 2064).

OBroschur. Zustand: Sehr gut. Texte englisch u. deutsch. 40 unpag S. mit Stab u. Besetzung, geheft. OBroschur, quer-8°. Mit zahlr. farb. Bühnenskizzen. Abdruck der Spielfassung nur auf englisch. OBeitrag: Saints and Singing - Scherzo in e. Landschaft mit Heiligen (H. Teschke). Lose beiliegt (Presse-?)Mappe mit 4 doppels. bedruckten Bl. mit Stab, Besetzung u. Texten zur Inszenierung. Einband gering fleckig berieben. Schönes, sehr gutes Exemplar. Broschüre.

Taschenbuch. Zustand: Sehr gut. 236 Seiten; 1996 - Bibliotheksausgabe - vorn mit den üblichen Stempeln usw. Umschlag an den Rändern berieben/bestossen. Innenteil tadellos - wirkt u n g e l e s e n - keine Risse, Knicke, Anmerkungen. ! Altersbedingt leicht nachgedunkelt! KEIN Mängelexemplar! Versand aus München V214 Sprache: Deutsch Gewicht in Gramm: 380.

8° (22x13), 158 S., mit TafelAbb., OPbd mit fotoill OU, fest sauber und gepflegt, Sprache: Deutsch. * * * due to EPR-Restrictions NO SHIPPING to Bulgaria, Danmark, Greece, Luxembourg, Poland, Romania, Sweden, Slovakia and Spain * * *.

paperback. Zustand: Befriedigend. 404 Seiten; 9783540421979.4 Gewicht in Gramm: 1.

hardcover. 549 S. Ln. mit Silberprägung im farb. ill. Su, NEUWERTIG! Reader's Digest Bd 647. zahlreiche farbige Abb. und Zeichenband. Sprache: Deutsch Gewicht in Gramm: 800.

Zustand: New. pp. 427.

Zustand: New.

Zustand: New.

Taschenbuch. Zustand: Neu. Neuware -A large amount of the capacity of today¿s computers is used for computations that can be described as computations involving real numbers. In this book, the focus is on a problem arising particularly in real number computations: the problem of veri edor reliablecomputations. Since real numbersare objects c- taining an in nite amount of information, they cannot be represented precisely on a computer. This leads to the well-known problems caused by unveri ed - plementations of real number algorithms using nite precision. While this is t- ditionally seen to be a problem in numerical mathematics, there are also several scienti c communities in computer science that are dealing with this problem. This book is a follow-up of the Dagstuhl Seminar 06021 on ¿Reliable Imp- mentation of Real Number Algorithms: Theory and Practice,¿ which took place January 8¿13, 2006. It was intended to stimulate an exchange of ideas between the di erent communities that deal with the problem of reliable implementation of real number algorithms either from a theoretical or from a practical point of view. Forty-eight researchers from many di erent countries and many di erent disciplines gathered in the castle of Dagstuhl to exchange views and ideas, in a relaxed atmosphere. The program consisted of 35 talks of 30 minutes each, and of three evening sessions with additional presentations and discussions. There were also lively discussions about di erent theoretical models and practical - proaches for reliable real number computations.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 256 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - A large amount of the capacity of today's computers is used for computations that can be described as computations involving real numbers. In this book, the focus is on a problem arising particularly in real number computations: the problem of veri edor reliablecomputations. Since real numbersare objects c- taining an in nite amount of information, they cannot be represented precisely on a computer. This leads to the well-known problems caused by unveri ed - plementations of real number algorithms using nite precision. While this is t- ditionally seen to be a problem in numerical mathematics, there are also several scienti c communities in computer science that are dealing with this problem. This book is a follow-up of the Dagstuhl Seminar 06021 on 'Reliable Imp- mentation of Real Number Algorithms: Theory and Practice,' which took place January 8-13, 2006. It was intended to stimulate an exchange of ideas between the di erent communities that deal with the problem of reliable implementation of real number algorithms either from a theoretical or from a practical point of view. Forty-eight researchers from many di erent countries and many di erent disciplines gathered in the castle of Dagstuhl to exchange views and ideas, in a relaxed atmosphere. The program consisted of 35 talks of 30 minutes each, and of three evening sessions with additional presentations and discussions. There were also lively discussions about di erent theoretical models and practical - proaches for reliable real number computations.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA'95 in Hagen, Germany, CCA'96 in Trier, Germany, and CCA'98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 256 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Neuware -Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology.This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 456 pp. Englisch.

Taschenbuch. Zustand: Neu. Handbook of Computability and Complexity in Analysis | Vasco Brattka (u. a.) | Taschenbuch | xxv | Englisch | 2022 | Springer | EAN 9783030592363 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology.This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.

Hardcover. Zustand: Gut. kA (illustrator). kA. Auflage. Anzahl Bände: 1 - Bd.Nr.: kA - Sprache: de - Einband: Hardcover - Gewicht: 713 - Illust.: kA - Zustand: Gut - Buch hat Lager- und Gebrauchsspuren, ggf. Stempel und Besitzeinträge. Aber vollständig, Bindung intakt, ohne häufige Anstreichungen o.ä.

Buch. Zustand: Neu. Neuware -Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology.This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 456 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology.This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.

Hardcover. Zustand: Brand New. 220 pages. 9.00x6.00x0.56 inches. In Stock.

Buch. Zustand: Neu. Collecting Educational Media | Making, Storing and Accessing Knowledge | Anke Hertling (u. a.) | Buch | Gebunden | Englisch | 2022 | Berghahn Books | EAN 9781800734838 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.

Hardcover. Zustand: Brand New. 140 pages. German language. 7.91x0.67x10.63 inches. In Stock.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Hardcover. Zustand: Sehr gut. Zustand des Schutzumschlags: Gut bis sehr gut. Gewidmet an unbekannten Martin", mit Signatur, im Jahr 1999. Buch weist leichte Gebrauchsspuren auf. KEINE Eintragungen/Markierungen. Sauberes und wohlerhaltenes Exemplar. Sprache: Deutsch. Widmung des Verfassers.

Zustand: NEW.

Zustand: New.

Zustand: New. Over the last two centuries, collectors from around the world have historicized, politicized, and digitized media in the pursuit of knowledge and education. This collected volume explores how collections of educational media influence the ways in which peop.