Features
- Cover Type: Paperback with 355 pages
- Published by: Springer
- Edition: 1st Edition November 23, 2004
- Written in: English
- ISBN 10 Number: 3540208615
- ISBN 13 Number: 978-3540208617
-
Book Dimensions:
9.2 x 6.1 x 0.9 inches
- Weighs: 1.2 pounds
Product Review
From the reviews:
"This book is the second volume of . each chapter summarizes rich and flourishing theories . The authors are honest, and provide extensive references for the interested reader. will find several exercises as well. My overall opinion of this book is very positive. It provides a good and well-founded starting point for the study of several different areas of mathematics. I recommend it for students and scientists, especially in computer science ." (A. Pethö, Computing Reviews, April, 2005)
"This two-volume textbook Comprehensive Mathematics for Computer Scientists is a self-contained comprehensive presentation of mathematics . The concept framework is streamlined but defining and proving virtually everything. The style implicitly follows the spirit of recent topos-oriented theoretical computer science. The numerous course examples are motivated by computer science and bear a generic scientific meaning." (Zentralblatt für Didaktik der Mathematik, August, 2005)
"The second volume of this comprehensive tour through mathematical subjects for computer scientists deals with topology, differential- and integral-calculus in one and several variables, and ordinary differential equations. if she (he) masters these the result will be an great computer scientist. With the aim to achieve this it would be quite motivating for the reader to see more concrete applications of the abstract mathematical theory." (H. Mitsch, Monatshefte für Mathematik, Vol. 147 (2), 2006)
"This is the second volume of a self-contained comprehensive presentation of mathematics for the working computer scientists. The presentation of the book uses in an appropriate way the unifying language of category theory. This gives a new and more elegant view of the content . The text is complemented by a large number of examples, illustrations, and applications and ends with the guide for future reading on the different topics." (Yves Félix, Bulletin of the Belgian Mathematical Society, Vol. 12 (2), 2005)
Book Description
The two-volume textbook
Comprehensive Mathematics for the Working Computer Scientist, of which this is the second volume, 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. This text is complemented by an online university course which covers the same theoretical content, albeit in a totally different presentation. The student or working scientist who gets involved in this text may at any time consult the online interface which comprises applets and other interactive tools.
Reader Reviews
This review is from: Comprehensive Mathematics for Computer Scientists 1: Sets and Numbers, Graphs and Algebra, Logic and Machines, Linear Geometry (Universitext) (Paperback)
If you are a computer professional and wondering how much maths you need, this book might be a good answer. Much of its content is discrete maths. Like factorising primes. A background in this leads into the theory of public key encryption. Something well worth knowing. Note that the book's discussion of factorising primes is brief. You'd need another text for the public key material. Also potentially useful is a foray into graph theory. Rings and modules also make their appearance. Predicate logic is another topic explained. The text also discusses matrices from a viewpoint more formal than that of a typical first course in linear algebra. It generalises to an exposition of vector spaces. This portion of the text is continuum maths. Do note that the average computer programmer actually uses very little of the material. Emphasis on programmer. But as the title says, the book is directed towards the computer scientist, who needs a more formal grounding.
Comment | |
(Report this)
Search for books at
