1 option
Modelling Computing Systems : Mathematics for Computer Science / by Faron Moller, Georg Struth.
- Format:
- Book
- Author/Creator:
- Moller, Faron, 1962- author.
- Struth, Georg, author.
- Series:
- Computer Science (Springer-11645)
- Undergraduate topics in computer science 1863-7310
- Undergraduate Topics in Computer Science, 1863-7310
- Language:
- English
- Subjects (All):
- Computer logic.
- Logic, Symbolic and mathematical.
- Computer science--Mathematics.
- Computer science.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Discrete Mathematics in Computer Science.
- Math Applications in Computer Science.
- Local Subjects:
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Discrete Mathematics in Computer Science.
- Math Applications in Computer Science.
- Physical Description:
- 1 online resource (XVI, 500 pages) : 46 illustrations.
- Edition:
- First edition 2013.
- Contained In:
- Springer eBooks
- Place of Publication:
- London : Springer London : Imprint: Springer, 2013.
- System Details:
- text file PDF
- Summary:
- We have all experienced delays and frustrations as a result of the notorious 'computer glitch.' However, the more dependent we become on computational systems in our daily lives, the more we must ensure that they are safe, reliable and user-friendly. This engaging textbook 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. Topics and features: Introduces important concepts from discrete mathematics as the basis of computational thinking, presented in a stimulating and motivating style 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 an approach to the modelling of computing systems based on state transition systems, exploring the languages and techniques for expressing and reasoning about systems specifications and concurrent implementations This clearly written and classroom-tested textbook/reference is essential reading for first-year undergraduate modules on discrete mathematics and systems modelling.
- Contents:
- Introduction
- Part I: Mathematics for Computer Science
- Propositional Logic
- Sets
- Boolean Algebras and Circuits
- Predicate Logic
- Proof Strategies
- Functions
- Relations
- Inductive and Recursive Definitions
- Proofs by Induction
- Games and Strategies
- Part II: Modelling Computing Systems
- Modelling Processes
- Distinguishing Between Processes
- Logical Properties of Processes
- Concurrent Processes
- Temporal Properties.
- Other Format:
- Printed edition:
- ISBN:
- 978-1-84800-322-4
- 9781848003224
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.