Author

Contributions

  • Milmeister, Gérard. - Contributor
  • Weissmann, Jody. - Contributor

Publication

2006 - Springer, Berlin

Language

English

Word Count

97,000 words, Guess

Page Count

388 pages

Identifiers

and 2 more
  • Goodreads1013283
  • LibraryThing2542319

Classifications

  • LCCQA76.9.M35 M49 2006

Description

This second volume of a comprehensive tour through mathematical core subjects for computer scientists completes the ?rst volume in two - gards: Part III ?rst adds topology, di?erential, and integral calculus to the t- ics of sets, graphs, algebra, formal logic, machines, and linear geometry, of volume 1. With this spectrum of fundamentals in mathematical e- cation, young professionals should be able to successfully attack more involved subjects, which may be relevant to the computational sciences. In a second regard, the end of part III and part IV add a selection of more advanced topics. In view of the overwhelming variety of mathematical approaches in the computational sciences, any selection, even the most empirical, requires a methodological justi?cation. Our primary criterion has been the search for harmonization and optimization of thematic - versity and logical coherence. This is why we have, for instance, bundled such seemingly distant subjects as recursive constructions, ordinary d- ferential equations, and fractals under the unifying perspective of c- traction theory.

Description

This two-volume textbook Comprehensive Mathematics for Computer Scientists is a self-contained comprehensive presentation of mathematics including sets, numbers, graphs, algebra, logic, grammars, machines, linear geometry, calculus, ODEs, and special themes such as neural networks, Fourier theory, wavelets, numerical issues, statistics, categories, and manifolds. The concept framework is streamlined but defining and proving virtually everything. The style implicitly follows the spirit of recent topos-oriented theoretical computer science. Despite the theoretical soundness, the material stresses a large number of core computer science subjects, such as, for example, a discussion of floating point arithmetic, Backus-Naur normal forms, L-systems, Chomsky hierarchies, algorithms for data encoding, e.g., the Reed-Solomon code. The numerous course examples are motivated by computer science and bear a generic scientific meaning. For the second edition the entire text has been carefully reread, and many examples have been added, as well as illustrations and explications to statements and proofs which were exposed in a too shorthand style. This makes the book more comfortable for instructors as well as for students to handle.

Subjects

Series Statement

  • Universitext

Other Editions

  • Comprehensive mathematics for computer scientistsSpringer2006

Similar Books

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!