04091nam a22005537a 4500001001500000003000900015005001700024007001500041008004100056020003700097024003500134050001500169050001400184050001200198072001500210072001600225072002300241072002300264082002000287100002800307245012500335264005900460300004400519336002600563337002600589338003600615347002400651490005700675505045800732520175801190650002202948650002002970650002402990650003503014650002203049650003703071650004503108650004603153650004303199700002803242710003403270773002003304776003603324830005703360856004803417912001403465942004103479999001703520sulb-eb0023084BD-SySUS20160413122334.0cr nn 008mamaa130710s2013 xxk| s |||| 0|eng d a97818480032249978-1-84800-322-47 a10.1007/978-1-84800-322-42doi 4aQA76.9.L63 4aQA76.5913 4aQA76.63 7aUM2bicssc 7aUYF2bicssc 7aCOM0510002bisacsh 7aCOM0360002bisacsh04a005.10151132231 aMoller, Faron.eauthor.10aModelling Computing Systemsh[electronic resource] :bMathematics for Computer Science /cby Faron Moller, Georg Struth. 1aLondon :bSpringer London :bImprint: Springer,c2013. aXVI, 500 p. 46 illus.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aUndergraduate Topics in Computer Science,x1863-73100 aIntroduction -- 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. aWe 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. 0aComputer science. 0aComputer logic. 0aMathematical logic. 0aComputer sciencexMathematics.14aComputer Science.24aLogics and Meanings of Programs.24aMathematical Logic and Formal Languages.24aDiscrete Mathematics in Computer Science.24aMath Applications in Computer Science.1 aStruth, Georg.eauthor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9781848003217 0aUndergraduate Topics in Computer Science,x1863-731040uhttp://dx.doi.org/10.1007/978-1-84800-322-4 aZDB-2-SCS 2Dewey Decimal ClassificationceBooks c45176d45176