Sets, Logic and Maths for Computing
Seiten
2012
|
2nd ed. 2012
Springer London Ltd (Verlag)
978-1-4471-2499-3 (ISBN)
Springer London Ltd (Verlag)
978-1-4471-2499-3 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
This easy-to-follow book introduces the mathematical language, knowledge and problem-solving skills needed for the study of computing. The language is both qualitative and quantitative, and includes basic notions of logic used for representation and proof.
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 highlight boxes that raise common queries and clear confusions; provides numerous exercises, with selected solutions.
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 highlight boxes that raise common queries and clear confusions; provides numerous exercises, with selected solutions.
Dr. David Makinson is a Visiting Professor in the Department of Philosophy, Logic and Scientific Method at the London School of Economics, UK.
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.- Just Supposing: Proof and Consequence.
| Reihe/Serie | Undergraduate Topics in Computer Science | Undergraduate Topics in Computer Science |
|---|---|
| Zusatzinfo | 17 Illustrations, black and white; XXI, 283 p. 17 illus. |
| Verlagsort | England |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 474 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
| ISBN-10 | 1-4471-2499-5 / 1447124995 |
| ISBN-13 | 978-1-4471-2499-3 / 9781447124993 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
