Modelling Computing Systems: Mathematics for Computer Science

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This engaging text presents the fundamental mathematics and modelling techniques for computing systems in a novel and light-hearted way, which can be easily followed by students at the very beginning of their university education. Key concepts are taught through a large collection of challenging yet fun mathematical games and logical puzzles that require no prior knowledge about computers. The text begins with intuition and examples as a basis from which precise concepts are then developed; demonstrating how, by working within the confines of a precise structured method, the occurrence of errors in the system can be drastically reduced. Features: demonstrates how game theory provides a paradigm for an intuitive understanding of the nature of computation; contains more than 400 exercises throughout the text, with detailed solutions to half of these presented at the end of the book, together with numerous theorems, definitions and examples; describes a modelling approach based on state transition systems.

Author(s): Faron Moller, Georg Struth (auth.)
Series: Undergraduate Topics in Computer Science
Edition: 1
Publisher: Springer-Verlag London
Year: 2013

Language: English
Pages: 500
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Discrete Mathematics in Computer Science; Math Applications in Computer Science

Front Matter....Pages I-XVI
Introduction....Pages 1-14
Front Matter....Pages 15-15
Propositional Logic....Pages 17-55
Sets....Pages 57-86
Boolean Algebras and Circuits....Pages 87-108
Predicate Logic....Pages 109-129
Proof Strategies....Pages 131-154
Functions....Pages 155-178
Relations....Pages 179-199
Inductive and Recursive Definitions....Pages 201-222
Proofs by Induction....Pages 223-250
Games and Strategies....Pages 251-275
Front Matter....Pages 277-277
Modelling Processes....Pages 279-307
Distinguishing Between Processes....Pages 309-332
Logical Properties of Processes....Pages 333-356
Concurrent Processes....Pages 357-379
Temporal Properties....Pages 381-403
Back Matter....Pages 405-500