- Full Description
This book equips the student with essential intellectual tools that are needed from the very beginning of university studies in computing. These consist of abilities and skills - to pass from a concrete problem to an abstract representation, reason with the abstract structure coherently and usefully, and return with booty to the specific situation. The most basic and useful concepts needed come from the worlds of sets (with also their employment as relations and functions), structures (notably trees and graphs), and combinatorics (alias principles of counting, with their application in the world of probability). Recurring in all these are two kinds of instrument of proof – logical (notably inference by suppositions, reductio ad absurdum, and proof by cases), and mathematical (notably induction on the positive integers and on well-founded structures). From this book the student can assimilate the basics of these worlds and set out on the paths of computing with understanding and a platform for further study as needed.
- Table of Contents
Table of Contents
- 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.
If you think that you've found an error in this book, please let us know by emailing to email@example.com . You will find any confirmed erratum below, so you can check if your concern has already been addressed. No errata are currently published