DeepRead
Cover of Mathematics for Computer Science

Mathematics for Computer Science

Eric Lehman, F Thomson Leighton, Albert R Meyer · 2017

Mathematics and physics › Linear algebra textbooks

#642 most recommended

About the book

An undergraduate introduction to the discrete mathematics and probability used in computer science, written for MIT's 6.042J course. It covers logic, sets, functions, relations, number theory, graph theory, state machines, counting, discrete probability, random variables, and expectation, starting from first principles. Mathematical reasoning is a practical working tool for computer scientists, not only a theoretical subject. The text argues that careful definitions, precise statements, and rigorous proofs, especially by induction and invariants, are how one establishes that programs and systems are correct. It also presents probability and counting as the means to analyze randomized algorithms and the average-case behavior of systems.

Written by Claude from what it knows of this book.

What Hacker News says 57% recommend · 5% critical

0102020092015202020252018 peak · 17
This bookAverage book in Linear algebra textbooks

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 5 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2017
ISBN
9781680921229
Editions known
6 at Open Library
Open Library
OL33370820W

Explore in the mosaic

Read next: its neighbours on the mosaic