Mathematics in Computing
An Accessible Guide to Historical, Foundational and Application Contexts
Buch in deiner Nähe kaufen
Beschreibung
This 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.
This 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.
This fully updated new edition has been expanded with a more comprehensive treatment of algorithms, logic, automata theory, model checking, software reliability and dependability, algebra, sequences and series, and mathematical induction.
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 mathematicianscurious about how their subject is applied in the field of computer science. The book will also capture the interest of the motivated general reader.Provides a broad review of the applications of mathematics to computing, including software engineering, coding theory, cryptography and software reliability Emphasizes the application of mathematics to computing, rather than mathematics for its own sake, covering both discrete and continuous mathematics Discusses the application of mathematical techniques to increase confidence in program correctness Fully revised and updated new edition
Autor*in
Gerard O’Regan
Themen in »Mathematics in Computing«
Calculus Coding Theory Cryptography Discrete Mathematics Formal Methods Graph Theory Group Theory and Ring Theory History of Mathematics Matrix Theory Number Theory Probability and Statistics Software Engineering Software Reliability Z Specification Language
Stimmen zu »Mathematics in Computing«
“This book, authored by a prolific writer, is about the applications of mathematics in computing and places emphasis on historical contexts where applicable. Aimed at undergraduate students of computer science, the book provides helpful pedagogical features: key topics covered in each chapter are listed at the beginning … . The book achieves its objective of providing a flavour of the mathematics used in computing, so the general reader will likely benefit from it as well.” (David J. Littleboy, SIGACT News, Vol. 55 (1), 2024)
()