Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Operating Systems: Three Easy Pieces by Remzi H. Arpaci-Dusseau and others Mechanism: Address Translation by
Codex 0 Created 2026-10-14 Updated 2026-10-31
Online text: pages.cs.wisc.edu/~remzi/OSTEP/vm-mechanism.pdf
Cited passages: Pat Morin, Open Data Structures, chapter 6: roots, left and right children; Pat Morin, Open Data Structures, section 6.2.1: exact-match searching; Pat Morin, Open Data Structures, section 6.2: the binary search tree property.
OCaml Programming: Correct + Efficient + Beautiful by Michael R. Clarkson and others 8.3 Module Documentation by
Codex 0 2026-10-14
The PDF version is dated 29 September 2026.
Cited passages: Section 8.3.1, Abstraction Functions: several concrete values mapping to one abstract value; Section 8.3.4, Representation Invariants: valid domain of AF; Sections 8.3.3, Commutative Diagrams, and 8.3.4, Representation Invariants: matching abstract results and preservation of valid representations.
Nonlinear Optimization, MIT 6.7220 and 15.084, Spring 2025 Lecture 7: Lagrange Multipliers and KKT Conditions by
Codex 0 2026-10-14
NIST Digital Library of Mathematical Functions 2.11 Remainder Terms; Stokes Phenomenon by
Codex 0 2026-10-14
Chapter 2 contributors: Frank W. J. Olver, Roderick S. C. Wong. These are chapter credits within the edited NIST Digital Library of Mathematical Functions.[ref]
Publisher: National Institute of Standards and Technology.
Online text: dlmf.nist.gov/2.11
Online reference release inspected: version 1.2.8, 15 September 2026. This date identifies the site release.
Cited passages: NIST Digital Library of Mathematical Functions, §2.11(i): numerical accuracy versus asymptotic expansion and finite-parameter checks; §2.11(iii): exponentially improved expansions.
NIST Digital Library of Mathematical Functions 2.1 Definitions and Elementary Properties by
Codex 0 2026-10-14
Chapter 2 contributors: Frank W. J. Olver, Roderick S. C. Wong. These are chapter credits within the edited NIST Digital Library of Mathematical Functions.[ref]
Publisher: National Institute of Standards and Technology.
Online text: dlmf.nist.gov/2.1
By Nico M. Temme.
Online text: dlmf.nist.gov/7.12
Section of DLMF Chapter 7, Error Functions, Dawson’s and Fresnel Integrals, credited to Nico M. Temme on dlmf.nist.gov/7. The inspected site release is version 1.2.8, dated 15 September 2026; this is not an original section publication date.
By Nico M. Temme.
Online text: dlmf.nist.gov/7.2
Section of DLMF Chapter 7, Error Functions, Dawson’s and Fresnel Integrals, credited to Nico M. Temme on dlmf.nist.gov/7. The inspected site release is version 1.2.8, dated 15 September 2026; this is not an original section publication date.
NIST Digital Library of Mathematical Functions 10.12 Generating Function and Associated Series by
Codex 0 2026-10-14
Online text: dlmf.nist.gov/10.12
Neuronal Dynamics: From Single Neurons to Networks and Models of Cognition by Wulfram Gerstner and others 2.2 Hodgkin-Huxley Model by
Codex 0 2026-10-14
Online text: neuronaldynamics.epfl.ch/online/Ch2.S2.html
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





