mathematics for computer science book is written by Eric Lehman, F Thomson Leighton, and Albert R Meyer. This book contains 1006 pages and consists of 5 sections. This book have 22 chapters starting from What is a Proof?, The Well Ordering Principle, Logical Formulas, Mathematical Data Types, Induction, State Machines, Recursive Data Types, Infinite Sets, Number Theory, Directed graphs & Partial Orders, Communication Networks, Simple Graphs, Planar Graphs, Sums and Asymptotics, Cardinality Rules, Generating Functions, Events and Probability Spaces, Conditional Probability, Random Variables, Deviation from the Mean, Random Walks, and Recurrences. This book is licensed under creative common attribution-sharealike 3.0 licensed.
About the Authors of mathematics for computer science book:
Eric D. Lehman, teaches travel literature and creative writing at the University of Bridgeport, and his essays, reviews, and stories have appeared in dozens of journals and magazines.
Dr. Tom Leighton co-founded Akamai Technologies in 1998 and served as Akamai’s Chief Scientist until he became its CEO in 2013. Under Dr. Leighton’s leadership, Akamai has evolved from its origins as a Content Delivery Network (CDN) into one of the most essential and trusted cloud delivery and cybersecurity platforms, upon which many of the world’s best brands and enterprises build and secure their digital experiences. During his initial four years as CEO, Akamai’s revenue and profit grew by 70%, and annual revenue from Akamai’s security business grew 15-fold to more than $400 million per year. In 1981, he became the first winner of the Machtey Award at the annual IEEE Symposium on Foundations of Computer Science, and in 2001 he received the IEEE Computer Society Charles Babbage Award for contributions in the field of parallel computing. He is a Fellow of the American Academy of Arts and Sciences, the National Academy of Engineering and the National Academy of Sciences.
Prof. Meyer has been at MIT since 1969. He is best known for his contributions to computational complexity theory, including the formulation of the POLYNOMIAL-TIME HIERARCHY and the first proofs of the exponential complexity of decision problems in logic and algebra. He has contributed extensively to Type Theory and Semantics of programming languages and concurrent processes. As an outgrowth of his recent responsibility for several large introductory courses, he has become interested in educational technology.
Prof. Meyer has supervised twenty-six Ph.D students, many now prominent researchers on the faculty of leading departments throughout the country. He is a Fellow of the American Academy of Arts and Science, a lifetime member and Fellow of the ACM, and is Editor-in-Chief of the international journal Information and Computation.
conclusion of mathematics for computer science book:
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.