All Books

404 books grouped by track.

Programming Languages

Data Structures and Algorithms

Web

Python Data Analysis

Mathematics

Applied Math

Applied mathematics for programmers — computer graphics transforms, cryptography, combinatorics, and logic & computation — each built from exact, executable, honest-by-construction lessons.

Physics

Biology

Finance

Computational finance from its exact arithmetic core: the time value of money, option payoffs, fixed-income cash flows, and no-arbitrage pricing through binomial option pricing, American options, and forwards & futures, plus DCF valuation, yield curves, interest-rate swaps, two-asset portfolios, VaR/expected shortfall, and the efficient frontier — pinned numbers, validated diagrams, and a strict no-investment-advice stance.

Law

Computational Law maps the structural, computable foundations of US law for engineers and CS readers: sources, citation graphs, procedure flowcharts, deadline arithmetic, and legal-analysis frameworks. Each book treats diagrams as simplified models with jurisdiction caveats and a not-legal-advice stance: models, not law. The track's firewall doctrine is RENDER STRUCTURE · REFUSE INTERPRETATION · CITE · ABSTAIN · HAND-OFF.

Databases

Databases introduces data modeling and query foundations with static, recomputed diagrams: relations, relational algebra, SQL semantics, index search structures, query plans, optimizer estimate choices, transactions, isolation anomalies, write-ahead logs, replication, small-scale consensus, concurrency-control protocols, normalization, partitioning, two-phase commit, isolation-level synthesis, SQL surface extensions, safe commit/rollback classifications, backup restore-point replay, finite schema-change transforms, saved-query views, key-constraint checks, finite check-constraint validation, exact ordering/pagination, exact grouping/aggregates, finite COUNT DISTINCT behavior, finite table writes, finite UPDATE statements, finite DELETE statements, finite INSERT statements, finite subqueries, finite set operations, finite window functions, finite outer joins, finite FULL OUTER JOIN behavior, finite JOIN USING output layout, finite NATURAL JOIN common-column discovery, finite LEFT JOIN filter placement, finite missing-match LEFT JOIN filters, finite CROSS JOIN products, finite self joins, finite semi joins, finite common table expressions, finite inner joins, finite join multiplication, finite WHERE filters, finite WHERE-vs-HAVING boundary checks, finite SELECT lists, finite CASE expressions, finite COALESCE expressions, finite LIKE pattern filters, finite IN-list filters, finite NOT IN NULL behavior, finite Boolean filters, finite DISTINCT pipelines, finite comparison predicates, finite BETWEEN ranges, finite NULL tests, finite HAVING filters, finite aggregate NULL behavior, finite multi-column grouping, finite multi-column sorting, finite UNIQUE constraint checks, finite DEFAULT-value insert checks, and finite foreign-key delete actions.

Operations Research / Optimization

Operations research from its exact optimum outward — starting with linear programming as geometry, where a two-variable LP's optimum sits at a rational vertex of the feasible polytope, proven by the constraints themselves rather than read off a solver's float, with every value pinned and every diagram validated.

Networks & Encryption

Deployed network protocols and applied crypto from their exact byte/bit core — real headers, addresses as arithmetic, checksums and crypto over small integers/finite fields, rendered byte-exact and recomputed at the trust boundary.

Machine Learning

Machine learning from its exact arithmetic core: small rational data, validated deterministic diagrams, and clear boundaries around what is computed versus what is not claimed.