| 000 | 04738nam a22005775i 4500 | ||
|---|---|---|---|
| 001 | 978-3-030-34209-8 | ||
| 003 | DE-He213 | ||
| 005 | 20240423130057.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 200110s2020 sz | s |||| 0|eng d | ||
| 020 |
_a9783030342098 _9978-3-030-34209-8 |
||
| 024 | 7 |
_a10.1007/978-3-030-34209-8 _2doi |
|
| 050 | 4 | _aQA76.9.M35 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aMAT003000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 100 | 1 |
_aO’Regan, Gerard. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 245 | 1 | 0 |
_aMathematics in Computing _h[electronic resource] : _bAn Accessible Guide to Historical, Foundational and Application Contexts / _cby Gerard O’Regan. |
| 250 | _a2nd ed. 2020. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
| 300 |
_aXXVI, 458 p. 206 illus., 73 illus. in color. _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, _x2197-1781 |
|
| 505 | 0 | _aWhat is a Computer? -- Foundations of Computing -- Overview of Mathematics in Computing -- Introduction to Algorithms -- Number Theory -- Algebra -- Sequences, Series, and Permutations and Combinations -- Mathematical Induction and Recursion -- Graph Theory -- Cryptography -- Coding Theory -- Language Theory and Semantics -- Computability and Decidability -- Matrix Theory -- A Short History of Logic -- Propositional and Predicate Logic -- Advanced Topics in Logic -- The Nature of Theorem Proving -- Software Engineering Mathematics -- Software Reliability and Dependability -- Overview of Formal Methods -- Z Formal Specification Language -- Automata Theory -- Model Checking -- Probability and Statistics -- Complex Numbers and Quaternions -- Calculus -- Epilogue. | |
| 520 | _aThis illuminating textbook provides a concise review of the core concepts in mathematics essential to computer scientists. Emphasis is placed on the practical computing applications enabled by seemingly abstract mathematical ideas, presented within their historical context. The text spans a broad selection of key topics, ranging from the use of finite field theory to correct code and the role of number theory in cryptography, to the value of graph theory when modelling networks and the importance of formal methods for safety critical systems. Topics and features: Includes numerous pedagogical features, such as chapter-opening key topics, chapter introductions and summaries, review questions, and a glossary Describes the historical contributions of such prominent figures as Leibniz, Babbage, Boole, and von Neumann Introduces the fundamental mathematical concepts of sets, relations and functions, along with the basics of number theory, algebra, algorithms, and matrices Explores arithmetic and geometric sequences and series, mathematical induction and recursion, graph theory, computability and decidability, and automata theory Reviews the core issues of coding theory, language theory, software engineering, and software reliability, as well as formal methods and model checking Covers key topics on logic, from ancient Greek contributions to modern applications in AI, and discusses the nature of mathematical proof and theorem proving Presents a short introduction to probability and statistics, complex numbers and quaternions, and calculus This engaging and easy-to-understand book will appeal to students of computer science wishing for an overview of the mathematics used in computing, and to mathematicians curious about how their subject is applied in the field of computer science. The book will also capture the interest of the motivated general reader. | ||
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aMachine theory. | |
| 650 | 0 | _aCoding theory. | |
| 650 | 0 | _aInformation theory. | |
| 650 | 0 | _aMathematics. | |
| 650 | 0 | _aHistory. | |
| 650 | 1 | 4 | _aMathematical Applications in Computer Science. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aCoding and Information Theory. |
| 650 | 2 | 4 | _aHistory of Mathematical Sciences. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030342081 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783030342104 |
| 830 | 0 |
_aUndergraduate Topics in Computer Science, _x2197-1781 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-34209-8 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 942 | _cSPRINGER | ||
| 999 |
_c184781 _d184781 |
||