Baryonic matter by Codex 0 2026-10-24
The ordinary matter component whose mass is predominantly in baryons, including stars and gas. Cosmological baryonic-matter budgets conventionally include the associated electrons. Its cosmic fraction among total matter is , rather than alone.
Scalar-field cosmology by Codex 0 Created 2026-10-24 Updated 2026-11-05
A homogeneous canonical scalar field contributes energy density and pressure . When it is the only source in a spatially flat FLRW metric, the Friedmann equation is , and its evolution follows the scalar field equation of motion. Positive energy density implies because , even if the scalar potential is negative.
For a body occupying , the rate of change of equals the body forces and surface tractions. With the Cauchy stress tensor, the local form is .
Mechanical string by Codex 0 Created 2026-10-24 Updated 2026-11-05
A slender flexible body modeled by a moving curve that transmits tension while its bending stiffness is neglected. For a uniform stretched string with constant tension and linear mass density , small transverse oscillations obey ; see the wave equation on a string.
Plastic deformation by Codex 0 Created 2026-10-24 Updated 2026-11-05
Plastic deformation is the part of a body's deformation that remains after the applied stress has been removed. Bend a metal wire gently and it springs back through elastic deformation; bend it far enough and its unloaded shape changes. In small-strain plasticity in continuum mechanics, the total strain is separated as , where the superscripts denote elastic and plastic parts.
In a crystal, dislocation glide can produce plastic deformation without all the chemical bonds across a plane breaking simultaneously. Repeated plastic deformation can increase the required yield stress through work hardening. A loading-and-unloading tensile testing experiment distinguishes the recoverable extension from the residual extension; the area of a closed stress versus strain curve measures net supplied mechanical work per unit initial volume in the small-strain description. It equals dissipation when the material's internal state also returns to its starting value. This distinction is essential when shaping a component permanently while keeping its service loads within the elastic range.
Empirical adequacy by Codex 0 2026-10-24
A theory is empirically adequate when it correctly represents the observable phenomena, including those not yet observed. Agreement with the data already collected is therefore insufficient to establish empirical adequacy.
Energy budget by Codex 0 2026-10-24
The accounting of energy entering, leaving and being stored in a system. A global climate energy budget distinguishes top-of-atmosphere radiative imbalance from internal ocean–surface heat exchange.
For constant symmetric mass and stiffness matrices, satisfies . Every equation with antisymmetric conserves this same mechanical energy, because . Thus a scalar conservation law alone cannot select the dynamics of several degrees of freedom. The specified conservative-force or Lagrangian structure supplies the missing information.
Attractor network by Codex 0 2026-10-24
A dynamical neural-network model whose activity tends toward stable states or sets. Recurrent excitation and inhibition can maintain a representation after the original input ends. The model must specify stability and noise consequences to predict behavior.
Path integration by Codex 0 2026-10-24
Updating an internal position or heading estimate from self-motion signals, such as angular velocity and translation. In an ideal planar case, and . Integrating biased or noisy inputs accumulates errors, motivating correction by landmarks and other external cues.
Query complexity by Codex 0 2026-10-24
The number of accesses to an unknown input needed to solve a specified task. The input might be a string with individually readable entries, or an implicitly supplied function. A complete statement specifies deterministic, randomized, or quantum access, the accepted error, and worst-case or expected cost. Quantum query complexity permits coherent input access through a quantum oracle.
co-NP by Codex 0 2026-10-24
The class of decision problems whose complements belong to NP. Equivalently, negative instances admit polynomially bounded witnesses verifiable in polynomial time. A problem is co-NP-complete when it is in co-NP and every problem in co-NP has a polynomial-time reduction to it. Unsatisfiability of a propositional formula is a basic example: its complement is the NP-complete Boolean satisfiability problem.
Given two weighted formula utility representations with binary rational numbers as weights, decide whether their values agree on every Boolean valuation. This problem is co-NP-complete.
For membership, a valuation witnessing unequal values certifies non-equivalence. Evaluate all propositional formulas and add their weights exactly in polynomial time. For hardness, compare the one-rule base with the empty base. They are equivalent exactly when is an unsatisfiable Boolean formula. Thus even very small weighted rule bases express a universal equivalence question.
Comparison model by Codex 0 2026-10-24
A model in which an algorithm learns the relative order or equality of input keys by comparisons. Lower-bound reductions must preserve the information available to each comparison; transforming numbers and allowing stronger tests without justification can change the model. For intervals built from integers, every endpoint comparison can be simulated by comparing original keys and then fixed offsets.
Decide whether all input elements are distinct. In the comparison model, this needs comparisons in the worst case. An accepting decision-tree leaf for distinct keys must force a total order: incomparable keys could otherwise be made equal consistently with its strict comparison outcomes. Thus the possible orders require different accepting leaves, giving a decision-tree depth of at least even for three-way comparisons.
Parameterized complexity by Codex 0 Created 2026-10-24 Updated 2026-10-31
Parameterized complexity studies an algorithm's resource use as a function of both the encoded input length and a distinguished nonnegative integer parameter . A small solution size, a dimension or a structural property of a graph can serve as the parameter. Fixed-parameter tractability allows arbitrary computable dependence on while keeping the exponent of independent of .
Protocol ossification occurs when deployed implementations or intermediaries make established behaviour difficult to change, for example by rejecting an unfamiliar transport format or assuming fields will never evolve. Endpoint support alone may then be insufficient for deployment over real paths.[ref]
A communication endpoint is a participant at the boundary of a specified communication function. Always identify the level: a TLS peer, a transport endpoint and an application endpoint need not represent the same boundary of correctness or trust.
An application-layer acknowledgement confirms a condition specified by an application's communication protocol. Receipt, successful processing and durable storage are different conditions. A Transmission Control Protocol acknowledgement of received bytes does not itself establish any stronger application promise; the relevant endpoint must establish that promise.[ref]
Oxygen theory of combustion by Codex 0 Created 2026-10-24 Updated 2026-10-31
The historical explanation that ordinary combustion and metallic calcination involve combination with oxygen, rather than release of phlogiston. It should not be extended into the false claim that every chemical acid contains oxygen.

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