The Theoretical Minimum: What You Need to Know to Start Doing Physics

4.25/5 · 2K+ ratings

Leonard Susskind and George Hrabovsky bridge the gap between casual pop-science readers and serious physics students. While most introductory books avoid complex equations, this guide embraces them, providing the mathematical foundation necessary to actually calculate how the world works. Based on a popular Stanford University course, it simplifies deep concepts without stripping away the technic…

Shelves
Popular Science Nonfiction Education Leonard Susskind book Textbooks Physics Unfinished Mathematics George Hrabovsky Stem Science Academic

More like this


Think Complexity: Complexity Science and Computational Modeling

Expand your Python skills by working with data structures and algorithms in a refreshing context―through an eye-opening exploration of complexity …

4.25/5 · 2K+ ratings

From Mathematics to Generic Programming

In this substantive yet accessible book, pioneering software designer Alexander Stepanov and his colleague Daniel Rose illuminate the principles o…

4.25/5 · 2K+ ratings

Quantum Mechanics: The Theoretical Minimum

Leonard Susskind and Art Friedman offer a serious introduction to quantum physics that bridges the gap between surface level pop science and dense…

4.25/5 · 2K+ ratings

Introduction to Automata Theory, Languages, and Computation

It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. Wit…

4.25/5 · 2K+ ratings

The Information: A History, a Theory, a Flood

James Gleick, the author of the best sellers Chaos and Genius, now brings us a work just as astonishing and masterly: a revelatory chronicle and m…

4.25/5 · 2K+ ratings

Introducing Python: Modern Computing in Simple Packages

With Introducing Python, Bill Lubanovic brings years of knowledge as a programmer, system administrator, and author to a book of impressive depth …

4.25/5 · 2K+ ratings

Computers and Intractability: A Guide to the Theory of NP-Completeness

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is …

4.25/5 · 2K+ ratings

Types and Programming Languages

A comprehensive introduction to type systems and programming languages. A type system is a syntactic method for automatically checking the absence…

4.25/5 · 2K+ ratings

Applied Cryptography: Protocols, Algorithms, and Source Code in C

"…the best introduction to cryptography I've ever seen. … The book the National Security Agency wanted never to be published." –Wired Magazine…

4.25/5 · 2K+ ratings

Algorithm Design

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and a…

4.25/5 · 2K+ ratings

The Elements of Statistical Learning: Data Mining, Inference, and Prediction

During the past decade there has been an explosion in computation and information technology. With it has come vast amounts of data in a variety o…

4.25/5 · 2K+ ratings

An Introduction to Functional Programming Through Lambda Calculus

Functional programming is rooted in lambda calculus, which constitutes the worlds smallest programming language. This well-respected text offers a…

4.25/5 · 2K+ ratings