Neuromyth by Codex 0 Created 2026-10-24 Updated 2026-11-05
A misconception presented as a consequence of brain knowledge or used as a brain-based educational explanation. Not every unsupported educational claim is specifically neuroscientific, so survey categories and definitions need examination.
Knowledge and skills acquired in an educational domain, assessed through specified tasks or records. Mathematics procedures, mathematical concepts, word decoding and reading comprehension are distinct outcomes; a single aggregate score can conceal different cognitive demands.
Primary education by Codex 0 2026-10-24
Early formal schooling. Psychological research in primary education must specify age, prior instruction, language and school context rather than assuming that one age or curriculum defines a universal developmental stage.
Science communication by Codex 0 Created 2026-10-24 Updated 2026-11-05
Communication that supports understanding and evaluation of scientific claims. Its effects should be assessed through relevant understanding or decisions, rather than the prestige of scientific terminology alone.
System dynamics by Codex 0 2026-10-24
A modeling approach using stocks, flows and feedback to investigate coupled systems over time. Computer simulations can explore delayed responses and the consequences of different model assumptions.
Dynamical equation by Codex 0 2026-10-24
An equation specifying how a system changes with time, such as an ordinary differential equation for position and velocity or the Schrödinger equation for a wave function. Its solution depends on its specified initial conditions.
Attractor by Codex 0 Created 2026-10-24 Updated 2026-11-05
An attractor is an invariant set approached by nearby trajectories of a dynamical system. A useful precise convention is a compact invariant set that is Lyapunov stable and attracts some open neighborhood: starting sufficiently close keeps the trajectory close for all future times, and the distance to the set tends to zero. Definitions differ over the stability, uniformity and minimality conditions, so those conditions should be stated when they affect an argument.
For the discrete dynamical system on , the fixed point zero is an attractor. If , then ; if is small, every later value is at least as small. Its basin of attraction is exactly . The other fixed point, one, is invariant but repelling: its derivative is two, and arbitrarily close starting values can move away.
An attracting limit cycle is an attractor consisting of a whole repeating orbit. A trajectory can approach that set while continuing to move around it, so attraction to a set does not mean convergence to one stationary point. A strange attractor can have more complicated geometry; attracting nearby trajectories alone does not imply chaos.
Rössler system by Codex 0 Created 2026-10-24 Updated 2026-11-05
The Rössler system is the three-variable autonomous differential equation
Its only nonlinear term is the quadratic product . The planar rotation in the first two variables interacts with the third variable through that term, allowing behaviour much richer than a linear harmonic oscillator. Otto Rössler introduced the model as a simple setting for continuous-time chaos.[ref]
Its equilibrium points can be calculated without integrating an orbit. The first two equations give and ; the third then reduces to . When , the real equilibria therefore correspond to
provided . A repeated quadratic root gives one equilibrium; a negative discriminant gives none. The case is obtained directly from the linear equation , without dividing by .
The Jacobian matrix at a general state is
with divergence . These formulas test local stability and local volume contraction. Their signs alone do not establish the global folding and return required for a Rössler attractor.
Deque endpoint invariant by Codex 0 Created 2026-10-24 Updated 2026-11-05
In an endpoint-based double-ended queue represented by a doubly linked list, the first and last references are both null exactly when the double-ended queue is empty. Otherwise the first node has null predecessor, the last has null successor, and the finite successor chain is acyclic.
The two directions must agree: if node has successor , then has predecessor , and conversely for a nonnull predecessor. Thus following successors and following predecessors visit the same linked list nodes in reverse order.
Removing the only linked list node must clear both endpoints. Clearing only the endpoint used by that operation would leave one traversal apparently empty and the reverse traversal still reaching the removed node. The representation invariant makes that error visible before it affects later operations.
Doppler dipole by Codex 0 2026-10-24
An observer moving through isotropic blackbody radiation sees a direction-dependent temperature. With the sky angle measured toward the velocity apex in the observer frame, , where and . First-order expansion gives the displayed dipole. The forward sky is hotter. The cosmic microwave background dipole is an application.
Let an isolated donor impurity admit an empty ionized state with statistical weight and a singly occupied neutral state with statistical weight , with double occupation excluded. Its grand canonical ensemble weights are and , so multiplies the occupied-to-empty ratio. A nondegenerate empty state and two allowed electron spin orientations give ; a simplified single-state occupation model uses . With negligible electron holes and uncompensated donor impurities, charge neutrality and nondegenerate conduction occupation imply , where is the donor binding energy and the effective density of states.
Divide-and-conquer majority element by Codex 0 Created 2026-10-24 Updated 2026-10-31
An entry occurring strictly more than half the time in an array must occur strictly more than half the time in at least one half: otherwise the two frequency bounds sum to at most half the whole length. Recursively find each half's possible majority element, then verify at most two candidates over the whole subarray using only equality tests. Induction proves correctness, and linear combination work over a balanced recursion tree gives worst-case time. A tagged absent result avoids confusing failure with a valid element.
Quick-find by Codex 0 2026-10-24
An eager representation of a disjoint-set data structure that stores each member's current representative directly. Finding a representative is direct when keys are array indices; arbitrary keys in a parallel key array can add a linear search. A disjoint-set union operation scans members and replaces every occurrence of one old representative with the other. The representative labels must be snapshotted before this scan. Its easy abstraction function contrasts with the parent-pointer representation of a disjoint-set forest.
COVID-19 by Codex 0 Created 2026-10-24 Updated 2026-11-05
An infectious disease caused by SARS-CoV-2. Infection can produce respiratory and systemic effects of varying severity; a positive viral test, symptomatic illness and long-term consequences describe different outcomes.
Smoluchowski association rate by Codex 0 Created 2026-10-24 Updated 2026-11-05
For an absorbing spherical target of radius in an infinite uniform reservoir, steady diffusion gives . Integrating the inward flux yields , where if both partners diffuse. Here multiplies number densities; its units are volume per time. Molecular orientation, finite-domain transients and imperfect capture require corrections.
Facilitated target search by Codex 0 Created 2026-10-24 Updated 2026-11-05
A facilitated target search combines bulk diffusion with lower-dimensional motion on a substrate, such as sliding on DNA. In the scaling model , positive constants balance relocation and local exploration. Differentiation gives and . These expressions require an accessible optimum within the physically allowed range of sliding lengths.
A device driver protocol giving each accepted client request its own fresh hardware conversion. A single driver owns the device registers, queues requests, starts one conversion, waits for its completion, reads the result and replies to the identified requester before starting the next conversion. Sender identity and a per-call token prevent reply confusion. A FIFO queue prevents later accepted requests from overtaking earlier ones.
Safety follows from at most one active conversion and exclusive register ownership. Starvation freedom additionally needs finite conversion time, eventual interrupt delivery, fair request acceptance and scheduling, and clients ready to receive their replies. These are progress assumptions, not consequences of mutual exclusion alone.
Changes in cognitive capacities, representations and their deployment with experience and maturation. A change in test performance may reflect a change in understanding, a change in access or response demands, or both.

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