Discrete Mathematics Using a Computer

Front Cover
Springer London, Aug 14, 2006 - Computers - 441 pages
1 Review
Computer science abounds with applications of discrete mathematics, yet s- dents of computer science often study discrete mathematics in the context of purely mathematical applications. They have to ?gure out for themselves how to apply the ideas of discrete mathematics to computing problems. It is not easy. Most students fail to experience broad success in this enterprise, which is not surprising, since many of the most important advances in science and engineeringhavebeen, precisely, applicationsofmathematicstospeci?cscience and engineering problems. Tobesure,mostdiscretemathtextbooksincorporatesomeaspectsapplying discrete math to computing, but it usually takes the form of asking students to write programs to compute the number of three-ball combinations there are in a set of ten balls or, at best, to implement a graph algorithm. Few texts ask students to use mathematical logic to analyze properties of digital circuits or computer programs or to apply the set theoretic model of functions to understand higher-order operations. A major aim of this text is to integrate, tightly, the study of discrete mathematics with the study of central problems of computer science.

From inside the book

What people are saying - Write a review

User Review - Flag as inappropriate

An exellent book to learn Mathematics and programming at the same time! Highly recommended. And it is about Haskell :)

Contents

Introduction to Haskell
3
Equational Reasoning
37
Recursion
47
Copyright

12 other sections not shown

Common terms and phrases

References to this book

About the author (2006)

John O'Donnell, a retired senior foreign service officer living in Great Falls, Virginia, spent thirty years with the Agency for International Development in Southeast Asia & Central & South America & continues his involvement in economic development as a consultant.

Bibliographic information