Skip to content

Computer Science & Software Engineering

← Back to Prime Abstractions by Origin Domain

110 primes originate from Computer Science & Software Engineering and 181 more draw from it as a secondary origin — sort the Origin column to separate them. They span 153 subdomains; sort by that column to group them, or click any subdomain to filter to it.

PrimeOriginSubdomainDescription
Abstract Data TypePrimarySpecify a component by its externally observable behaviour while suppressing its implementation, so any conforming implementation is interchangeable behind the contract.
Abstract StructureAlso draws fromAn abstract structure is a system of typed elements, relations, operations, and constraints considered independently of any particular material carrier or notation, with identity determined by structure-preserving correspondence.
AbstractionAlso draws from—Focus on core elements.
Access ControlPrimary—Restrict system access.
Adversarial Signal ImitationAlso draws fromAdversarial signal imitation copies the observable cues that normally distinguish a trusted hidden type while avoiding the cost or constraint that made those cues informative.
AggregationAlso draws fromDeliberately collapsing many items into a single summary, choosing which information to discard to gain tractability.
AlgorithmPrimary—Step-by-step problem-solving procedure.
AllocationAlso draws from—Assign a limited supply across competing claimants under a feasibility constraint, independent of which criterion fills in the rule.
Arbitrariness of Symbolic ConventionsAlso draws from—Meaning via convention.
Assortative MixingAlso draws fromDetect and quantify whether network edges join nodes whose declared attributes are more similar—or more dissimilar—than an edge-end baseline predicts.
Asymmetric ScreeningPrimaryA cheap, deliberately one-sided-error filter gates an expensive authoritative check.
AttentionAlso draws from—The selective allocation of a fixed processing capacity to some inputs while the rest are filtered out, surfacing scarcity upstream of every decision.
Auction TheoryAlso draws from—Auction behavior analysis.
AuthenticationPrimaryBinding an asserted identity or origin to admissible evidence through a procedure that yields a verdict, before trust, access, or weight is granted.
AutomaticityAlso draws fromExecute a trigger-to-output pathway with little contemporaneous stepwise supervision, gaining speed and low control cost while sacrificing inspectability, interruptibility, and rapid adaptation.
BacktrackingPrimaryExtend a partial solution one step at a time and reverse the most recent commitment as soon as a constraint proves it cannot succeed, preserving earlier work.
Best PracticeAlso draws fromDesignate a method as the best current default only after evidence-bearing comparison in a stated context, and keep that designation transferable with conditions and revocable when evidence changes.
Black Box vs. White Box DistinctionAlso draws from—Visibility of internal structure.
BootstrappingPrimaryA system initialises and grows itself from a minimal seed using only its own products, recursively constructing each next stage without an external scaffold, until it reaches its target operating state.
BottleneckAlso draws fromThe single limiting stage that caps an entire system's throughput.
Branch and BoundAlso draws from—Systematic search with pruning.
BufferingAlso draws from—A maintained intermediate capacity that absorbs excess and releases it during shortfall, smoothing variation and decoupling a source from a consumer whose rates do not match.
Bulkhead PatternPrimaryPartition a shared critical resource into sibling compartments so one compartment's failure stays local instead of draining the whole.
CachingPrimary—Store for faster retrieval.
Calibrated Rule versus Moving WorldPrimaryA rule, model, or policy fitted to a past distribution of the world degrades as the world it was calibrated on drifts away from that distribution.
CalibrationAlso draws fromAligning a system's output to a trusted reference by measuring deviation, adjusting to reduce it, and monitoring for drift.
CallbackPrimaryA named action handed off in advance, to be invoked later by someone else when a specified condition arises, releasing the registrant from synchronous waiting.
Capability SeparationPrimaryIssuance is restricted to a privileged party while verification is open, tied by a forgery-prevention mechanism.
Capacity-Recovery IntervalAlso draws fromWhile a system remains able to act, suspend or sharply reduce its load for a bounded interval with entry, restorative-process, and exit conditions, trading current output for replenished capacity before continued operation crosses a negative-yield threshold.
Checks and BalancesAlso draws from—Distributed power.
ClassificationAlso draws from—Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.
Client Server ModelPrimaryAn asymmetric request-response relation in which one party holds a capability and many others initiate to consume it.
Co-PresenceAlso draws fromCo-presence exists when two or more agents are mutually available for reciprocal awareness and response within the same effective interactional here-and-now, whether that shared situation is physical or mediated.
Code-SwitchingAlso draws from—Alternate languages.
Commons GovernanceAlso draws fromA community co-stewards a shared resource through explicit rules for membership, contribution or use, monitoring, conflict resolution, sanctions, and nested authority, preventing distributed access from dissolving into neglect or depletion.
CompatibilityAlso draws from—The relational condition under which two or more entities can coexist or compose without breakage, interference, or contradiction.
CompetitionAlso draws fromRivalrous pursuit of a scarce prize where one party's gain is another's loss.
Competitive Niche DifferentiationAlso draws fromCompetitive niche differentiation occurs when rivals reduce direct overlap by specializing along different resource, function, or performance dimensions, trading general reach for coexistence in complementary niches.
CompletenessAlso draws from—No gaps in structure.
Complex Adaptive SystemAlso draws fromInteracting agents adapt their local rules to experience while their aggregate behavior creates an emergent environment that feeds back on what the agents learn, producing path-dependent organization without central control.
ComplexityAlso draws from—Measures system intricacy.
Complexity (Time/Space)Primary—Resource scaling with input size.
CompositionalityAlso draws from—Meaning from parts.
CompressionAlso draws from—Reduce redundancy.
ComputabilityPrimaryThe in-principle boundary between problems an effective procedure can solve and those none can.
ConcurrencyPrimary—Manage simultaneous processes.
Conditional EntropyAlso draws fromMeasure the expected uncertainty that remains about a target after a specified context is known.
Confirmation DialogPrimaryAn enforced pause and re-affirmation inserted before an irreversible action.
ConsensusPrimaryProducing a single shared decided state from many participants with disagreeing or adversarial views, under a fault model, satisfying agreement, validity, and termination together.
Consistency ModelPrimaryAn explicit contract over which observations of shared state are legal when updates are concurrent.
Context StrippingAlso draws fromContext stripping preserves a focal signal while removing meaning-bearing surrounding state, widening or redirecting the interpretations the unchanged signal can support.
Contextual Mode SwitchingAlso draws from—Adapt communication.
ContradictionAlso draws fromA collection of commitments is contradictory when it jointly entails both a proposition and its negation, so no admissible interpretation can make every commitment hold together.
Controlled ReentryAlso draws from—Re-establishing a suspended activity or state through staged, monitored steps with the capacity to abort, because returning to normal is a separate engineered process and not a simple reversal of the exit.
ConvergenceAlso draws from—Movement toward stable state.
Convergent EvolutionAlso draws fromSeparate lineages independently arrive at the same form or solution under similar pressures, with no shared inheritance and no interaction between them connecting the outcomes — the same answer found more than once.
CooperationAlso draws from—Agents bear individual costs to produce a shared benefit.
CoordinationAlso draws from—Aligning independently controlled actors so their separate actions combine into a coherent collective outcome despite distributed decision-making and incomplete shared information.
CorrelationAlso draws from—Systematic co-variation between variables, distinct from causation.
Counterfactual ReasoningAlso draws from—Hypothetical alternatives.
CouplingAlso draws from—Interdependence among subsystems.
CovarianceAlso draws fromCenter two varying quantities, multiply their paired deviations, and average: the signed result reveals whether departures co-move while retaining their joint scale rather than normalizing it away.
Coverage / ReachabilityPrimaryA completeness claim in the surjective direction: every required target in a target set is reachable from at least one of the system's inputs, pathways, or mechanisms.
Criteria of IndividuationAlso draws fromThe rules a system fixes for what makes something one entity — when parts compose a single whole, when two presentations are the same entity, and which kind supplies a thing's persistence — together constituting its inventory of countable individuals.
Data IntegrityPrimary—Accuracy and consistency preserved.
Data StructurePrimaryAn arrangement of information that makes some operations cheap at the structural cost of others.
Data-Control Plane BreachPrimaryUntrusted content crosses into the data channel un-inertised and an interpreter, operating correctly by its own rules, executes it as control, wielding the defender's authority for the attacker.
DeadlockPrimary—Mutual blocking processes.
Decidability ComputabilityPrimaryA class of yes/no questions admits a finite procedure that always terminates with the correct answer.
DecisionAlso draws from—Committing to one alternative from a set under uncertainty and trade-off, collapsing open deliberation into a chosen path and foreclosing the others.
DecompositionAlso draws from—Breaking a whole into parts that can be analyzed independently and recombined to reconstitute the whole, making complexity tractable through divide-and-conquer.
DeixisAlso draws from—Context-dependent meaning.
DenormalizationPrimaryDeliberately re-introduce controlled redundancy against a canonical form, trading a synchronization burden for access-side wins.
DependencyPrimary—Directed relation in which one element relies on another being present, prior, compatible, or supplied, with a specifiable failure mode if the condition is unmet.
Design PatternsAlso draws from—Reusable solutions.
Discrete vs. Continuous (Quantization)Also draws from—Step vs continuous evolution.
DiscretenessAlso draws from—Countable steps.
Diseconomies of ScaleAlso draws from—Rising per-unit cost once scale grows past a point.
DiversityAlso draws from—Maintaining functionally distinct types within a system so that variation provides resilience and coverage that uniformity cannot.
Dynamic ProgrammingAlso draws from—Solve via subproblem reuse.
Economies Of ScopeAlso draws from—Cost savings from producing varied outputs together.
EfficiencyAlso draws fromJudge an input–output arrangement against its feasible alternatives: it is efficient when no alternative preserves or improves the specified result while using fewer resources, and its inefficiency is the dominated slack removable without sacrifice.
Efficiency ReboundAlso draws fromAn efficiency gain lowers the effective cost per unit of an activity, inducing enough additional demand to offset part or all of the resource saving expected at fixed activity volume.
Epistemic Mode Of A PropositionAlso draws fromThe same proposition can be held in different epistemic modes — asserted-fact, assumption, axiom, hypothesis, premise, belief, conjecture — and the mode, independent of the content, gates which operations are licensed on it: you may provisionally rely on an assumption, must test a hypothesis, cannot refute an axiom within its system, must discharge a premise.
Equivalence-Preserving RewritingPrimaryTransforming an object into a behaviourally equivalent but operationally different form under an explicit equivalence relation, then selecting among rewrites by an orthogonal cost criterion.
EvaluationAlso draws fromApply a criterion-bearing frame to a bounded object, interpret its relevant features against that frame, and produce a verdict, score, rank, or action-guiding judgment.
Evaluative RatingPrimaryCompress an evaluative judgment into a position on a shared ordered scale that downstream actors can act on without re-examining the evidence.
Eventual ConsistencyPrimaryDistributed copies of shared state are allowed to diverge under local updates, with a deterministic merge guaranteeing they reconverge once updates stop.
ExchangeAlso draws from—Reciprocal transfer between parties under mutual commitment, with each side's movement keyed to the other's.
Expected ValueAlso draws fromAverage a random quantity against its probability measure: the resulting linear functional compresses a distribution to its first moment while discarding dispersion, tails, and other shape.
Experimental DesignAlso draws fromStructuring an investigation through deliberate intervention, controlled assignment, and measurement so that causation can be distinguished from mere correlation and confounding.
Explanatory Overlay Masking Structural DebtPrimaryAn artefact carrying avoidable structural confusion is patched with an informational overlay that makes it locally readable without retiring the underlying problem, and the overlay's local sufficiency quietly crowds out the structural fix that would actually resolve it.
Exposure-Distribution LearningAlso draws fromExposure-distribution learning updates an internal model toward the empirical frequencies an agent repeatedly encounters, so the model tracks the exposure distribution rather than the target environment whenever the two distributions differ.
Extreme Capture ProbabilityAlso draws fromWhen valuable targets are rare in a large heterogeneous population, a bounded untargeted sample captures them according to its coverage fraction — only n/N for the single best — so expanding reach or targeting matters more than prestige within the same bounded pool.
Fail-fast systemPrimary—Detect an invalid state at the earliest trustworthy boundary, report it explicitly and stop the affected operation before corruption propagates.
FairnessAlso draws from—Judging whether an allocation or procedure treats comparable parties impartially according to a defensible standard, given that multiple such standards can conflict.
FalsifiabilityAlso draws fromA claim is scientific only if it could in principle be empirically refuted.
Fault TolerancePrimary—Continue operating under failure.
Frame ProblemPrimaryAfter a change, the challenge of bounding which facts now need re-derivation and which persist by default, without re-checking everything.
Free RidingAlso draws from—The systematic under-provision that results when individuals can enjoy a non-excludable shared good without contributing proportionately to producing it.
Function (Mapping)Also draws from—Relates inputs to outputs.
Future Or PromisePrimaryA first-class placeholder for a value committed to be supplied later.
FuzzingPrimaryGenerating inputs from a wider-than-designed distribution to surface latent failures.
Fuzzy SetAlso draws from—A fuzzy set makes belonging graded by assigning every candidate element a membership degree between zero and one, while retaining crisp sets as the endpoint-valued special case.
Game-Theoretic StrategyAlso draws from—Strategic interaction analysis.
Garbage CollectionPrimaryReclaiming resources that nothing reachable from a declared root can still use.
GovernanceAlso draws from—The durable architecture of authority, accountability, and decision rights through which a group makes binding collective choices and resolves disputes internally.
Greedy AlgorithmPrimaryCommitting irrevocably to the locally best choice at each step, with no lookahead.
HabituationAlso draws fromRepeated exposure to a stimulus that proves inconsequential progressively reduces the response to it, with stimulus specificity, recovery after a pause, and restoration by a novel stimulus distinguishing habituation from fatigue or sensory failure.
HashingPrimaryDeterministically reducing any object to a short fixed-size token used as its handle.
HeuristicAlso draws from—Mental shortcuts.
Hidden Information ReconstructionPrimaryAn observer combines a system's disclosed outputs with a prior over possible inputs to reconstruct a protected input to whatever resolution the prior permits, so privacy is a property of the (system, adversary-prior) pair rather than of the disclosure surface alone.
Hierarchical DecomposabilityAlso draws from—Nested decomposition where within-level coupling dominates over cross-level coupling, making complex systems tractably analyzable one scope at a time.
Higher Order FunctionPrimaryTreating a rule itself as a first-class object that other rules consume or produce.
IdempotenceAlso draws from—Repetition yields same result.
IdentifierPrimaryAn identifier is a sign or finite symbol sequence used within a declared scope and scheme to distinguish one entity, class, or record from alternatives so references to it can be resolved consistently.
ImmutabilityPrimary—State that cannot be modified after creation.
ImpartialityAlso draws fromTreatment that depends only on relevant features and is invariant under the identity of the party involved.
Incentive CompatibilityAlso draws from—Align incentives.
Increasing ReturnsAlso draws fromMarginal benefit of each additional unit rises rather than falls as the cumulative state grows, compounding advantage.
IndexPrimaryAn auxiliary key-to-location table that makes lookup fast at the cost of maintenance.
IndirectionPrimary—Introduces intermediary references.
Information AsymmetryAlso draws from—Parties to an interaction hold unequal private knowledge.
Information CascadeAlso draws from—The sequential dynamic in which actors copy earlier actors' visible choices and suppress their own private signals, driving collective convergence that can be confidently wrong.
Information HidingPrimaryDeliberately concealing internal facts behind a stable public surface to control dependencies.
Information LocalityPrimaryResponsibility for a decision, guarantee, or interpretation belongs at a level that possesses the information required to discharge it; less-informed levels may assist but cannot make the result correct.
InheritancePrimaryTransmitting structure along a lineage by default, with selective override.
Inherited-Substrate RiskPrimaryA system built on a borrowed or inherited substrate carries forward latent conditions of the substrate's origin through an inheritance channel that the new system's audit boundary does not cross, so the risk concentrates exactly where attention does not.
Input PartitionAlso draws fromOne incident quantity is split among mutually exclusive output channels whose amounts or fractions exhaust the input, so changing one share necessarily changes at least one other under a closure constraint.
Integer Linear Programming (ILP)Also draws from—Discrete optimization with integer variables.
InterfaceAlso draws from—A bounded, rule-governed surface across which two systems exchange information or control while hiding their internals, letting each evolve independently behind a stable contract.
Interface MismatchAlso draws fromTwo systems that are locally workable fail to compose because what one exposes at their required exchange boundary does not satisfy what the other can accept, including the limiting case where the needed handoff surface is absent.
Interference and ContentionPrimary—Competing demands for shared bottleneck degrade throughput.
InterleavingAlso draws from—Mixing topics during practice to improve discrimination and retention.
InteroperabilityPrimary—Systems function together.
InterpretationAlso draws from—Recover meaning from a representational substrate under a framework that makes some readings available and others not.
InvarianceAlso draws from—Properties unchanged under transformation.
IterationPrimary—Repeats steps to refine outcomes.
LatencyPrimary—The irreducible delay between an input and the system's response.
Layered AccumulationAlso draws from—Sequential time-ordered deposition in which each new layer rests atop the prior ones, so the position of a layer encodes when it formed and the stack becomes a readable record of history.
LayeringPrimary—Segments systems into levels.
Lazy EvaluationPrimaryDefer work until its result is actually demanded.
Learning-Substrate ContaminationPrimaryAn adversary writes future behavior indirectly by selectively contaminating the experience or evidence from which an agent durably updates, so the agent later and faithfully enacts a distortion installed before the decision.
LegibilityAlso draws fromA distant actor makes heterogeneous local reality governable by projecting it into standardized, simplified representations, gaining comparison and control while discarding context the scheme cannot see.
License as CoordinationAlso draws fromA standing license replaces repeated bilateral permission bargaining with published terms covering a class of actors and uses, so each participant can coordinate by checking the rule rather than renegotiating access.
LivelockPrimaryCoupled agents stay active and responsive yet make no progress, their every move triggering a compensating move that locks the joint state in a futile cycle.
Load BalancingPrimary—Distributing work across resources so none is overloaded.
Locality Of ReferencePrimary—Accesses cluster in time and space, making prediction and caching effective.
LoggingPrimaryRecord events as they occur, append-only, for inspection after the fact.
MaintenanceAlso draws from—Sustained preventive work that keeps a system's intended function intact against inevitable degradation, acting ahead of failure rather than repairing after it.
MarkednessAlso draws from—Default vs marked forms.
Markov Decision Processes (MDPs)Also draws from—Sequential decision-making under uncertainty.
Mechanism DesignAlso draws from—Rule engineering.
Message PassingPrimaryAutonomous holders of private state interact only through discrete addressed messages over intermediating channels.
Meta-Symbolic ReflectionAlso draws from—Reflect on own rules.
MixingAlso draws fromRedistribute distinguishable constituents among local regions so composition becomes less dependent on original position, while preserving the total amount being rearranged.
Model Assumption FailureAlso draws fromA conclusion, forecast, or plan loses warrant when a load-bearing condition its model treated as true is false or ceases to hold, even if the reasoning inside the model remains correct.
ModularityPrimary—Breaks systems into smaller units.
MonitoringAlso draws from—Continuously observing a system's state to detect deviation from expected behavior and trigger a response, separating genuine signal from routine noise.
Mutual ExclusionPrimaryGuarantee that at most one party occupies a designated state or resource at a time.
Natural SelectionAlso draws fromA population of varying, heritable variants is filtered by a selection pressure so that the better-performing variants differentially reproduce or persist, shifting the population's composition over rounds — variation, selection, and retention as a substrate-neutral engine.
Necessity and SufficiencyAlso draws fromSeparates what an outcome requires from what guarantees it, and joins both directions only when each condition exactly characterizes the other.
Need–Solution AlignmentAlso draws fromA proposed intervention fits a need when its supplied capability satisfies that need's binding conditions better than the current alternative for a particular beneficiary and context.
NetworkAlso draws from—Models interactions between components.
Network EffectAlso draws from—Value increases with users.
Network Flow ModelsAlso draws from—Optimize flow across networks.
Network TraversalPrimaryStarting from one or more seeds, repeatedly follow eligible edges to visit or expose nodes, so reach and discovery order are determined by topology, frontier policy, and stopping rule.
Niche ConstructionAlso draws fromAn agent modifies its environment, and the modified environment changes the selection pressures acting back on the modifier — the environment is endogenous.
No Free Lunch TheoremAlso draws fromAveraged over all problem instances, no search, optimization, or learning procedure outperforms any other; a method's value is the match between its inductive bias and the problems it faces.
Non-LocalityAlso draws fromDistant elements influence or correlate with each other without a chain of contiguous intervening contact — coupling that jumps the substrate rather than propagating through neighbors.
Observable Surface Becomes ContractPrimaryEvery observable behaviour, exposed to enough observers over enough time, becomes a binding dependency regardless of the nominal contract.
Observational EquivalenceAlso draws fromDifferent internal systems are observationally equivalent when a declared observation regime cannot distinguish their outcomes.
OntologyAlso draws from—What exists and how entities relate.
Open-Closed PrinciplePrimaryHarden a stable kernel against modification and route all change through an open extension surface.
Open-Goal PersistenceAlso draws fromOnce an agent adopts a goal with a recognized completion criterion, keep its representation and return priority active across interruption until completion, abandonment, or a credible external surrogate supplies the release signal.
OperationalizationPrimaryA specification of what is wanted is mechanically lowered into an executable how, under a correctness contract relating the two.
OptionalityAlso draws from—The asymmetric value of having a choice—bounded downside, unbounded upside—without obligation to act.
Out Of Distribution DetectionPrimaryCouple a scope detector to a decision system so out-of-competence cases are deferred, not answered.
OverfittingAlso draws from—Poor generalization.
Overshoot and CollapseAlso draws fromAn enabling input that is beneficial at low levels crosses an assimilation ceiling and inverts into a self-amplifying degrading load, depleting a secondary resource and locking in a hysteretic worse regime that does not reverse when the input is removed.
Paradigmatic vs. Syntagmatic RelationsAlso draws from—Any structured system can be decomposed along two orthogonal axes, the vertical set of substitutable alternatives that could fill a slot and the horizontal chain in which selected items are combined.
ParsingPrimaryRecover hidden hierarchical structure from a flat sequence using a grammar.
Path DependenceAlso draws from—Outcomes are shaped by the specific historical sequence of past choices, which lock in consequences and foreclose alternatives that persist despite present incentives to change.
Pattern RecognitionAlso draws from—Identify regularities.
PermutationAlso draws fromReassign every member or position of a collection exactly once, preserving membership while changing arrangement; the resulting bijective self-maps compose, invert, and decompose into cycles.
PipelinePrimary—Sequential processing stages.
PlanAlso draws fromA plan is an externalized or internally maintained, revisable arrangement of intended actions, dependencies, timing, resources, and contingencies directed from a represented present state toward an objective.
Platform DesignAlso draws from—Extensible core systems.
Portable Context BundlePrimaryA behaviour-unit carries the context it was defined in, resolving against its definition-time environment rather than the ambient one at use.
Positional AdvantageAlso draws fromOccupying a location in a value-graded space such that the position itself confers advantage — leverage, reach, defensibility, reaction-time — independent of the resources or force held at that location.
Precedent (Stare Decisis)Also draws from—Past decisions guide future.
Precomputation and MaterializationPrimaryPerform expensive or combinatorial work before demand and store its result as a directly usable artifact, trading build and update cost plus possible staleness for cheap, predictable use-time access.
Prediction ErrorAlso draws fromThe signed discrepancy between a model-generated prediction and its realized observation becomes an operational signal for updating, routing through, or diagnosing the predictor.
Predictive CodingAlso draws fromA system predicts its input and propagates only the prediction error.
Premature OptimizationPrimaryCommitting local refinement effort before global structure is known pays both search-cost and rigidity-cost without the information to spend either well.
Presentational–Semantic MismatchAlso draws fromA presentation carries distinctions that the underlying machine-consumable representation does not encode, so a consumer restricted to the semantic model receives a silently impoverished or different structure even though the rendered artifact looks complete.
Principle of Least PrivilegePrimaryGranting each component only the minimum authority its function requires bounds the blast radius of its compromise or error.
PrioritizationAlso draws from—Ordering competing claims on finite resources by a value or urgency metric to produce a ranked sequence of action under constraint, making explicit what gets done first and what does not get done at all.
Problem SpaceAlso draws from—Range of possibilities.
PropagationAlso draws from—The systematic spreading of a signal, effect, or state from a source through a medium or network, where the medium's structure governs how fast it moves, how it attenuates, and which paths it follows.
ProvenanceAlso draws from—A documented, traceable record of an entity's origin and successive custody transfers that establishes authenticity and assigns accountability by linking present state back to first known state.
Provenance LaunderingAlso draws fromProvenance laundering routes an item through successive intermediaries so its disfavored or unverifiable origin becomes harder to recover while inherited channel authority is mistaken for independent authentication.
Proxy–Target FidelityAlso draws fromHow faithfully an observable proxy tracks the unobservable target it stands in for — the degree to which acting on, optimizing, or inferring from the proxy is acting on the target itself.
Publish SubscribePrimaryProducers emit to a topic and consumers subscribe to the topic, routed by an anonymous broker.
Quality ControlAlso draws from—Checking output against a specification before release and rejecting or reworking non-conforming items, binding process variation to defined tolerances through a measure-compare-act feedback gate.
QueueingAlso draws from—Organizes tasks into a waiting line based on arrival and service rates.
Race ConditionPrimaryThe outcome of a system depends on the uncontrolled relative timing of concurrent actions on shared state, so the order effects land — not the actions — determines the result.
Random WalkAlso draws from—A trajectory built as the running sum of independent random increments, whose displacement grows like the square root of the number of steps.
RandomnessAlso draws from—Model unpredictability.
Rate LimitingPrimaryCap the temporal rate at which an identifiable actor consumes a resource.
RecurrenceAlso draws from—The property by which a state, event, or value reappears across time or iterations because the present state depends on prior states, distinct from mere repetition by its measurable lag structure.
RecursionPrimary—Breaks processes into self-similar steps.
RefactoringPrimaryChange internal structure while preserving observable behavior.
RefinementAlso draws from—Iteratively improving a candidate solution toward adequacy through repeated cycles of evaluation and adjustment that narrow the gap to a target, rather than deriving the answer in one shot.
Regime Transition PlateauAlso draws from—Progress stalls when the strategy that produced the current gains exhausts its inputs before the qualitatively different capabilities required for the next regime have been built.
Registry-Mediated DiscoveryPrimaryAgents find each other through a shared registry rather than by direct reference: a named indirection mapping stable identifiers to current locations, so coupling survives turnover.
RelationAlso draws from—Describes associations or dependencies.
RepresentationAlso draws from—Model complex ideas.
Representational Structure MismatchAlso draws fromA representation preserves its target's elements but misstates one or more task-relevant relations among them, so content can appear complete while its shape licenses the wrong traversal, inference, or action.
ReputationAlso draws from—An aggregated signal of past behaviour that shapes how others treat an agent.
ReserveAlso draws fromDeliberately maintained surplus held beyond expected need so the system can absorb variation, uncertainty, or shock without failing.
Resource ManagementAlso draws from—Allocation of finite assets.
Reverse EngineeringAlso draws from—Analyze existing systems.
Reward Prediction ErrorAlso draws fromThe signed difference between received and expected reward or value becomes a teaching signal for updating value estimates, policies, and reward-linked behavior.
Role FluidityAlso draws fromRole fluidity allows the same occupant to move among positions that a rigid system assigns to separate actors, so producer/consumer, leader/follower, or requester/provider functions can alternate without changing occupant identity.
Rule of LawAlso draws fromNo element of a system is exempt from its governing rules, including the element that generates or enforces them.
Rule of Least Power (Minimum Sufficient Capability)PrimaryChoose the least expressive mechanism that still solves the problem, because unused capability is structural debt that weakens analyzability and safety.
SandboxingPrimaryExercise an untrusted candidate inside a bounded, observable enclosure.
ScalabilityPrimary—Handle growth.
SchedulingAlso draws from—Organizing tasks over time.
Schema-Bounded Blind SpotAlso draws fromA finite elicitation schema can be exhaustive only inside the categories it contains, so diligent use systematically misses cases outside its coverage boundary and can turn procedural rigor into false completeness.
Search and RetrievalPrimary—Locate and extract information.
SelectionAlso draws fromFrom an available population, a criterion, pressure, or rule gives some alternatives greater retention, passage, or weight than others, producing a survivor set or shifted composition.
Selective Information SeveranceAlso draws fromDeliberately cutting an information channel on a need-to-know basis, so a party cannot act on, be biased by, or leak information it never receives.
Self CheckingPrimaryA system detects errors in its own output by computing the answer through partially-independent paths and comparing.
Self ControlAlso draws from—Overriding immediate impulses in service of longer-term goals.
SemigroupAlso draws fromThe minimal algebraic species — a set with one closed, associative binary operation and nothing more — whose lone axiom certifies that any finite product is parenthesization-independent, so a sequential reduction can be split, reassociated, and run in parallel without changing the answer.
SequencingAlso draws from—Deliberately ordering steps under precedence constraints so that the arrangement itself, not just the set of tasks, determines the outcome.
SequestrationAlso draws from—Deliberately removes a resource, hazard, or information from active circulation and keeps it behind a maintained boundary for persistent isolation.
Serial Local Optimization FailureAlso draws fromStages arranged in series each optimize a local objective while treating their effects on other stages as outside that objective, so individually rational choices compound into an outcome worse than joint optimization.
SerializationPrimaryConvert structured content into a flat, transportable form that reconstructs.
Set and MembershipAlso draws from—Groups and categorizes elements.
ShardingPrimaryPartition a load across owners by a stable key-to-shard function.
Shared-Interface Constraint ConflictPrimaryShared-interface constraint conflict forces one undifferentiated output through a common interface to receivers whose binding acceptance rules cannot all be satisfied, so success for one receiver entails failure for another until the interface or receiver set is partitioned.
Side Channel AttackPrimaryA system's legitimate outputs reveal information its access policy meant to protect, via observable consequences the policy never enumerated.
Side EffectPrimaryAn action's change to shared state beyond its declared interface.
Silent Representation OverflowPrimaryA bounded field silently rolls past its capacity and a blind consumer trusts it.
Similarity MeasureAlso draws fromMap an ordered pair, under a declared representation and relevance rule, to a comparable degree of likeness; the score may be nonmetric or asymmetric, and changing the frame can reverse what counts as near.
Simulated AnnealingAlso draws from—Probabilistic search escaping local optima.
Single Point of FailurePrimaryA component on the critical path of every essential function, with no parallel route, that caps the whole system's reliability at its own.
Spatial IndexingPrimaryOrganizing items by position in a space so retrieval, neighborhood, and range queries become geometric and output-sensitive.
StackPrimaryA strictly nested discipline where what was opened last must close first.
StandardizationPrimaryThe act or process by which independent parties converge on a single shared specification, format, or interface — agreement on a common norm rather than the benefits that follow from it.
StarvationPrimaryA participant who is eligible and in the queue is perpetually denied service, not by exclusion but because a locally rational priority rule always picks someone else.
State and State TransitionPrimary—Captures system condition and evolution.
Statistical InferenceAlso draws fromReasoning from a finite, noisy sample back to the underlying population or process while explicitly quantifying the uncertainty that sampling introduces.
Stochastic ProcessAlso draws fromA quantity indexed (usually by time) whose evolution is governed by randomness — an indexed family of random variables sharing one probability law.
Stovepipe SystemPrimaryCapabilities built as parallel vertical stacks that each re-implement shared concerns, with no horizontal layer between them, are locally efficient but globally incoherent and pay a super-linear integration tax.
StratificationAlso draws from—Layered separation of a system.
Streetlight EffectAlso draws fromSearch effort concentrates where evidence is easiest to observe rather than where the sought answer is most likely to lie, systematically substituting accessibility for relevance.
SubadditivityAlso draws fromA combined whole never evaluates above the sum of its separately evaluated parts, so decomposition supplies a guaranteed upper bound.
Substrate-Induced Boundary DissolutionPrimarySubstrate-induced boundary dissolution occurs when a shared carrier makes formerly separate kinds mutually expressible, removing the operational basis of their partition and propagating reorganization into layers built on that partition.
SurjectivityAlso draws fromA coverage-guaranteeing mapping in which every element of the target is hit by some input, leaving no gap in the codomain.
Symbolic RepresentationAlso draws from—Sign-meaning link sustained by collective convention rather than resemblance or causal connection.
SynchronizationAlso draws from—The emergence of stable shared timing or phase among independent oscillating processes through local coupling, without any central conductor.
System ConfigurationAlso draws fromA declared assignment of components, connections, parameter values, and boundaries that fixes a system's actual or intended arrangement under stated conditions.
Technical DebtPrimaryA present expedient choice imposes a future cost that compounds with system growth until it is paid down, with a principal, an interest payment, and a pay-down.
Template InstantiationPrimaryReuse an invariant frame of typed slots by binding variable payloads into it, producing comparable instances while exposing slot-fit failures and frame drift.
Termination ConditionPrimaryAn explicit, checkable predicate that decides whether an iterative or recursive process stops or continues.
Thundering HerdPrimaryMany independent waiters are released by a single shared signal and collide at once on a finite resource, so the failure lives in the correlated timing of their release rather than in the population size or the resource capacity.
Time-Of-Check To Time-Of-Use FlawPrimaryA precondition verified at one instant authorizes an action taken at a later instant, and the relevant state changes in the gap between them, so the defect lives in the temporal binding between check and use rather than in either operation.
TraceabilityAlso draws fromThe infrastructure of bidirectional links that lets any element be followed backward to its origin and forward to its uses, turning opaque processes into auditable, queryable histories.
TransactionPrimary—All-or-nothing operations.
TransformationAlso draws from—A rule-governed mapping that restructures an input into a different output, holding certain invariants fixed while altering others.
Tree StructureAlso draws fromA tree structure organizes distinct nodes through acyclic parent–child relations so that one root reaches every other node and each non-root node has exactly one parent and one path from the root.
TruncationAlso draws from—Apply a declared boundary to retain an admissible bounded part of an ordered, extended, or over-complete object while discarding the part that lies beyond it.
TrustAlso draws from—Willingly accepting vulnerability to another party's future behavior under incomplete monitoring, based on positive expectations about their competence and intentions.
Trusted Intermediary CompromisePrimaryTrust transitivity is exploited to push a hostile payload past the consumer's perimeter.
Two-Sided MatchingAlso draws from—Forming stable pairings between two sides of a market under each side's preferences.
UnionAlso draws fromThe elements belonging to at least one of several collections — everything that is in any of them.
Untrusted Input ExecutionAlso draws fromAttacker-influenced input crosses a data-to-control (or authority) boundary and a correctly-operating intermediary executes it with the intermediary's own authority, so the attacker borrows the defender's privilege without ever violating the intermediary's rules.
Unverified PreconditionPrimaryAn action presumes a referent exists at the moment of use without checking.
ValidationAlso draws fromConfirming that an artifact actually solves the intended problem in its real operational context, as distinct from confirming it was merely built to specification.
Variation and SociolectAlso draws from—Group-based language variation.
Variation StrategiesAlso draws from—Deliberately injecting controlled variation into a system and selecting from the results to explore alternatives, accelerate learning, and gain robustness.
VerificationAlso draws from—Check that an object conforms to its specification via a defined procedure yielding evidence and a verdict.
VersioningPrimary—Tracks incremental changes over time.
VirtualizationPrimary—Abstracts physical resources.
Weak TiesAlso draws from—Distant acquaintances that bridge otherwise separate social clusters.
Winner Take All MarketAlso draws fromA payoff structure convex in rank concentrates most reward at the top, so small skill gaps produce vast reward gaps.
Zero Knowledge ProofPrimaryConvince a verifier a claim is true while revealing nothing beyond its truth.