Topics and features:
- Includes numerous pedagogical features, such as chapter-opening key topics, chapter introductions and summaries, review questions, and a glossary
- Describes the historical contributions of such prominent figures as Leibniz, Babbage, Boole, and von Neumann
- Introduces the fundamental mathematical concepts of sets, relations and functions, along with the basics of number theory, algebra, algorithms, and matrices
- Explores arithmetic and geometric sequences and series, mathematical induction and recursion, graph theory, computability and decidability, and automata theory
- Reviews the core issues of coding theory, language theory, software engineering, and software reliability, as well as formal methods and model checking
- Covers key topics on logic, from ancient Greek contributions to modern applications in AI, and discusses the nature of mathematical proof and theorem proving
- Presents a short introduction to probability and statistics, complex numbers and quaternions, and calculus
This engaging and easy-to-understand book will appeal to students of computer science wishing for an overview of the mathematics used in computing, and to mathematicians curious about how their subject is applied in the field of computer science. The book will also capture the interest of the motivated general reader.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
"This book provides a mathematical context for computing. ... Each chapter concludes with a summary and a series of review questions that reinforce the concepts presented. This is all very readable and self-contained, making the book an excellent resource for most academic libraries. Summing Up: Highly recommended. All undergraduate students and informed general audiences." (D. Z. Spicer, Choice, Vol. 50 (11), July, 2013)