Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science)

^ Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science) Î PDF Read by ! David Makinson eBook or Kindle ePUB Online free. Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science) This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features: teaches finite math as a language for thinkin

Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science)

Author :
Rating : 4.11 (770 Votes)
Asin : 1447124995
Format Type : paperback
Number of Pages : 283 Pages
Publish Date : 2017-11-28
Language : English

DESCRIPTION:

Dr. David Makinson is a Visiting Professor in the Department of Philosophy, Logic and Scientific Method at the London School of Economics, UK.

… This easy-to-follow text allows readers to carry out their computing studies with a clear understanding of the basic finite mathematics and mathematical logics that they will need. 1239, 2012) . … the book will be of interest to any student who would like to understand the mathematical language.” (Valentina Dagienë, Zentralblatt MATH, Vol. … is ideal for self-study as well as classroom use. From the reviews of the second edition:“This book is an excellent introductory course on mathematical language, knowledge and problem solving skills for undergraduate st

Five Stars Hard course, but book is not bad

This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features: teaches finite math as a language for thinking, as much as knowledge and skills to be acquired; uses an intuitive approach with a focus on examples for all general concepts; brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction; balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives; includes

OTHER BOOK COLLECTION