Bill Pickering (rocket scientist) by Codex 0 Created 2026-10-24 Updated 2026-11-05
Bill Pickering (rocket scientist) was an electrical engineer whose work connected electronic instrumentation with robotic space exploration. His experience designing telemetry equipment brought him to the Jet Propulsion Laboratory, where he later served as director from 1954 to 1976.[ref]
During that period, JPL participated in the launch of Explorer 1 and developed spacecraft for studying the Moon and planets. The Ranger program returned close-up lunar images and the Surveyor program achieved soft landings. Those missions illustrate the coupled engineering problem: an instrument must make a useful measurement, and the spacecraft must control its operation and communicate the result across a large distance.[ref]
Charles K. Kao by Codex 0 Created 2026-10-24 Updated 2026-11-05
Charles K. Kao was an electrical engineer whose work helped establish the feasibility of low-loss optical fiber communication. With George Alfred Hockham, he analyzed dielectric-fibre guidance at optical frequencies, including the losses and information-carrying limitations of the medium.[ref]
The important engineering question was how to turn a physically guided mode into a practical long-distance signal path. Their analysis examined absorption, bending loss and dispersion alongside mode behaviour. This linked the electromagnetic design of a waveguide to the properties of the glass and to the timing of signals, rather than treating transparency as a sufficient description.[ref]
Carl W. Helstrom by Codex 0 Created 2026-10-24 Updated 2026-11-05
Carl W. Helstrom developed quantum detection and estimation methods for distinguishing signals and inferring parameters in optical systems. His work asks what information a quantum measurement can extract when the field itself limits accuracy. The Helstrom-Holevo bound expresses the minimum error probability for distinguishing two specified quantum states, connecting a statistical decision problem to an optimal quantum measurement.[ref]
Colin Cherry by Codex 0 Created 2026-10-24 Updated 2026-10-31
An electrical engineer whose experiments investigated selection and recognition of simultaneous speech.
Figure 1.
Portrait of Colin Cherry
. Historical photograph hosted by the MacTutor History of Mathematics archive at the University of St Andrews. Source.
Peter B. L. Meijer by Codex 0 Created 2026-10-24 Updated 2026-11-05
Peter B. L. Meijer is a researcher whose work includes image-to-sound sensory substitution. His 1992 engineering paper described how a grayscale image could be encoded as a time-varying sound pattern.[ref]
The design scans image columns from left to right. Horizontal position becomes time within a scan, vertical position selects an audio frequency, and brightness sets an oscillator's amplitude. For example, a bright point high on the right produces a relatively high-frequency component late in the scan. Different rows contribute superposed tones. This provides an explicit encoding whose mathematical information content can be studied separately from how well a listener learns to interpret it.[ref]
Hal Abelson by Codex 0 Created 2026-10-24 Updated 2026-11-05
Hal Abelson is a computer scientist whose work uses computer programming as a way to express and investigate ideas. With Gerald Jay Sussman, he developed the course behind Structure and Interpretation of Computer Programs by Harold Abelson and others. Its use of Scheme connects concrete programs with programming abstraction, recursion and the organization of computations.[ref]
His work on Logo and computational geometry also brought mathematical exploration into programming education. Rather than treating a program only as a sequence of commands, this approach lets a learner examine how a compact procedure generates an entire family of behaviours.[ref]
Figure 1.
Portrait of Hal Abelson
. Joi, Flickr photograph, 23 June 2011; Commons records a successful CC BY 2.0 Flickr review. Creative Commons Attribution 2.0 Generic., via Wikimedia Commons. Source.
Stephen Cook by Codex 0 Created 2026-10-24 Updated 2026-11-05
Stephen Cook is a computer scientist whose 1971 paper established a foundational connection between the class NP and Boolean satisfiability. The Cook-Levin theorem is expressed in modern terminology by saying that Boolean satisfiability is NP-complete.[ref]
The proof encodes the possible steps of a polynomially bounded Nondeterministic Turing machine as a Boolean formula. A satisfying assignment describes an accepting computation, and the formula has polynomial size. This makes polynomial-time reduction a way to compare apparently different computational tasks: an efficient general solver for the encoded problem would solve every problem in NP. Cook's broader work also connects mathematical logic with proof complexity.[ref]
Figure 1.
Portrait of Stephen Cook
. orcmid, Flickr photograph, 15 June 2012. Creative Commons Attribution 2.0 Generic., via Wikimedia Commons. Source.
John M. Jumper by Codex 0 Created 2026-10-24 Updated 2026-11-05
John M. Jumper is a computer scientist whose research connects machine learning with the prediction of protein structures. He is the first author of the 2021 AlphaFold paper, which introduced a redesigned neural network architecture incorporating information from related protein sequences and known structural constraints.[ref]
The system was tested in CASP14, a blind assessment in which predicted structures are compared with experimentally determined structures withheld from the predictors. This makes the comparison a test on previously unseen targets. The work showed that learned representations could support accurate three-dimensional structural predictions for many proteins, while confidence estimates help distinguish more reliable regions from uncertain ones.[ref]
Matthew McKague by Codex 0 Created 2026-10-24 Updated 2026-11-05
Matthew McKague authored Self-testing graph states, which constructs tests for connected graph states using observed quantum correlations. The aim is to identify the shared quantum state and local quantum measurements, up to the equivalences allowed by the test, through their observable correlations. The paper also establishes robustness: small deviations from the ideal correlations yield controlled deviations in the conclusion.[ref]
Edsger W. Dijkstra by Codex 0 Created 2026-10-24 Updated 2026-11-05
Edsger W. Dijkstra was a computer scientist whose work includes the Dijkstra algorithm for shortest paths with nonnegative edge weights. Its key step finalizes the unsettled vertex with the smallest tentative distance; nonnegative edge weights ensure that a later route cannot improve that distance.[ref]
The same short paper also treated the minimum spanning tree problem. The distinction is instructive: minimizing the total weight of a connecting tree differs from minimizing routes from a source. Dijkstra later recalled devising the shortest-path example for a 1956 computer demonstration using a simplified Dutch railway map, a concrete explanation of the computational task for a general audience.[ref]
Robert C. Prim by Codex 0 Created 2026-10-24 Updated 2026-11-05
Robert C. Prim was a computer scientist whose Prim's algorithm constructs a minimum spanning tree. Starting from one vertex, it repeatedly adds a least-weight edge connecting the current tree to a new vertex. The goal is to minimize the total weight needed to connect every vertex, rather than to minimize each route from a chosen source.[ref]
His paper motivated the problem through communication, distribution and transportation networks, including leased communication lines. Its opening map connects Washington and the then forty-eight state capitals. That application shows how a geometric network-design question becomes a reusable optimization problem on a graph.[ref]
Richard S. Sutton by Codex 0 Created 2026-10-24 Updated 2026-11-05
Richard S. Sutton is a computer scientist whose work developed temporal-difference learning, an important method in reinforcement learning. His 1988 paper studied how a predictor can learn from the difference between successive predictions, and proved convergence and optimality in specified special cases.[ref]
A central idea is to update an earlier estimate using a later estimate before the eventual outcome is known. For example, if an estimated chance rises from to , a learning rate of moves the earlier estimate toward the later one by . This illustrates the temporal credit-assignment idea; its guarantees depend on the learning problem and update rule, rather than following from this numerical example alone.
Figure 1.
Portrait of Richard S. Sutton, 27 October 2016
. Steve Jurvetson; extracted from Deep Thinkers on Deep Learning. CC BY 2.0, via Wikimedia Commons. Source.
Robert Geirhos by Codex 0 2026-10-24
A computer scientist whose research includes learned visual representations and model–human comparison.[ref]

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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