Sets, logic & maths for computing (Undergraduate topics in computer science)
Langue : Anglais
Auteur : MAKINSON D.
University studies in computing require the ability to pass from a concrete problem to an abstract representation, reason with the abstract structure, and return with useful solutions to the specific situation. The tools for developing these skills are in part qualitative concepts such as set, relation, function, and structures such as trees and well-founded orders. They are also in part quantitative notably elementary combinatorics and finite probability. Recurring in all of these are instruments of proof, both purely logical ones (such as proof by contradiction) and mathematical (the various forms of induction).
Collecting Things Together: Sets.- Comparing Things: Relations.- Associating One Item with Another: Functions.- Recycling Outputs as Inputs: Induction and Recursion.- Counting Things: Combinatorics.- Weighing the Odds: Probability.- Squirrel Math: Trees.- Yea and Nay: Propositional Logic.- Something about Everything: Quantificational Logic.
From the reviews:"The book covers the very basic concepts of sets, relations, functions, induction and recursion, combinatorics, probability, trees, propositional logic, and elementary concepts of predicate logic. The text is easy to read, and the concepts are presented in an understandable way using many examples. The book contains exercises with solutions, gives several further exercises, and hints for further selected reading. ... the book is recommended for undergraduates as a very first introduction to the basic ideas of finite mathematics and logic." (D. Seese, ACM Computing Reviews, January, 2009)
Date de parution : 08-2008
Ouvrage de 290 p.
Thème de Sets, logic & maths for computing ... :
© 2024 LAVOISIER S.A.S.