000 04107nam a22005655i 4500
001 978-1-84800-322-4
003 DE-He213
005 20200421111206.0
007 cr nn 008mamaa
008 130710s2013 xxk| s |||| 0|eng d
020 _a9781848003224
_9978-1-84800-322-4
024 7 _a10.1007/978-1-84800-322-4
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aMoller, Faron.
_eauthor.
245 1 0 _aModelling Computing Systems
_h[electronic resource] :
_bMathematics for Computer Science /
_cby Faron Moller, Georg Struth.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2013.
300 _aXVI, 500 p. 46 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aUndergraduate Topics in Computer Science,
_x1863-7310
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aMath Applications in Computer Science.
700 1 _aStruth, Georg.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781848003217
830 0 _aUndergraduate Topics in Computer Science,
_x1863-7310
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-84800-322-4
912 _aZDB-2-SCS
942 _cEBK
999 _c54182
_d54182