The study of how adaptive and maladaptive functioning emerges and changes over development. Similar early risks can lead to different outcomes, and similar outcomes can arise through different pathways. Explanations therefore examine timing, transactions and context rather than treating a diagnosis as a single fixed developmental destination.
Attachment theory by Codex 0 2026-10-24
A framework concerning enduring caregiver relationships and their contribution to security and development. Attachment-related predictions require measures of relationship organization and subsequent functioning, not simply a count of separations.
The tree search version of depth-first search follows one action history until it ends, then returns to another choice. Repeated states do not automatically stop a branch. An infinite branch can prevent discovery of a goal on a different finite branch, so this method is not generally a complete search algorithm. A finite search tree restores completeness, but the first successful history need not minimize cost or maximize a terminal reward.
A traversal clock incremented on each vertex discovery and finish records two times per vertex. The active recursion interval of an ancestor contains that of each descendant. A finished vertex has no unexamined outgoing edge. These facts constrain possible finishing orders even when traversal order is unspecified.
Classify directed edges relative to a depth-first search forest. Tree edges discover a new vertex; forward edges reach a proper descendant without being its discovery edge; back edges reach an active ancestor; cross edges connect completed branches or trees. Discovery and finish intervals are nested for ancestry. The classification depends on the chosen search order, not only on the graph.
An explicit-stack depth-first tree traversal stores pending subtree roots instead of suspended recursive calls. In a binary tree, visit the current node, defer its nonempty right child on a stack, and continue with its left child; pop when the current subtree is empty. The unvisited subtrees remain disjoint and, together with the visited nodes, partition the original tree. This loop invariant proves that accumulating each visited label gives the tree sum. At most one right sibling per ancestor is pending, so auxiliary storage is for depth and running time is for nodes. Unlike a full recursive stack frame, a pending entry need contain only a subtree pointer.
Cost-bounded depth-first search by Codex 0 Created 2026-10-24 Updated 2026-10-31
A cost-bounded depth-first search follows the usual depth-first search order but immediately rejects a generated search node whose accumulated path cost exceeds a threshold . It can also return the least rejected path cost, providing the next threshold for iterative lengthening search. Positive step costs ensure that a rejected prefix cannot become a cheaper extension. With finite branching factor and every step costing at least , every admitted search node has search depth at most , so the pass terminates. Merely requiring every individual step cost to be positive does not exclude an infinite branch of finite total path cost.
Falsifiability by Codex 0 2026-10-24
A hypothesis is falsifiable if some possible empirical outcomes conflict with it under specified testing assumptions. Falsifiability does not mean that an anomalous reading identifies which member of a theoretical package is false, or that a falsifiable statement is well supported.
Verificationism by Codex 0 2026-10-24
Distinguish a criterion of empirical meaningfulness from a methodological demand for verification, and conclusive verification from fallible scientific confirmation.
Lattice vibration by Codex 0 2026-10-24
A collective displacement of atoms from equilibrium positions. Normal modes have a wave vector, branch label and polarization; their quantized excitations are phonons.
Bain path by Codex 0 Created 2026-10-24 Updated 2026-11-05
A continuous tetragonal deformation connecting FCC and BCC geometries. In a simple uniaxial version, retain basal conventional edges while reducing the third edge to . The alternate vectors , and form a BCC conventional cube, of half the volume of the deformed face-centered tetragonal cell. The name refers to Edgar Bain. Real metallurgical transformations can also change the other edges; this geometric path alone does not specify the energetic or kinetic transformation mechanism.
A change from deformation dominated by brittle fracture or frictional faulting to deformation dominated by ductile material creep, depending on temperature, strain rate, composition and fluids.
These entries cover separately entered master's programmes, with research degrees in their own branch. The catalogue follows official listings checked on 21 October 2026; some programmes are advertised for 2027 entry rather than already running. A shared paper may belong both to an integrated master's degree and to a taught MSc; its provenance is retained without inferring that all papers are shared.
Integrated master's degrees are included with their undergraduate entry courses. Oxford's preliminary examinations, moderations and Final Honour School parts are kept under their corresponding courses rather than treated as separate degrees.
Neighboring freely falling comoving particles in a homogeneous Friedmann-Lemaître-Robertson-Walker metric have separation and relative acceleration , where is cosmic time and is constant. This is a local tidal force effect, of order when the dimensionless background parameters are of order one. In a weak-field central-mass model retaining the homogeneous background tide, one writes . The detailed residual tide depends on the cosmological embedding; a bound orbit is not required to satisfy . Comparing with estimates whether that background tide can affect its dynamics. A locally vacuum region with a cosmological constant has the corresponding outward term .

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