Computer Science & Software Engineering

← Back to Domain-Specific Abstractions by Origin Domain

1,414 domain-specific abstractions whose origin domain is Computer Science & Software Engineering. They span 1,007 subdomains — sort by that column to group them, or click any subdomain to filter to it.

Abstraction	Subdomain	Description
1% rule	Internet Community StudiesParticipation Inequality and User Generated Content	Use a 1–9–90 role split as a rough, community-specific heuristic for concentrated online participation, with a small creator group, a larger intermittent-contributor group, and a large consuming or inactive group.
2.5D	Computer GraphicsVideo Game Design	By contrast, games, spaces or perspectives that are simulated and rendered in 3D and used in 3D level design are said to be true 3D, and 2D rendered games made to appear as 2D without approximating a 3D image are said to be true 2D.
2–3 Heap	Heap Data Structures	In computer science, a 2–3 heap is a data structure that implements a priority queue.
3D projection	Computer Graphics	A mapping that represents three-dimensional geometry on a two-dimensional surface under explicit perspective, orthographic, oblique, or related projection rules.
3SUM	Fine Grained ComplexityComputational Complexity	The computational decision problem of determining whether a set or list of numbers contains three distinct input elements whose sum is zero, with complexity stated relative to the numeric domain and computation model.
4+1 architectural view model	Software ArchitectureArchitecture Description Frameworks	A software-architecture description framework organizing one system into logical, development, process and physical views tied together by representative scenarios.
A-star algorithm	Artificial IntelligenceHeuristic Search	A* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality, and optimal efficiency.
ABC Software Metric	Software Metrics	A software-size metric reported as the triplet of assignment, branch and condition counts for a code unit, with an optional Euclidean magnitude summary.
Abstract Factory Pattern	Object Oriented DesignCreational Patterns	A software design pattern in which a client uses one abstract factory interface to create several related product kinds from a selected concrete implementation family.
Abstract Machine	Models of Computation	Represent computation as formally specified states and transitions so programs, algorithms, and machines can be executed or analyzed independently of incidental hardware detail.
Abstract semantic graph	Compiler Intermediate Representations	A graph representation of a formal expression or program whose nodes denote terms or semantic entities and whose shared nodes can represent common subexpressions beyond an abstract syntax tree.
Abstract state machine	Formal Methods	A formal operational model in which each state is an arbitrary mathematical structure and guarded updates define discrete state transitions.
Abstract Syntax Tree	Programming Language Theory	Represent a program's grammatical structure as a recursive tree built from a parser, keeping the meaning-bearing constructs and discarding surface details — whitespace, comments, redundant brackets — so two sources that differ only in formatting yield the identical tree.
AC (complexity)	Computational Complexity	A circuit-complexity hierarchy of languages decidable by polynomial-size, polylogarithmic-depth Boolean circuits with unbounded-fan-in AND and OR gates.
AC0	Computational Complexity	The circuit-complexity class of Boolean functions computed by polynomial-size, constant-depth families with unbounded-fanin AND and OR gates and input-level negations.
Account sharing	Digital IdentityShared Account Authentication	Permit multiple people to authenticate as one nominal account by reusing its credentials or authenticators, collapsing individual identity, accountability, and revocation boundaries.
Ackermann function	Computability TheoryFast Growing Functions	A total computable two-argument function defined by nested recursion that grows faster than every primitive-recursive function, demonstrating that total computability strictly exceeds primitive recursion.
Action model learning	Machine LearningAutomated Planning	Action model learning (sometimes abbreviated action learning) is an area of machine learning concerned with the creation and modification of a software agent's knowledge about the effects and preconditions of the actions that can be executed within its environment.
Activation Function	Machine Learning	A specified neural-network map that transforms a unit or layer's preactivation into the activation passed onward or read as output.
Active networking	Computer NetworkingProgrammable Networks	A network architecture in which packets or associated capsules can carry programs executed at network nodes, allowing forwarding behavior and services to be customized dynamically.
Active reviews for intermediate designs	Software Architecture EvaluationSoftware Engineering	In software engineering, active reviews for intermediate designs (ARID) is a method to evaluate software architectures, especially on an intermediate level, i.e. for non-finished architectures.
Activity Diagram	—	A UML behavioral diagram that represents an activity as typed action, control, object-flow, branching, iteration, and concurrency relations with token-flow semantics.
Actor (UML)	Software Modeling	A modeled role played by an external entity while interacting with the subject of a UML use-case model.
AdaBoost	—	A boosting algorithm that repeatedly fits a weak classifier to adaptively reweighted examples and combines the resulting hypotheses in an error-weighted vote.
Address Resolution Protocol	Internet and Link Layer Networking	A local-link protocol that discovers the link-layer address associated with a network-layer address, most commonly mapping an IPv4 address to a MAC address.
Address space	Computer SystemsNaming and Memory	A namespace defining a set or range of discrete addresses and the entities or storage locations each address can identify under a qualification scheme.
Adjacency list	Graph Data Structures	A graph representation that associates each vertex with a collection of its neighboring vertices or incident edges.
Administrative Distance	Computer NetworkingRoute Selection and Routing Information Bases	A router-local preference assigned to a route source so the routing information base can choose among candidate routes to the same prefix learned by otherwise incomparable mechanisms.
Admissible numbering	Computability Theory	An effective enumeration of the partial computable functions that is computably translatable to and from a standard enumeration.
Adversarial Queueing Network	Network AlgorithmsAdversarial Queueing Theory	A discrete routed-packet model that tests whether edge queues stay bounded under constrained adversarial injections and a specified greedy scheduling policy.
Affix Grammar over a Finite Lattice	Formal GrammarsNatural Language Parsing	Affix grammars over a finite lattice (AGFL) is a restricted type of affix grammar in which affixes can only assume finite sets of values.
AI Supply-Chain Attack	AI Security	The compromise of an upstream AI-pipeline component — training data, weights, packages, eval sets — by an adversary who exploits the deployer's trust in the producer's channel rather than breaching the perimeter, so the poisoned artefact is imported voluntarily.
AIOps	It Operations Analytics	Applying AI-driven analysis to IT operations telemetry and incident records to detect, correlate, diagnose, and sometimes respond to service problems.
AKS primality test	Number Theoretic AlgorithmsComputational Complexity	The AKS primality test (also known as the Agrawal–Kayal–Saxena primality test and the cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in an article titled "PRIMES is in P".
Algebraic Decision Diagram	Formal Methods	A reduced ordered binary decision DAG whose terminal nodes carry values from a finite domain not restricted to Boolean values, canonically representing a multivalued function for a fixed variable order.
Algorithmic qubits	Quantum ComputingSystem Benchmarking	A vendor-introduced quantum-computer benchmark reporting the largest circuit width whose implementation passes a suite of application-oriented algorithm tests under specified fidelity thresholds.
Alpha max plus beta min algorithm	Computer Arithmetic	A low-cost approximation to two-dimensional Euclidean magnitude using a weighted maximum plus weighted minimum of component magnitudes.
Alternating-time temporal logic	Formal MethodsTemporal and Strategic Logics	A branching-time logic for concurrent games whose coalition modalities assert that selected agents have a strategy to ensure a temporal objective regardless of the other agents' choices.
Ambient Authority	Computer SecurityCapability Based Security	Authority available implicitly from a subject's execution environment or identity, allowing an operation on a named object without the request carrying an explicit unforgeable authorization for that object and action.
Ambient Awareness	Computer Mediated CommunicationSocial Media Research	Peripheral social knowledge that emerges as many small, recurrent social-media updates accumulate into a coherent sense of other people's activities, moods, interests, and availability without sustained one-to-one conversation.
Amdahl's Law	Parallel Computing	Bound the fixed-workload speedup from accelerating one fraction of execution while the unaffected fraction remains a limiting serial bottleneck.
Analysis of algorithms	Algorithm Analysis	In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute them.
Analysis of parallel algorithms	Parallel Computing and Algorithm Analysis	The resource analysis of algorithms with cooperating concurrent operations, tracking total work, critical-path span, processor count, time, space, communication, synchronization, and scalability under a declared machine model.
Anamorphism	Functional Programming	A coinductive unfold that maps a seed coalgebra uniquely into a final coalgebra, generating a recursive data structure.
And-inverter graph	Logic Synthesis	A directed acyclic representation of Boolean logic using two-input AND nodes and optional edge inversions.
Angelic Nondeterminism	Theoretical Computer ScienceNondeterministic SemanticsFormal Methods	An existential interpretation of nondeterministic choice in which a computation satisfies a goal whenever some permitted branch can achieve it.
Anonymous Function	Programming LanguagesFunction Construction	Construct a callable value at an expression site without declaring a persistent function name as part of that construction, so behavior can be invoked, passed, returned, stored, or composed inline.
Anonymous P2P	Privacy Networks	A peer-to-peer architecture designed to hide or minimize linkability between participants and their network locations.
Ant colony optimization algorithms	Optimization Algorithms	A population metaheuristic in which stochastic construction agents reinforce useful graph choices through shared, evaporating pheromone values.
API management	Software Platform Operations	The governed lifecycle of publishing, securing, mediating, documenting, observing, versioning, and retiring application-programming interfaces for providers and consumers.
Application Domain	Managed Runtime Architecture	A Common Language Infrastructure managed-execution boundary, commonly known as a .NET AppDomain, that isolates assemblies, configuration, security context, static state, and failure or unloading behavior for applications hosted within one operating-system process.
Applicative programming language	Programming Language Paradigms and Semantics	Classify a programming language or core calculus whose expressions are organized around applying value-level functions to arguments, with lambda-calculus-style reduction or evaluation providing the semantic center, while keeping purity, typing, evaluation order, and effects as independent dimensions.
Apprenticeship learning	Machine LearningInverse Reinforcement Learning	Apprenticeship learning infers a policy, reward function, or task representation from expert demonstrations so an agent can reproduce or generalize expert behavior without receiving an explicit reward specification for every action.
Approximate Computing	Approximate Computing	Deliberately relax computational exactness where application output can remain acceptable, choosing a quality and resource setting for the workload.
Approximation Algorithm	Theoretical Computer ScienceApproximation Algorithms	A polynomial-time optimization algorithm that always returns a feasible solution with a proved worst-case quality bound relative to the optimum.
Architectural decision	Software Architecture	In software engineering and software architecture design, architectural decisions are design decisions that address architecturally significant requirements; they are perceived as hard to make and/or costly to change.
Architecture astronaut	Software Architecture and Engineering Culture	A software-design anti-pattern in which an architect pursues increasingly abstract, universal frameworks while losing contact with concrete requirements, implementation constraints, users and executable feedback.
Argumentation framework	Artificial Intelligence	A formal model representing arguments and attack relations so admissible, preferred, stable or grounded sets of jointly defensible arguments can be computed.
Arithmetic circuit complexity	Algebraic Complexity	The resource complexity of computing a polynomial with a directed acyclic circuit of field constants, variables and arithmetic gates.
Arithmetic underflow	Computer Arithmetic and Numerical Analysis	A finite-precision arithmetic condition in which a nonzero result's magnitude is too small for normal representation in the destination format, causing a subnormal result, rounded zero or signaled exception.
Array-access analysis	Compiler Analysis	In computer science, array-access analysis is a compiler analysis approach used to decide the read and write access patterns to elements or portions of arrays.
Artificial Neural Network	Machine LearningNeural Networks	A learned parameterized network of connected computational units that transforms input signals into outputs through weighted aggregation, activation, and architecture-specific operations.
Aspect Weaver	Aspect Oriented ProgrammingSoftware Tooling	A software utility that selects program sites and integrates separately specified aspect behavior or structure into eligible code or running applications.
Associative Entity	Database Design	An identifiable relationship instance between other entities, with its own participation links and optional relationship-specific attributes.
Attack Surface	Software Security ArchitectureAttack Surface Measurement	Enumerate the system-boundary points, channels, and resources through which a specified adversary can attempt entry, extraction, or harmful effect, independently of whether a known flaw has yet been found there.
Attention (machine learning)	Machine LearningNeural Attention	A neural-network mechanism that computes context-dependent weights over representations and combines them so each output can focus selectively on relevant inputs.
Attribute–Value System	Information SystemsMachine Learning	An attribute–value system describes each object through a shared set of typed attributes, assigning a value to every object–attribute pair in its complete form.
Authenticated multiplexed remote-service session	Remote Access ProtocolsNetwork Security	Bind an accepted remote host and authenticated user to several identifiable, permitted service streams within one protected connection.
Authentication Failure	Information Security	The breakdown of a system's identity-verification, in which a claim is accepted when it should not be — because the procedure checked too little, the wrong evidence, or evidence an impostor could produce — yielding a session that inherits the real actor's privileges and corrupts every control conditioned on 'who is this?'
Autoencoder	Machine LearningNeural Networks	A parameterized encoder–decoder model trained to reconstruct inputs through a latent representation, with bottlenecks or regularization shaping what the code preserves.
Automated planning and scheduling	Artificial Intelligence	Computational construction and temporal-resource organization of action sequences that move an agent system from an initial state toward specified goals.
Automatic basis function construction	Reinforcement Learning	Learning task-reusable basis functions that compress a large state space for value-function approximation.
Automatic identification and data capture	Industrial Information Systems	A family of systems that senses an object's identity or attributes and enters the resulting data directly into an information system with minimal manual transcription.
Automatic parallelization	Compiler OptimizationParallel Computing	Automatic parallelization, also auto-parallelization or autoparallelization, is a compiler optimization in which a compiler or other software tool transforms sequential program code so that some of its operations can execute in parallel.
Automatic summarization	Natural Language Processing	Automatic production of a shorter text retaining salient information from source material.
Automaton	Automata TheoryTheoretical Computer Science	A formally specified abstract machine whose state and received symbol, event, or local condition determine permitted transitions and, where applicable, acceptance or output behavior.
Autonomic Computing	Self Managing Systems	A computing architecture in which monitored components use policies and feedback loops to configure, heal, optimize, and protect themselves with minimal direct administration.
Autonomous system (Internet)	Computer NetworkingInternet Routing	An autonomous system (AS) is a collection of connected Internet Protocol (IP) routing prefixes under the control of one or more network operators on behalf of a single administrative entity or domain, that presents a common and clearly defined routing policy to the Internet.
Average-case complexity	Computational ComplexityDistributional Complexity	The expected computational resource usage of an algorithm or problem under an explicitly specified probability distribution over inputs of each size.
AWPP	Computational Complexity	A counting-complexity class whose language decisions are represented by GapP functions that approximate a normalized acceptance indicator within bounded error.
B-Method	Formal MethodsSoftware Engineering	The B-Method is a method of software development based on B, a tool-supported formal method based on an abstract machine notation, used in the development of computer software.
B-Tree	External Memory Data Structures	Maintain a balanced, ordered, multiway search tree whose high-fanout nodes align with storage blocks, keeping lookup and dynamic updates logarithmic with few block accesses.
Background process	Operating Systems	A computer process that performs work without occupying the user’s foreground interaction.
Backward Compatibility	Software CompatibilityTechnical Versioning	A newer technical version preserves a specified older interface or behavior so a legacy dependent can continue to work within stated limits.
Bag-of-words model	Natural Language ProcessingDocument Representation	A text representation that records which tokens occur and often their counts or weights while discarding word order and most grammatical structure.
Bag-of-words model in computer vision	Computer Vision	An image representation that quantizes local visual descriptors into a learned vocabulary and summarizes the image by a histogram of visual-word occurrences.
Bandwidth Management	ComputingNetwork Traffic Engineering and Quality of Service	The policy-controlled measurement, classification, scheduling, shaping, policing, and feedback of network traffic so finite link capacity is allocated among flows while meeting declared service objectives.
Bandwidth shaping	Computer NetworkingTraffic Management	Traffic shaping smooths the bandwidth requirements of traffic flows by delaying transmission packets when they are queued in bursts.
Bandwidth-delay product	Computer NetworkingTransport Performance	The product of a communication path's capacity and round-trip delay, measuring how much unacknowledged data can occupy the path and therefore how much in-flight window is needed to keep it fully utilized.
Basic Block	Compiler Construction	A single-entry, straight-line run of compiler instructions whose represented control transfer occurs at its exit boundary.
Battle of the Sexes	Information TechnologyGame Theory	A 2×2 game in which both players prefer coordinating on some common outcome to failing, but each prefers a different one — so the conflict is not whether to cooperate but which of two cooperative agreements is reached, a distributional fight the payoff matrix cannot settle.
Bayesian Network	Probabilistic Graphical ModelsUncertainty Representation	Represent a joint probability law by a directed acyclic graph and one conditional distribution per variable given its parents.
Bayesian Programming	Probabilistic Programming	A probabilistic-program specification method that defines variables, factorizes their joint distribution, assigns parametric or nested forms, learns unspecified parameters from data, and answers conditional probability queries.
Behavior-Driven Development	Software EngineeringAgile Software Development	Develop software through collaborative discovery of concrete behavior examples that become shared, automatable specifications linking business intent to observable system outcomes.
Belief Revision	Knowledge Representation	Incorporate newly accepted information into a logically represented belief state while restoring consistency and preserving as much of the prior commitment structure as a declared minimal-change policy warrants.
Belief–Desire–Intention Model	Multi Agent SystemsAgent Architectures	BDI is fundamentally reliant on folk psychology (the 'theory theory'), which is the notion that our mental models of the world are theories.
Belief–Desire–Intention Software Model	Agent Architectures	A BDI software model organizes an agent's information, candidate objectives, and persisting intentions through an interpreter that selects and revises action as events occur.
Bell's Law of Computer Classes	Computer Architecture	The empirical generalization that roughly every decade a new, cheaper, smaller class of computer emerges on a new platform technology and displaces the prior class from volume dominance — a discrete threshold crossing derived from continuous Moore scaling.
Bell–LaPadula Model	Computer SecurityMultilevel Access Control	A formal multilevel-security state model that preserves classified-information confidentiality through subject/object labels, permitted access modes, and secure-state transitions.
Berkeley algorithm	Distributed Systems	A distributed clock-synchronization algorithm in which an elected leader estimates participant clocks, rejects outliers and sends relative adjustments toward their average.
Biba Model	Computer Security Models	A mandatory access-control integrity model that orders subjects and objects by integrity level and restricts information flow to prevent lower-integrity data from contaminating higher-integrity state.
Bidimensionality	Parameterized Graph Algorithms	A graph-algorithm framework for parameters that grow quadratically on grid-like graphs and do not increase under minors or contractions, enabling subexponential and kernel results.
Big O Notation	Asymptotic Analysis	Classify a function by its order of growth — discarding constant factors and small-input detail — so algorithms can be compared by how they scale rather than how fast they run on one machine.
Billiard-Ball Computer	Reversible ComputingConservative Logic	A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli.
Binade	Floating Point ArithmeticNumerical Analysis	In software engineering and numerical analysis, a binade is a set of numbers in a binary floating-point format that all have the same sign and exponent.
Binary-to-Text Encoding	Data Encoding	A paired rule that writes bytes as text-compatible symbols and decodes conforming text to recover the represented byte content.
Bird–Meertens Formalism	Constructive Functional ProgrammingAlgorithmics	A functional program-calculation method derives an equivalent program from a data-structured specification by law-justified rewrites of operators such as map and reduction.
Bit Rot	Software Maintenance	The failure mode in which an untouched software artefact loses usefulness over time not because its bytes changed but because its environment moved — 'working' being a relation between a static artefact and a churning world that erodes without upkeep.
Bit-Serial Architecture	Computer ArchitectureDigital Hardware	A digital datapath organization that processes successive bits of a multi-bit operand over time with narrow reused logic rather than a full-width parallel operator.
Bitter Lesson	Artificial Intelligence	Sutton's historical AI research lesson that general search and learning methods have repeatedly overtaken hand-engineered approaches as they became able to use more computation.
BK-tree	Metric IndexingExact Similarity Search	Index objects in a discrete metric space by recursively grouping equal pivot distances, then use the triangle inequality to restrict a radius query to only child distances that can contain a match.
Block Storage over a Network	Storage Systems	Present remote storage to a host as a block device by carrying block I/O requests, data, and completion status across a network.
Blockchain	Distributed SystemsCryptography	A replicated append-oriented ledger whose ordered blocks contain records and cryptographic links to prior blocks, with a distributed protocol coordinating which history participating nodes accept.
Bloom Filter	Probabilistic Data Structures	A probabilistic data structure that answers set-membership from a compact bit array and k hash functions with a deliberate one-sided error — it may report false positives but never false negatives — so a negative answer is safe to act on.
Blum–Shub–Smale Machine	Computational Complexity Theory	Model exact computation over a declared ring or field with registers storing its elements, unit-cost algebraic operations and tests, and finite control, thereby defining computability and complexity directly over continuous algebraic inputs.
Bongard Problem	Pattern RecognitionConcept Learning	A concept-learning puzzle that presents positive and negative diagram sets and asks for a rule true of every positive case and no negative case.
Boolean circuit	Circuit ComplexityComputational Complexity	In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits.
Boolean Conjunctive Query	Database Theory	A closed positive existential formula made from a finite conjunction of relational atoms, returning true exactly when one assignment satisfies every atom in a database instance.
Boolean hierarchy	Computational Complexity	The hierarchy of complexity classes obtained from finite Boolean combinations of NP languages.
Boosting	Machine LearningEnsemble Methods	A supervised ensemble procedure that builds predictors sequentially so each new learner corrects or reweights errors left by the current aggregate.
Bottom Type	Type TheoryProgramming Language Semantics	The least type in a declared subtyping order, below every type and useful for typing paths that return no ordinary value.
Bounded Storage Model	Information Theoretic CryptographySecurity Models	A cryptographic security model that uses temporary public randomness and a bound on adversarial retained information, rather than computational limits, to evaluate specified protocol goals.
Bounds checking	Computer ProgrammingRuntime Safety Checks	A validation operation that verifies an index, size or numeric value lies inside its permitted range before the value is used.
Braitenberg Vehicle	Embodied RoboticsSynthetic Psychology	A Braitenberg vehicle is a simple sensor–motor agent whose embodied coupling produces behavior that can appear purposeful without requiring a planner.
Branch Table	Systems Programming	A constant-time multiway dispatch structure that maps a validated selector through a dense table of code addresses or branch instructions to one of several control-flow targets.
Break/Fix	It Service ManagementReactive Support Delivery	An IT support arrangement in which a customer requests restoration after a fault or failure and pays the provider for the resulting incident-specific labor, parts, or service rather than for continuous management.
Broadcast (Parallel Pattern)	Parallel ComputingCollective Communication	Broadcast is a collective communication primitive in parallel programming to distribute programming instructions or data to nodes in a cluster.
Broadcast Storm	Ethernet SwitchingWireless Ad Hoc Networks	A network failure mode in which repeated or redundant broadcast traffic consumes shared forwarding capacity and impairs ordinary communication.
Budget-Feasible Mechanism	Algorithmic Mechanism Design	In mechanism design, a branch of economics, a budget-feasible mechanism is a mechanism in which the total payment made by the auctioneer is upper-bounded by a fixed pre-specified budget.
Buffer Overflow	Memory SafetySoftware Security	A memory-write failure in which data is written beyond the valid end of its intended buffer.
Bully algorithm	Distributed Systems	A distributed leader-election algorithm in which the highest-identifier live process eventually becomes coordinator after failures.
Burrows–Abadi–Needham Logic	Authentication Protocol AnalysisBelief Logics	A formal authentication-belief calculus derives what protocol principals may believe from idealized messages, explicit trust and freshness premises, and named inference postulates.
Bus Factor	Team Resilience and Knowledge Distribution	The minimum number of team members whose sudden simultaneous loss would halt a project — a per-capability count of how many people could take a subsystem, credential, or relationship over tomorrow, exposing where tacit human knowledge is dangerously concentrated.
Business systems planning	Enterprise Information ArchitectureInformation Systems Planning	Business systems planning is an enterprise information-planning method that derives an information architecture by relating organizational strategy, business processes, data classes, and application responsibilities.
Business-Process Modeling	Information SystemsEnterprise Modeling	Business process modeling (BPM) is the action of modeling processes of an enterprise.
Busy beaver	Computability Theory	The n-state busy beaver game consists of finding the longest-running or highest-scoring Turing machine which has n states and eventually halts.
Buzen's Algorithm	Queueing Theory	A station-by-station dynamic program for the normalization constant of a finite-population, closed product-form queueing network.
Bytecode	Programming Languages	A compact intermediate instruction representation designed for execution or translation by a software virtual machine.
Byzantine Generals Problem	Distributed Consensus Under Adversarial Faults	Formalize distributed consensus under adversarial faults — collapse the unbounded space of misbehaviors into a fault budget f and a population n, then read whether all loyal participants can agree straight off the proven floor of 3f+1 (or 2f+1 with signatures).
C-element	Asynchronous Digital Logic	An asynchronous state-holding logic element whose output changes only when all inputs agree and otherwise retains its prior state.
Cache coherence	Computer Architecture	The consistency property and protocol discipline that keep multiple cached copies of shared memory observably compatible.
Cache hierarchy	Computer Architecture	A layered memory architecture that places progressively larger and slower caches between processors and backing memory to exploit locality at several scales.
Cache Inclusion Policy	Computer ArchitectureMultilevel Processor Cache Organization	A multilevel-cache policy that maintains an inclusive, exclusive, or unconstrained residency relation between cache levels through coordinated fill, movement, eviction, and invalidation actions.
Cache Language Model	Natural Language ProcessingStatistical Language Modeling	A language model that combines a general next-word distribution with a distribution learned from recent text history to adapt its predictions as the text unfolds.
Cache-Only Memory Architecture	Computer ArchitectureMemory Systems	Make distributed node-local main memories cache-like, home-free stores that migrate and replicate shared data according to demand.
Caesar cipher	Classical Cryptography	A monoalphabetic substitution cipher replacing each symbol with the symbol a fixed offset away in a cyclic alphabet.
Calculus of Communicating Systems	Process Calculi	Milner's process calculus in which action prefix, choice, parallel composition, restriction, relabeling, and recursion generate labelled transition systems whose binary handshakes become internal actions and whose behaviors are compared by bisimulation.
Callback Hell	Asynchronous Program Structure	The readability collapse that results when a sequential chain of asynchronous steps is written as nested continuation callbacks, so indentation depth grows with step count and the code's textual shape inverts the computation's temporal order.
Canonical Data Model	Enterprise Application IntegrationMessage Transformation	An enterprise-integration pattern that routes application-specific data through one shared message model, replacing pairwise format dependencies with per-system translations.
Canonicalization	—	The conversion of multiple equivalent data representations into one designated canonical form for comparison, hashing, storage or interoperability.
CAP Theorem	Distributed Systems	A distributed data store cannot guarantee consistency and availability at once during a network partition, and since real networks always partition, the architect must choose which to sacrifice when one strikes.
CAP Theorem (and variants)	Distributed Storage Design Under Partition	Characterize any replicated data store by its coordinates on a small set of axes — the forced C-versus-A choice under partition, PACELC's latency-versus-consistency choice at rest, plus granularity dials and the CRDT merge-algebra escape.
Capability Maturity Model	Software Process Management	A staged process-improvement model that assesses organizational software practice from ad hoc execution through defined, measured and continuously optimizing control.
Capability-based addressing	Computer ArchitectureCapability Based Security	In computer science, capability-based addressing is a scheme used by some computers to control access to memory as an efficient implementation of capability-based security.
Carrier-Sense Multiple Access	Computer NetworkingMedium Access Control	A shared-medium access method in which stations sense an existing transmission and defer when the channel appears busy.
Catalytic computing	Space Complexity	A space-bounded computing model that temporarily uses memory with arbitrary initial contents while guaranteeing its exact restoration at the end.
CDR Coding	Lisp Implementation	Replace predictable tail pointers in contiguous Lisp conses with small per-word codes that decode the cdr as the next address, NIL, or an explicit pointer.
Cell Relay	Computer NetworkingBroadband Cell Switching	Switch statistically multiplexed fixed-length cells through a broadband network, trading bounded serialization and regular cell forwarding for per-cell overhead plus segmentation-and-reassembly state.
Cell-Probe Model	Theoretical Computer ScienceData Structure Lower Bounds	A data-structure computation model that charges only for reading or writing fixed-width memory cells while treating all computation between probes as free, so lower bounds isolate unavoidable information-transfer cost.
Chain code	Digital Image Representation	A contour representation that encodes a connected digital boundary as a start coordinate followed by symbols for successive grid-neighbor directions.
Chain Loading	Program ExecutionBoot Loading	A running executable hands primary control to a separately loadable successor stage through a platform-defined loading interface.
Change impact analysis	Software Engineering	Change impact analysis traces a proposed or observed change through dependencies in a software or engineered system to identify components, requirements, tests, costs, and behaviors that may be affected.
Chang–Roberts Algorithm	Distributed ComputingLeader Election	A unidirectional-ring leader-election protocol in which ordered identifiers circulate selectively until the maximum identifier returns to its owner.
Chase (algorithm)	Relational DatabasesDatabase Theory	Rule-saturation procedure for reasoning about relational data dependencies.
Checkpoint and restore	Operating SystemsParallel Computing	A recoverable execution cut is retained as restart state and used to reconstruct runnable context after an interruption.
Chomsky hierarchy	Formal Language TheoryGrammar Classes	A containment hierarchy of unrestricted, context-sensitive, context-free and regular grammars and their language classes, paired with progressively restricted computational recognizers.
Chomsky Normal Form	Formal Language Theory	Restrict a context-free grammar to binary nonterminal or single-terminal productions, with only a bounded start-symbol exception for the empty word.
Chroot	Operating SystemsUnix	chroot is a shell command and a system call on Unix and Unix-like operating systems that changes the apparent root directory for the current running process and its children.
Circuit Satisfiability	Circuit ComplexityCombinational Equivalence Checking	The existence of an external Boolean input valuation that drives a finite acyclic gate circuit's designated output to true.
Citation Pointer	Information TechnologyScholarly Communication and Documentation	A structured reference that identifies a source well enough to locate and verify it — an identification-plus-resolution bridge from claim to artifact that builds the infrastructure for verifiability without asserting the support is adequate, so 'has a citation' and 'is well-supported' stay separate findings.
Claims-Based Identity	Identity and Access ManagementComputer Security	Claims-based identity is a common way for applications to acquire the identity information they need about users inside their organization, in other organizations, and on the Internet.
Class (Knowledge Representation)	Knowledge RepresentationClass Based Representation and Description Logics	A formal concept whose expression denotes a set of individuals under an interpretation and whose assertions and class axioms support membership, subsumption, satisfiability, and classification reasoning.
Class Imbalance	Machine Learning	Diagnose why a 99%-accurate classifier can be useless: when one class vastly outnumbers the class of interest, additive loss aggregation lets majority examples dominate the gradient, so the model learns to ignore the rare minority.
Classless Inter-Domain Routing	ComputingInternet Addressing and Inter Domain Routing	An Internet addressing and routing architecture that represents contiguous IP address blocks by arbitrary-length prefixes, enabling hierarchical allocation, longest-prefix forwarding, and route aggregation beyond fixed address classes.
Class–Responsibility–Collaboration Card	Object Oriented Design	A compact object-design card naming a class, its responsibilities and its collaborators for scenario-based discussion and revision.
Clean-Room Design	Software Reverse EngineeringIntellectual Property Compliance	Clean-room design (also known as the Chinese wall technique) is the method of copying a design by reverse engineering and then recreating it without infringing any of the copyrights associated with the original design.
Cleanroom software engineering	Software EngineeringSoftware Reliability	A software development method coupling specification-led, reasoned construction of controlled increments with separate usage-oriented statistical assessment and failure feedback.
Client-Side Decoration	Window Systems	Assign an application client responsibility for rendering its own non-content window frame while coordinating move, resize, state, focus, and decoration mode with the window manager or compositor.
Closure (programming)	Programming Language Theory	The runtime value that packages a function's executable code with the bindings of its free variables captured at construction, so that when applied later its free variables resolve through that captured environment rather than the caller's — preserving lexical scope across the gap between where a function is made and where it runs.
Co-RE-complete	Computability Theory	A decision problem is co-RE-complete when it belongs to co-RE and every problem in co-RE reduces to it under the declared reduction, making it maximally hard within that class.
Codd's theorem	Database Theory	The database-theory result that relational algebra and domain-independent relational calculus have exactly the same expressive power.
Code generation (compiler)	Compiler Construction	The compiler phase that translates an intermediate representation into target instructions while selecting operations, allocating resources, and preserving program semantics.
Code Mobility	Distributed SystemsMobile Code	The capability to transfer executable code, optionally with data and suspended execution state, between hosts or runtime environments so computation begins or continues at the destination.
Code Review	Software Engineering	A software quality and knowledge-transfer practice in which someone other than the author examines a bounded code change or codebase and records findings before acceptance or follow-up.
Code Smell	Software Design and Refactoring	Treat an observable feature of code as defeasible evidence of a deeper design or maintainability problem—not proof of a defect—so inspection triggers a context test and a refactoring hypothesis.
Cohesion (software / module-level)	Software Engineering	Grade how tightly the responsibilities inside one code module turn around a single articulable purpose — from coincidental to functional — reading nameability, isolation-testability, and low-risk replaceability straight off the level.
Coinduction	Programming Language TheoryConcurrency Theory	In computer science, coinduction is a technique for defining and proving properties of systems of concurrent interacting objects.
Coloured Petri Net	Formal Models of ConcurrencyPetri Nets	A Petri-net formalism whose tokens carry typed data values called colours and whose transitions use variables, guards, and arc expressions, compactly representing families of similar concurrent states and events.
Column-Oriented Storage	Database SystemsAnalytic Storage	A physical tabular-data layout that groups values by attribute into separately readable column runs while retaining the associations needed to reconstruct rows.
Command-line completion	Command Line InterfacesShells	An interactive command-line feature that maps a partially typed token and current shell context to matching commands, paths, options, or arguments, automatically extending a unique prefix or presenting/cycling through alternatives.
Command-line interface	User InterfacesSystem AdministrationNetwork Management	Offers a user-accessible textual command vocabulary whose expressions request computing operations under the system's syntax and context, whether submitted by a person or a process.
Command–query separation	Imperative and Object Oriented Software Design	A design principle requiring each method either to change state as a command or return information as a side-effect-free query, but not both.
Comments as Deodorant	Code Quality and Maintainability	Read the need for an explanatory comment as a diagnostic signal, not a virtue — a clear paragraph explaining a confusing function masks a retirable design problem instead of fixing it, so do the rename or split that retires the comment rather than maintaining it.
Commonsense reasoning	Artificial IntelligenceKnowledge Representation	In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day.
Communicating sequential processes	Concurrency Theory	A process algebra for specifying and reasoning about concurrent systems as sequential processes that synchronize through named communication events or channels.
Communicating X-machine	Formal MethodsAutomata Theory	A formal model of interacting agents in which each component is an X-machine or stream X-machine with memory and processing functions, and components coordinate by explicitly modeled communication channels or messages.
Comparator-circuit complexity class CC	Computational Complexity Theory	The class of decision problems reducible to comparator-circuit value, equivalently computable by uniform polynomial-size comparator-circuit families under the stated input conventions.
Competitive regret	Online LearningRegret Analysis	An online-learning performance measure comparing an algorithm's regret with that of a stronger oracle or benchmark that may possess additional information or computational capability.
Compiler	Programming Language Implementation	Translate a fully specified source language ahead of time into a semantically equivalent target form through a pipeline of formal-interface phases, so the whole program can be globally analysed and optimised once while its observable behaviour is guaranteed preserved.
Compiler correctness	Compiler VerificationFormal Methods	In computing, compiler correctness is the branch of computer science that deals with trying to show that a compiler behaves according to its language specification.
Complete (complexity)	Computational Complexity Theory	In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.
Complexity Class	Computational Complexity Theory	Sort computational problems into a small lattice of named strata — P, NP, PSPACE, and their kin — by the resource bound they admit under a fixed model, so that placing a problem by one reduction transitively imports its whole feasibility profile.
Compound model scaling	Machine LearningComputer Vision	A neural-network family design rule that coordinates changes in multiple architecture dimensions as the resource budget changes.
Compressed Data Structure	Compressed Data StructuresData StructuresInformation Retrieval	An encoded data structure whose total space adapts to input compressibility while it still answers specified queries without fully decompressing the object.
Computation Tree Logic	Formal Methods	A branching-time temporal logic whose formulas pair universal or existential path quantification with next, eventually, always, or until modalities over Kripke structures.
Computational complexity of matrix multiplication	Algorithms and Complexity	The asymptotic resources required to multiply matrices, summarized algebraically by the smallest feasible exponent and operationally by finite-size costs and stability.
Computational hardness assumption	Cryptographic ComplexityCryptography	A conjectured computational problem difficulty used as the security foundation of a cryptosystem.
Computational problem	Theoretical Computer Science	A formally specified relation between encoded instances and acceptable solutions sought by an algorithm.
Computational steering	Scientific ComputingInteractive Simulation	Interactive intervention in a running computation or simulation to change parameters, resolution, boundary conditions or resource focus in response to visualized intermediate results.
Compute kernel	Parallel ComputingGpu Programming	A compute kernel is a routine compiled for a high-throughput accelerator and used by a separate host program, commonly instantiated as indexed work items over buffer data with independence or explicit synchronization governing their interaction.
Computer architecture	Computer ArchitectureHardware Design	The conceptual and operational organization of a computer system, including its instruction-set contract, microarchitecture, memory, and input/output interactions and their design tradeoffs.
Computer cooling	Computer EngineeringElectronics Thermal Management	The thermal-management function that removes and transports heat from computing components so their temperatures remain within reliable operating limits.
Computer Peripheral	Computer HardwareInput Output	A hardware device accessible to and controlled by a computer that provides input, output, storage, communication, or specialized function outside the system's contextually defined core processing components.
Concept class	Computational Learning Theory	A family of Boolean-valued concepts or classifiers over a common instance domain, serving as the hypothesis universe in computational learning theory.
Concept search	Information Retrieval	Information retrieval that ranks unstructured documents by semantic similarity to the ideas expressed in a query rather than exact word overlap alone.
Conceptual dependency theory	Artificial IntelligenceCanonical Event Semantics	Normalize paraphrastic natural-language inputs into canonical, language-independent event structures built from primitive acts, typed participants, dependencies, and inference-enabling causal expectations.
Conceptual graph	Knowledge Representation	A graph-based knowledge-representation formalism connecting typed concept nodes and relation nodes with a logical interpretation.
Concurrent Hash Table	Concurrent Data Structures	A hash-addressed key–value table with an operation protocol that preserves specified mapping semantics when supported calls overlap.
Conditional (Computer Programming)	Programming Language Semantics	A language construct selects a program branch or value by testing a condition and evaluating the selected alternative.
Configuration Graph	Computational Complexity Theory	Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes.
Confirmation Fatigue	Human Computer Interaction and Safety	The interaction-design failure where a blocking confirmation prompt fires so often, and so rarely marks a truly consequential choice, that users develop an automatic dismiss reflex that discharges the prompt without reading it — leaving it syntactically present but informationally inert.
Conjunctive grammar	Formal Language Theory	A conjunctive grammar extends a context-free grammar by allowing the right-hand side of a production to require the conjunction, and therefore intersection, of several syntactic conditions.
Conjunctive query	Database Theory	In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator.
Connectionless Communication	Computer Networking	Transmit each addressed data unit as an independent service invocation without first establishing shared per-flow connection state, leaving delivery, ordering, duplicate control, and congestion behavior to declared layers.
Constrained conditional model	Machine LearningNatural Language Processing	A constrained conditional model (CCM) is a machine learning and inference framework that augments the learning of conditional (probabilistic or discriminative) models with declarative constraints.
Constrained Shortest Path First	Computer NetworkingTraffic Engineering	Constrained Shortest Path First (CSPF) is an extension of shortest path algorithms.
Constraint satisfaction	Artificial Intelligence and Operations Research	The search for assignments to variables from declared domains such that every stated constraint is simultaneously satisfied.
Constructible function	Computational Complexity	A resource-bound function whose value can be produced within the time or space bound it specifies, making the bound usable in complexity hierarchy arguments.
Constructor (object-oriented programming)	Programming LanguagesObject Oriented Programming	A language-designated routine or hook that participates in initializing a class instance under the language's construction rules.
Context model	Context Aware Systems	A formal or semi-formal structure for representing, maintaining, and exposing environmental context to a context-aware system.
Context-based access control	Network Security	A stateful firewall policy that admits or blocks network traffic using application-session context rather than isolated packet fields alone.
Context-Free Grammar	Formal Language TheoryAutomata and Grammar Theory	Generate recursively nested strings with productions that replace one nonterminal at a time regardless of its surrounding symbols, yielding parse trees and exactly the languages recognized by nondeterministic pushdown automata.
Context-free language reachability	Program Analysis	The graph problem of deciding whether a path’s concatenated edge labels belongs to a given context-free language.
Context-sensitive grammar	Formal Language Theory	A formal grammar whose productions rewrite a nonterminal only within declared surrounding context without decreasing string length.
Continuous Data Protection	Data StorageBackup and Recovery	Continuously retain data changes so an earlier state can be reconstructed within a bounded recovery window.
Continuous Delivery	Software EngineeringDevops	A software-engineering operating approach that keeps every accepted change in a releasable state through short integration cycles, automated build and test pipelines, configuration control, and a repeatable deployment process, while leaving production release as a business decision.
Continuous design	Software and Product Design	An evolutionary design practice that revises a modular system throughout development using fast feedback, tests, refactoring, and delayed reversible decisions.
Control flow	Program Semantics	The possible next execution points of a program, determined by its transfer semantics.
Control-flow diagram	Process and Software Modeling	A diagram that represents operations or activities and the conditional, repetitive, and sequential control paths connecting them.
Controlled Computer Shutdown	Operating Systems	An authorized, ordered transition that quiesces software, commits state, releases resources, and hands a computer to power-off, halt, or reboot.
Convention over Configuration	Software Frameworks	A software-tool policy that infers documented defaults from recognized artifact patterns while reserving explicit configuration for exceptions.
Convolutional deep belief network	Deep LearningMachine Learning	A hierarchical generative neural model formed by stacking convolutional restricted Boltzmann machines, commonly using probabilistic max-pooling, layer-wise pretraining, and task-specific fine-tuning for high-dimensional spatial data.
Convolutional neural network	Machine LearningDeep Learning	A convolutional neural network (CNN) is a type of feedforward neural network that learns features via filter (or kernel) optimization.
Cook–Levin Theorem	Computational ComplexityNP Completeness	The theorem that Boolean satisfiability is NP-complete because every NP decision problem has a polynomial-time truth-preserving reduction to SAT.
Coons patch	Computer Aided Geometric DesignComputer Graphics	In mathematics, a Coons patch, is a type of surface patch or manifold parametrization used in computer graphics to smoothly join other surfaces together, and in computational mechanics applications, particularly in finite element method and boundary element method, to mesh problem domains into elements.
Cooper's Law	Information TechnologyWireless Communications and Spectrum Engineering	The empirical trajectory by which the number of simultaneous radio conversations supportable in a given spectrum at a given location has doubled roughly every 30 months for a century, driven chiefly by spatial reuse — so capacity is grown by densification, not by acquiring bandwidth.
Cooperative storage cloud	Distributed StoragePeer to Peer Systems	A decentralized online-storage model in which participating users contribute disk capacity on their own nodes, while coordination software fragments, encrypts, distributes, locates, and reconstructs stored data.
Core-Based Trees	Computer Networking	A historic shared-tree IP-multicast routing architecture in which group receivers join toward a configured core router and traffic follows the resulting bidirectional distribution tree.
Coroutines	Programming LanguagesControl Flow	Coroutines are computer program components that can be suspended and resumed — generalizing subroutines — for cooperative multitasking.
Cost Efficiency	Parallel Algorithms	In parallel algorithms, cost efficiency means processor count times runtime matches the best relevant sequential work up to a constant factor.
Counter-machine model	Automata TheoryModels of Computation	A counter-machine model is an abstract machine with finite-state control and integer counters that instructions increment, decrement, test, and branch upon to model computation.
Counting hierarchy	Computational Complexity	The oracle hierarchy beginning with P and iterating PP computation, analogous to the polynomial hierarchy with majority counting in place of existential nondeterminism.
CPU cache	Computer Architecture	A small fast processor-local memory that retains copies of recently or predictably useful main-memory blocks to reduce average access cost.
CPU Shielding	Operating Systems	Reserve designated CPU capacity for latency-sensitive work by excluding ordinary competing tasks from that capacity.
Cross-Site Scripting	Web Application Security	Insert attacker-supplied bytes into a server's output so the victim's browser executes them under the trusted site's origin, arising when content is written into a sink without encoding for the context it lands in.
Crowdsensing	Mobile ComputingDistributed Sensing	Collective measurement of a shared phenomenon from situated sensor observations contributed by multiple mobile carriers.
Cryptographic Hash Function	Cryptography	Turn an arbitrarily large input into a short fixed-length digest that acts as a tamper-evident proxy for it, using three computational-hardness properties — preimage, second-preimage, and collision resistance — so anyone can verify content or bind a commitment but no one can forge or invert it.
Cube-connected cycles	Parallel Computing Topology	A cubic interconnection graph formed by replacing each hypercube vertex with a cycle and distributing cube dimensions around that cycle.
Cyberattack	Cybersecurity	Conduct a deliberate hostile action through or against digital systems to gain unauthorized access, steal or manipulate information, disrupt availability, or maliciously control computing resources.
Cyclomatic complexity	Software Metrics	The cycle rank of a program's control-flow graph, interpreted as the number of linearly independent execution paths.
Dadda multiplier	Computer ArithmeticDigital Circuit Design	Hardware multiplier design.
Dangling else	Programming Language Grammar	Dangling else is the attachment ambiguity created when one optional else follows two nested eligible if statements.
Data Backup Method	Data Backup and Restore	Retain recoverable digital data and its necessary recovery information so a defined earlier state can be reconstructed after loss or unwanted change.
Data binding	Programming ParadigmsUI Frameworks	In computer programming, data-binding is a general technique that binds data sources from the provider and consumer together and synchronizes them.
Data buffer	Computer SystemsIO and Streaming	A temporary memory region that decouples a data producer and consumer whose transfer sizes, rates or scheduling do not align.
Data center infrastructure efficiency	Data Center Operations	An energy-efficiency metric equal to IT equipment power divided by total facility power.
Data Class	Object Oriented Design	Flag an object-oriented class that holds fields with getters and setters but no domain methods as a symptom that its behavior migrated outward into consumers, then resolve the verdict with one role question — should this class enforce its own invariants?
Data deduplication	Data StorageRedundancy Elimination	A storage or transfer technique that replaces repeated data regions with references to one retained instance while preserving reconstruction of the original logical data.
Data dependency	Compiler and Parallel Computing	A relation in which one program operation reads or writes a location whose value or ordering is affected by another operation, constraining safe reordering and parallel execution.
Data element	Data ManagementMetadata Registries	In metadata, a data element is an atomic unit of data with a precise meaning.
Data Extraction Through Prompting	AI Security and Red Teaming	The AI-security failure mode in which an adversary crafts inputs that make a deployed language model emit private content — training text, system prompts, retrieved documents — by exploiting the legitimate inference interface, whose breadth exceeds the access-control envelope around the data.
Data Format	Data FormatsData Encoding	A data format is a documented convention that maps a logical data model into a concrete symbolic or binary organization by specifying units, fields, ordering, syntax, encodings, metadata, constraints, and version rules sufficient for conforming implementations to parse and interpret data consistently.
Data Migration	Data ManagementSystems Migration	Transfer a defined dataset to a target system and hand its authoritative use to that target under a suitable fidelity criterion.
Data Mining	Knowledge Discovery in DatabasesMachine Learning	The iterative discovery and evaluation of useful, understandable patterns in substantial datasets through coordinated preprocessing, modeling, validation, and deployment.
Data Model	—	A formal information-system structure that declares data types, attributes, relationships, integrity rules, and permitted operations at a stated conceptual, logical, or physical level.
Data model (ArcGIS)	Geographic Information SystemsSpatial Data Modeling	A geographic data model, geospatial geographical measurements, or simply data from modules in the context of geographic information systems (GIS), is a mathematical and digital structure for representing phenomena over the Earth.
Data Poisoning Attack	AI Security and Adversarial ML	The adversarial-ML failure mode where an attacker corrupts training inputs so the model learns an attacker-chosen behaviour — an upstream contamination that runtime defenses are structurally powerless against and that clean benchmark accuracy cannot detect.
Data Recovery	Data Storage	Retrieve and validate usable data from storage whose normal access path is unavailable because of deletion, corruption, metadata loss, device failure, or physical damage.
Data retrieval	Database Systems	The execution of a structured request against a managed data store to locate, select, and return records or values satisfying declared identifiers, predicates, relations, and access rules.
Data scrubbing	Computer StorageData Integrity Maintenance	A background integrity process that periodically reads stored or memory-resident data, detects latent corruption and reconstructs correct content from checksums, error-correcting codes or redundant copies.
Data storage	Information StorageStorage Systems	Data storage is the recording (storing) of information (data) in a storage medium.
Data Type	—	A data type is a specification of a class of values together with their representation or abstract behavior, admissible operations, invariants, equality and error conventions, and static or dynamic rules governing storage, construction, use, and composition in a computational system.
Database application	Database SystemsApplication Software	A database application is software organized around creating, validating, querying, updating, and presenting persistent records managed by a database system for a particular operational domain.
Database Index	Database Systems	A maintained auxiliary structure mapping declared key values or predicates to database rows so selected retrieval and ordering become faster at a storage and update cost.
Database schema	Database SystemsSchema and Data Modeling	Specify a database’s permitted structures, relations, constraints, and object organization in the formal language of its data model or management system.
Database transaction	Database Systems	A bounded database unit of work whose reads and writes commit together or abort together under declared atomicity, consistency, isolation, and durability guarantees.
Davis–Putnam Algorithm	Automated Theorem ProvingPropositional Satisfiability	Decide clausal satisfiability by eliminating variables with resolution while preserving whether the clause set has a model.
Debugging	Software DebuggingDigital Design Debugging	Investigation of faulty behavior in a program or digital design by gathering evidence, narrowing causes, and testing an explanation or correction.
Decision table	Business Rules and Software Specification	A tabular rule representation enumerating combinations of conditions and the actions prescribed for each combination.
Decision Tree Model	Computational ComplexityQuery Complexity	An adaptive query-complexity model represented by a tree of permitted tests and answer branches, with leaves as outputs and path length as query cost.
Decision tree pruning	Machine Learning	The removal or replacement of low-value branches from a decision tree to reduce complexity and improve expected generalization.
Decision-theoretic rough sets	Machine LearningRough Set Decision Models	A probabilistic rough-set framework that derives lower, boundary and negative decision regions by minimizing expected loss under conditional class probabilities.
Decisional Diffie–Hellman assumption	Cryptographic Foundations	The cryptographic hardness assumption that a genuine Diffie–Hellman tuple is computationally indistinguishable from one with an independent random final group element.
Declarative programming	Programming LanguagesProgramming Paradigms	A programming paradigm that specifies desired results, relationships or constraints while leaving substantial control-flow and execution-order choices to the language implementation.
Deep belief network	Machine Learning	A multilayer generative model whose top layers form an undirected associative model and lower layers form directed latent-variable connections.
Deep learning	Machine LearningMultilayer Neural Networks	Learn task-relevant hierarchical representations with multilayer parameterized neural networks trained end to end by optimization over data, enabling complex prediction and generation at the cost of opacity, data dependence, and compute.
Default logic	Knowledge Representation and Logic	A nonmonotonic formal logic that licenses defeasible conclusions when prerequisites hold and their justifications remain consistent with the evolving belief set.
Defeasible Logic	Artificial Intelligence	Defeasible Logic derives definite and provisional conclusions from typed rules, blocking defeaters and explicit priorities when evidence conflicts.
Delay-gradient congestion control	Computer NetworkingTransport Congestion Control	Regulate a network sender using the direction and magnitude of recent round-trip-delay change as congestion feedback, rather than relying only on packet loss or a fixed absolute-delay threshold.
Delegated Administration	Systems AdministrationIdentity and Access Management	A governed grant that lets a separate principal perform specified administrative operations over a defined technical scope.
Demand paging	Operating Systems	A virtual-memory policy that loads a page into physical memory only after an attempted access faults on that absent page.
Dempster–Shafer theory	Uncertain ReasoningBelief Functions and Evidence Fusion	Assign evidential mass to subsets of a frame of discernment, derive belief and plausibility bounds for propositions, and combine appropriately independent evidence with a declared conflict rule.
Denotational semantics of the Actor model	Programming Language SemanticsConcurrency Theory	The denotational semantics of the Actor model is the subject of denotational domain theory for Actors.
Dependency Hell	Package Management	The pathological state where a project's transitive dependency closure holds mutually incompatible version constraints, turning installation into an NP-complete constraint-satisfaction problem that no edge-level patch can resolve.
Design predicates	Software Testing	A software-integration testing model that classifies inter-unit call relationships and assigns complexity increments used to bound independent integration paths.
Desktop Metaphor	ComputingHuman Computer Interaction and Graphical User Interfaces	A graphical-interface conceptual model that maps files, folders, documents, tools, windows, and disposal onto familiar office-desktop objects so users can predict digital actions by analogy.
Deterministic automaton	Automata Theory	An automaton whose current state and next input determine at most one successor state, eliminating branching choice from transition execution.
Deterministic context-free grammar	Formal Language Theory	A context-free grammar generating a language recognizable by a deterministic pushdown automaton.
Deterministic Finite Automaton	Automata Theory	Recognize a regular language by starting in one of finitely many states, taking exactly one transition for each input symbol, and accepting according to the unique terminal state.
Deterministic parsing	Natural Language ProcessingParsing	In natural language processing, deterministic parsing refers to parsing algorithms that do not backtrack.
Device Capability Database	Operating SystemsDevice Interoperability	A selected collection of machine-readable device descriptions lets software use shared capability names to adapt commands and output to different device types.
Device Jailbreaking	Device SecurityFirmware Security	Circumvention of a supplier-enforced device software restriction that gives a non-supplier actor an execution or modification capability stock enforcement would block.
DEVS	Modeling and Simulation	Specify timed event-driven systems as modular atomic state machines and hierarchically coupled networks with explicit transition, output, and time-advance semantics.
Diagnosis (artificial intelligence)	Artificial IntelligenceModel Based Diagnosis	As a subfield in artificial intelligence, diagnosis is concerned with the development of algorithms and techniques that are able to determine whether the behaviour of a system is correct.
Dichromatic reflectance model	Computer VisionReflectance Modeling	m b and m s are scale factors depending on illumination, view directions and surface orientation.
Differential Evolution	Evolutionary Optimization	A population-based numerical optimizer that creates trial vectors from scaled differences among current candidates and retains them by evaluated quality.
Diffie–Hellman problem	CryptographyComputational Complexity	Compute the shared exponentiation result from two public powers in a specified cyclic group.
Digital Data	Digital Information	Represent data as sequences over a finite discrete alphabet, interpreting physical states through symbol thresholds and shared codes so content can be stored, transmitted, copied, computed, and error-checked independently of one carrier.
Digital signature	Cryptography Security	Bind a specific message to a specific private-key holder with a short string anyone can check against the public key, confining all remaining trust to one question — does this public key authentically belong to its claimed principal?
Digital Watermarking	Multimedia SecurityDigital Content Identification	Embedding an identifiable signal in controlled features of a digital artifact so a specified detector can later test for that signal under stated conditions.
Dimensional modeling	Data Warehousing	A data-warehouse design method organizing measurable business events as fact tables linked to descriptive dimension tables for understandable, performant analysis.
Dining philosophers problem	Concurrent Computing	A concurrency problem modeling processes that alternately need pairs of shared resources, exposing deadlock, starvation and fairness constraints.
Direct Client-to-Client	Network ProtocolsInternet Relay Chat	Direct Client-to-Client (DCC) (originally Direct Client Connection ) is an IRC-related sub-protocol enabling peers to interconnect using an IRC server for handshaking in order to exchange files or perform non-relayed chats.
Directory service	Network Operating SystemsDirectory Services	A directory service is a critical component of a network operating system.
DisCoCat	Computational LinguisticsCategorical Compositional Semantics	A categorical compositional distributional semantics framework in which a structure-preserving functor maps grammatical derivations to operations that compose word meanings in a vector-space or other distributional semantic category.
Discoverability Failure	Human Computer Interaction	Diagnose why a working feature goes unused: the capability exists and functions perfectly, but no signal on any surface the user samples announces it, so the user's option set is bounded by the visible interface and the feature is operationally nonexistent.
Discrete diffusion model	Generative Modeling	A latent-variable generative model that corrupts categorical states through a forward Markov jump process and learns a reverse process to generate data.
Discrete system	State MachinesDiscrete Modeling	A system modeled with a finite or countable set of distinguishable states and allowed transitions.
Disjoint-Set Data Structure	Data Structures	Maintain a mutable partition under Make-Set, Find, and Union, typically with representative-rooted forests, union by rank or size, and path compression for inverse-Ackermann amortized time.
Disk Cloning	Data StorageSystem Administration	Disk cloning is the process of duplicating all data on a digital storage drive, such as a hard disk or solid state drive, using hardware or software techniques.
Dispersive Flies Optimisation	Swarm Optimization	A bounded population optimizer that moves coordinates from a fitter ring neighbor using the current swarm-best displacement, with thresholded disturbance.
Distributed algorithmic mechanism design	Algorithmic Game Theory	The design of incentive-compatible mechanisms whose communication and computation are performed across strategic networked agents rather than by one trusted center.
Distributed artificial intelligence	Artificial Intelligence	The design and analysis of intelligent behavior produced by multiple computational agents or processes distributed across resources, knowledge and control.
Distributed Data Store	Distributed Storage	A storage system whose logical data and access service span multiple networked nodes, using placement, replication or erasure coding, routing, consistency rules, and failure handling to present persistent data despite partial and asynchronous state.
Distributed File System for Cloud	Distributed StorageCloud Computing	A cloud-scale file service that distributes file contents and metadata across networked nodes while preserving a declared namespace, operation, consistency, security, and failure-recovery contract for many clients.
Distributed lock manager	Distributed Resource Locking	Coordinate named lock ownership and compatible access modes across cluster nodes so shared resources retain mutual-exclusion and recovery guarantees despite concurrency and membership change.
Distributed Object	Distributed ComputingDistributed Object Systems	An object abstraction made usable across an address-space boundary through a typed remote interface and transferable reference, while preserving object identity and exposing the latency, failure, concurrency, lifecycle, and security semantics that locality normally hides.
Distributed shared memory	Distributed SystemsParallel Programming	A shared-data programming view maintained across physically separate computer memories by a distributed implementation.
Divide-and-conquer algorithm	Algorithm DesignRecursive Algorithmic Paradigms	Solve a problem by splitting each non-base instance into smaller related subproblems, solving those recursively, and combining their results into the original answer.
Division Algorithm	Computer Arithmetic	A terminating integer-arithmetic procedure that returns quotient and remainder satisfying a declared Euclidean division contract.
DLL Hell	Dependency Management and Packaging	The failure mode where programs share dynamic libraries through one global single-version-wins namespace, so an unrelated install overwrites a version another program depends on and silently breaks it — cured by breaking the single-version-wins invariant.
DNA computing	Unconventional ComputingMolecular Computing	DNA computing is an emerging branch of unconventional computing which uses DNA, biochemistry, and molecular biology hardware, instead of the traditional electronic computing.
Document Structure Description	Markup LanguagesXML Schema Languages	A schema language for expressing the permitted elements, attributes, content and contextual constraints of XML documents, developed as an alternative to DTD and XML Schema.
Domain analysis	Software EngineeringSoftware Product Lines	A software-engineering process that compares related systems and their business context to model commonality, variation, and reusable assets for a product family or domain.
Domain application protocol	Distributed Systems	A domain-specific hypermedia interaction contract that narrows a general application protocol into the resources, link relations and state transitions of one distributed business process.
Domain Model	Software EngineeringConceptual Modeling	In software engineering, a domain model is a conceptual model of the domain that incorporates both behavior and data.
Domination Analysis	Approximation AnalysisCombinatorial Optimization	Domination analysis evaluates a heuristic by the number of feasible solutions its output is guaranteed to match or beat, rather than only by its gap from the optimum.
DOPIPE	Parallelizing Compilers	DOPIPE pipelines a regular loop by assigning dependence-respecting groups of loop-body statements to ordered parallel stages.
Double-Pushout Graph Rewriting	Algebraic Graph Transformation	A graph-rewrite semantics that preserves an interface while two pushouts delete and add matched structure.
Double-spending	Digital Payment Systems	The invalid reuse of the same monetary unit or digital asset in two conflicting transfers when the system should authorize at most one.
Dovetailing (computer science)	Computability Theory	A fair scheduling technique that interleaves steps of multiple potentially nonterminating computations so none can block all others forever.
Dry Run (Testing)	Software Testing	Traverse an intended command, procedure, or system execution while suppressing or substituting consequential effects, exposing planned actions and precondition failures before committing a live run.
DSPACE	Computational ComplexitySpace Complexity	The deterministic space-complexity resource and associated classes of decision problems solvable by a deterministic Turing machine using a bounded amount of work-tape memory.
Dual Modular Redundancy	Fault Tolerant Computing	A two-channel computing arrangement that compares corresponding results to detect faults, without by itself identifying which disagreeing channel is correct.
Duck Typing	Programming LanguagesSoftware Design	A programming compatibility discipline that accepts a value for the operations it supports rather than requiring declared type ancestry.
Dyck language	Formal Language TheoryAutomata Theory	The context-free language of bracket strings whose openings and closings are correctly balanced, ordered, and nested, with type-correct matching where several bracket pairs exist.
Dynamic application security testing	Application SecuritySoftware Testing	Because the tool is implementing a dynamic testing method, it cannot cover 100% of the source code of the application and then, the application itself.
Dynamic Bayesian network	Probabilistic Graphical Models	A Bayesian network template replicated across time slices to represent probabilistic dependencies within and between successive states of a stochastic process.
Dynamic Problem	AlgorithmsDynamic Data Structures	An algorithmic problem that must answer queries about a maintained data structure while its underlying objects are inserted, deleted, or modified, with separate update, query, space, and initialization costs.
ECLR-Attributed Grammar	Compiler ConstructionAttribute Grammars	An L-attributed grammar paired with a partition of inherited attributes whose members have the same unique semantic expression in each relevant LR parser state.
Edge computing	Distributed ComputingCloud Computing	Edge computing is a distributed computing model that brings computation and data storage closer to the sources of data.
Elapsed-Time Memory Decay	Machine LearningSequence Models	A recurrent-model update that uses elapsed time to contract carried state or stale input toward a target before incorporating the next observation.
Element distinctness problem	Computational Complexity TheoryAlgorithms	In computational complexity theory, the element distinctness problem or element uniqueness problem is the problem of determining whether all the elements of a list are distinct.
Elementary Key Normal Form	Relational Normalization	Elementary key normal form tests each minimal functional dependency against a key determinant or a target attribute in an elementary key.
Elicitation technique	Knowledge AcquisitionRequirements Engineering	A method for drawing specified knowledge or preferences from people's responses or observed behavior in an inquiry.
ELIZA Effect	Human Computer Interaction and AI	The tendency of users to attribute understanding, intention, and inner states to a system that produces only fluent, context-appropriate conversational output — a cheap default Theory-of-Mind inference that fires once output crosses a coherence threshold and persists even when the mechanism is known.
Elvis Operator	Programming LanguagesOperators	In certain computer programming languages, the Elvis operator, often written ?: , is a binary operator that returns the first operand if its value is logically true (according to a language-dependent convention, in other words, a truthy value) or returns its second operand if the first operand is not true.
Empirical algorithmics	Algorithm Engineering	The systematic experimental study of algorithm behavior through implemented instances, controlled benchmarks and statistical analysis.
Emptiness problem	Theoretical Computer ScienceDecision Problems for Formal Language Representations	A decision problem asking whether the language denoted by a given formal representation contains no valid strings.
Empty type	Type Theory and Logic	A type with no inhabitants, representing falsehood under Curry–Howard and serving as the codomain from which negation and ex falso elimination are defined.
Empty-State Failure	Human Computer Interaction	The interface condition in which a view has no content and provides no scaffolding for the absence — no explanation of the cause, no disambiguation among the possible causes (new, filtered, permission, loading, error), and no next action — so the user, left to infer meaning from nothing, typically concludes wrongly that the system is broken or gated.
Encryption	Cryptography	Transform a plaintext under a key into a ciphertext from which the message cannot be feasibly recovered without the decryption key — a computational asymmetry gated by a secret, so confidentiality depends only on who holds the key rather than on the channel.
End-to-End Principle	Network and Systems Architecture	The architectural rule that a function whose correctness criterion can only be discharged with knowledge at the communication endpoints should live at the endpoints, not the intermediate nodes — so any in-network implementation is at best a performance optimization the endpoints must still back up.
Energy-Based Model	Machine LearningStructured Prediction	A learned model that scores configurations with a scalar energy so lower-energy alternatives are preferred in inference, without requiring a normalized probability or any particular training or sampling algorithm.
Ensemble learning	Machine Learning	A machine-learning strategy combining predictions from multiple models so their complementary errors yield a stronger aggregate predictor.
Enterprise Data Modelling	Information SystemsEnterprise Data ArchitectureData Management	The organizational practice of creating and governing a shared conceptual model of enterprise data—its business entities, meanings, relationships, rules, and authoritative vocabulary—across systems and projects.
Entity–attribute–value model	Data ModelingDatabase Design	An entity–attribute–value model (EAV) is a data model optimized for the space-efficient storage of sparse—or ad-hoc—property or data values, intended for situations where runtime usage patterns are arbitrary, subject to user variation, or otherwise unforeseeable using a fixed design.
Entity–relationship model	Data Modeling	A conceptual data model representing entity types, their attributes and the relationships and cardinalities connecting entity instances in a domain.
Enumeration Algorithm	Theoretical Computer ScienceEnumeration Complexity	Given an input and a declared solution relation, generate every associated solution without repetition, with performance evaluated by preprocessing, inter-output delay, incremental time, total output-sensitive time, and space.
Enumeration reducibility	Computability Theory	A computability reduction in which every enumeration of one set can be transformed effectively into an enumeration of another.
Envy minimization	Algorithmic Game TheoryFair Division	In computer science and operations research, the envy minimization problem is the problem of allocating discrete items among agents with different valuations over the items, such that the amount of envy is as small as possible.
Equalized odds	Machine LearningGroup Fairness for Supervised Prediction	A classifier fairness criterion requiring protected groups to have equal true-positive and false-positive rates conditional on the actual outcome.
Error-Message Opacity	Human Computer Interaction	Diagnose the post-failure interface defect where a system correctly detects and announces a fault but the message omits the repair-supporting content — cause, context, next action, escalation — so the user is told they are stuck without being told how to get unstuck.
ESPACE	Computational ComplexityDeterministic Space Complexity	Classify decision problems solvable by a deterministic Turing machine using at most single-exponential workspace, conventionally \(\bigcup_{c>0}\mathrm{DSPACE}(2^{cn})\).
Essential Tuple Normal Form	Database Theory	A relational-schema condition requiring every tuple in every legal instance to be essential, with an exact BCNF and join-dependency test under FD/JD-only constraints.
Euler tour technique	Graph Algorithms	A tree representation that replaces each undirected edge with two directed arcs and linearizes the resulting Euler tour for efficient queries and updates.
Evaluation function	Artificial IntelligenceGame Tree Search	A heuristic used by a game-playing program to assign an estimated value or outcome distribution to a position when exhaustive continuation search is unavailable or impractical.
Evasion Attack	AI Security and Adversarial Machine Learning	Craft inputs that fall on the benign side of a deployed classifier's learned decision boundary while preserving their malicious payload — exploiting the gap between the boundary and the true concept it was meant to represent, so near-perfect test accuracy coexists with near-zero robustness under attack.
Event Correlation	Operations Monitoring	Relates multiple operational events under a model to filter symptoms or produce a higher-level fault or incident interpretation.
Event detection for WSN	Wireless Sensor NetworksDistributed Detection	A distributed sensing workflow that detects a prespecified environmental or system event at resource-constrained wireless nodes and communicates only qualifying evidence or decisions, trading communication energy against detection delay, misses, false alarms, and network robustness.
Event Partitioning	Structured Systems AnalysisRequirements Modeling	Event partitioning derives a preliminary system behavior model by mapping boundary events to required responses and checking their data flows against the environment.
Event structure	Concurrency Theory	A concurrency model representing events with causal enabling, conflict, and consistency relations that determine possible executions.
EventStorming	Domain Driven Design	Explore a business domain together by making its meaningful events visible, relating them, and challenging the resulting shared account.
Evolutionary acquisition of neural topologies	Machine LearningNeuroevolution	An evolutionary reinforcement-learning method that jointly evolves artificial-neural-network structure and weights, using structural mutation and evolution-strategy parameter optimization.
Evolutionary Computation	Computational IntelligenceEvolutionary Algorithms	Evolutionary computation (EC) from computer science is a family of algorithms for global optimization inspired by biological evolution, and a subfield of computational intelligence and soft computing studying these algorithms.
Evolutionary data mining	Machine Learning and Evolutionary Computation	A family of data-mining methods that use evolutionary search to evolve rules, feature sets, model structures, parameters, or pipelines under a data-dependent fitness function.
Exact Quantum Polynomial Time	Quantum Complexity TheoryComputational Complexity	The class of decision problems solved by a uniform quantum computation in worst-case polynomial time with exactly zero probability of error.
Example-First Modeling	Conceptual ModelingRequirements Engineering	Deriving a reusable conceptual or behavior model from concrete cases and checking the result against those cases.
Exception chaining	Object Oriented Programming	Exception chaining rethrows a caught exception inside a higher-level exception while preserving the original as its cause.
Exception handling	Programming Languages and Systems	The controlled transfer of execution from an anomalous condition to a designated handler that can recover, translate, propagate or terminate.
Excessive Data Exposure	API Security	An API endpoint returns more fields than the caller's role requires, trusting a client-side filter to hide the surplus — but the unfiltered payload is already on the wire, so the surplus must be stripped at the producer via role-scoped projection.
Executable UML	Model Driven EngineeringSoftware Engineering	A model-driven software method that adds executable actions to UML-style domain and state models.
Existential theory of the reals	Computational Complexity	The set and associated decision problem of true existential sentences formed from polynomial equalities and inequalities over real variables.
Exit Status	Operating SystemsShell Programming	A small value produced when a process terminates and made available to its parent or caller to summarize whether and, by convention, how the execution completed.
Explicit Congestion Notification	Internet Congestion Control	An IP and transport mechanism that lets routers mark congestion in packet headers so endpoints can reduce sending rates without requiring packet loss as the signal.
Explicit Flush of Deferred Writes	Storage SystemsFilesystem IO	An explicit storage-layer operation that selects earlier deferred writes and establishes a documented transfer, cache-flush, or ordering boundary for that set.
Exponential tree	Data Structures	A search-tree structure whose branching factors shrink doubly exponentially with depth, storing keys at leaves and auxiliary predecessor structures at internal nodes.
EXPSPACE	Computational ComplexitySpace Complexity Classes	Classify decision problems solvable by a deterministic Turing machine using at most exponential workspace in the input length, allowing arbitrary finite exponential exponents through a union of space bounds.
Extended Boolean model	Information RetrievalGraded Boolean Retrieval	An information-retrieval model that relaxes exact Boolean matching by incorporating partial matching and term weights.
Extended Static Checking	Programming Languages and Verification	A compile-time program-analysis regime that turns lightweight specifications into verification conditions and uses automated proving to find errors beyond ordinary type checking while deliberately prioritizing usable diagnostics over complete proof.
Extended-Precision Floating-Point Format	—	A floating-point format provides more precision or exponent range than a designated basic format so intermediate computation can defer rounding, underflow, and overflow until an explicit conversion boundary.
Eye Vein Verification	Biometric VerificationComputer Security	Biometric verification of a claimed identity by comparing an eye-vein pattern image with an enrolled template.
Factor graph	Probabilistic Graphical Models	A bipartite graph whose variable nodes and factor nodes expose how a multivariate function decomposes into local functions.
Factored Language Model	Natural Language Processing	A statistical language model that represents each token as a bundle of linguistic factors and predicts a selected factor from a configurable graph of prior lexical, morphological, syntactic, or semantic factors, using generalized backoff when contexts are sparse.
Failure detector	Distributed Computing	A distributed-system abstraction that supplies processes with possibly fallible suspicions about crashed peers, classified by completeness and accuracy guarantees.
Fallacy of Homogeneous Networks	Distributed Systems	The implicit assumption that all nodes, links, OSes, versions, and configs across a distributed deployment are uniform — a missing degree of freedom in the system's model of its substrate that stays latent until deployment crosses a boundary where the uniformity breaks.
Fallacy of Infinite Bandwidth	Distributed Systems	Catch the distributed-systems assumption that the network carries whatever data an application generates for free, by reclassifying bandwidth as a finite, shared, budgetable resource and tracking bytes per operation against the capacity of the path.
Fallacy of One Administrator	Distributed Systems Fallacies of Distributed Computing	Reason about a deployed system as though one authority governs every node it depends on, when it actually crosses many independently-governed administrative domains — so failures concentrate at the unmodeled seams between them.
Fallacy of Stable Topology	Distributed Systems Fallacies of Distributed Computing	The design-time assumption that a distributed system's addressing and routing graph stays fixed over an interaction's lifetime — dropping the time argument from G(t) — so every cached reference becomes a latent bet that its referent has not moved.
Fallacy of the Reliable Network	Distributed Systems Fallacies of Distributed Computing	The design-time error of programming a best-effort channel whose packet-loss probability is positive as if it were zero — assuming every message is delivered, ordered, and never dropped, reordered, or duplicated.
Fallacy of the Secure Network	Distributed Systems Fallacies of Distributed Computing	The mistake of deriving trust in a distributed system from network position — inside the VPN, behind the firewall — rather than from cryptographic verification, treating a known routing path as if it were a verified identity.
Fallacy of Zero Latency	Distributed Systems Fallacies of Distributed Computing	The design-time assumption that a remote call returns as fast as a local one, dropping the per-hop round-trip term L from the cost function, so that an operation making n network calls is budgeted as free when it actually costs at least n·L and compounds under sequential fan-out.
Fallacy of Zero Transport Cost	Distributed Systems Fallacies of Distributed Computing	Reject the design-time assumption that moving data between nodes is free by restoring the per-byte cost term to the cost function, so payload volume becomes an explicit design variable budgeted alongside latency.
False sharing	Cache Coherence Performance Pathologies	Diagnose performance loss when independent data accessed by different processors occupy one coherence block, so writes trigger invalidation, transfer, and reload traffic as though the data were logically shared.
Fast Reroute	Computer NetworkingMPLS	Fast Reroute is a MPLS (Multiprotocol Label Switching) and IP resiliency technology to provide fast traffic recovery upon link or router failures for mission critical services.
Feature Creep	Software Product Design	Explain why a product accretes capabilities past net benefit as a governance failure, not a quality one — an approval gate that judges each addition in isolation against its stated cost while structurally blind to the compounding global cost of all additions together.
Feature Envy	Software Maintainability	Flag a method whose cross-class field and method accesses to another class outnumber accesses to its own, signalling that the behavior lives at the wrong address and should be relocated to the class whose data it operates on.
Feature scaling	Information TechnologyData Science and Machine Learning	The preprocessing step that rescales numerical inputs to a common range so no variable's unit of measurement silently dominates a scale-sensitive method — making the choice of weighting an explicit analytical commitment rather than an accident of source units.
Feature-Driven Development	Software Development Methodology	An iterative software-development method that builds an overall domain model and feature list, then plans, designs, inspects, builds, and integrates small client-valued features in short cycles.
Federated Identity	Identity and Access Management	Let a service recognize a subject through an identity-provider assertion accepted under governed trust.
Feedforward neural network	Machine Learning	An artificial neural network whose within-evaluation signals move from input to output through an acyclic directed graph.
Feigenbaum test	Artificial IntelligenceExpert Systems	A proposed domain-specific variation of the Turing test in which a computer's performance is judged by whether it can reproduce the behavior or output of a recognized human subject-matter expert.
File Association	Desktop Operating SystemsApplication Dispatch	A desktop rule that resolves a file’s recognized type to its current capable default application when the file is opened.
File Comparison	File ToolsDocument Processing	A pairwise operation that detects and reports differences between two file or document states under a declared comparison basis.
File Format	Data RepresentationSoftware Interoperability	A convention mapping logical information structures to an identifiable organization of bits, bytes, characters, records, chunks, or markup so conforming implementations can store and recover the intended content.
File system	Operating Systems	A file system is a capability of an operating system that services the applications running on the same computer.
Filter bubble	Information TechnologyRecommender Systems and Information Environments	The algorithmic narrowing of a user's information exposure when a recommender optimizes for short-term engagement on revealed preference — a self-reinforcing feedback loop that no user chose and no user effort can dissolve, correctable only in the ranking pipeline.
Fine-Tuning (Deep Learning)	Machine Learning	Adapt a pretrained neural network to a downstream task by continuing optimization on target data over all parameters or a deliberately selected trainable subset.
Finite Thickness	Formal Language Learning	A formal-language class has finite thickness when each word belongs to only finitely many distinct languages in that class.
Firefly (cache coherence protocol)	Computer Architecture	A three-state write-update cache-coherence protocol that keeps shared cache copies and main memory current on broadcast writes.
Fisher Kernel	Statistical Machine LearningKernel Methods	A model-based similarity equal to the Fisher-information-normalized inner product of two observations' log-likelihood gradients under a common fitted generative model.
Fitness-Proportionate Selection	Evolutionary ComputationGenetic Algorithms	A stochastic evolutionary-selection rule that samples individuals with probability proportional to a declared nonnegative fitness weight, giving fitter candidates more expected offspring without guaranteeing their survival.
Fixed-point computation	Computational ComplexityFixed Point Search	A represented search task asks for a point fixed by a declared self-map, or for a point meeting a stated residual or distance criterion, under an explicit input model and solution promise.
Fixed-precision arithmetic	Computer Arithmetic	Arithmetic performed in a numeric format with a fixed finite number of digits or bits, requiring rounding, overflow and exceptional-value rules.
Fixed-Priority Pre-emptive Scheduling	Operating SystemsReal Time Scheduling	A processor-scheduling policy that runs the highest-priority ready task under stable priority ranks and pre-empts lower-priority work when a higher-priority task becomes ready.
Flat memory model	Computer ArchitectureMemory Addressing Models	Expose storage to software as one linearly ordered address space in which an address selects a location without a constitutive segment or bank selector, while allowing paging, protection, caching, or physical translation beneath that programmer-visible contract.
Flow control (data)	Computer NetworkingData Communications	In data communications, flow control is the process of managing the rate of data transmission between two nodes to prevent a fast sender from overwhelming a slow receiver.
Floyd's Cycle-Finding Algorithm	AlgorithmsData Structures	A constant-extra-space method that advances two references at one and two steps along the same successor chain to detect a reachable cycle.
FLP Impossibility	Distributed Systems	Prove that no deterministic algorithm can guarantee both agreement and termination for consensus in an asynchronous system with even one crash-fault — by showing an adversarial message schedule can keep the system perpetually undecided.
FNP (complexity)	Computational Complexity	The class of polynomially balanced search relations whose proposed solutions can be verified in deterministic polynomial time.
Force-Directed Graph Drawing	Graph DrawingInformation Visualization	Placing graph vertices by iteratively relaxing an artificial force or energy model derived from graph relationships.
Forcing (computability)	Computability Theory	A forcing-style construction of generic computability-theoretic objects by meeting effective dense requirements.
Foreign function interface	Programming LanguagesLanguage Interoperability	A foreign function interface (FFI) is a mechanism by which a program written in one programming language can call interoperable routines or make use of services written or compiled in another one.
Foreign key	Relational Databases	A foreign key is a set of attributes in a table that refers to the primary key of another table, linking these two tables.
Fork bomb	Computer SecurityResource Exhaustion	A denial-of-service failure pattern in which a process recursively creates new processes until process-table, memory or scheduling resources are exhausted.
Fork–Join Model	Parallel Programming	A parallel-control model that exposes child work at a fork and requires its completion at a matching join before dependent continuation.
Formal Grammar	Formal Language TheoryAutomata Theory	A mathematically specified rule or constraint system over declared symbols that generates or characterizes the well-formed strings or structures of a formal language.
Formal Language	Formal Language Theory	Treat a precisely delimited set of finite strings over an alphabet as an object independent of any one grammar, recognizer, or interpretation.
Formal Syntax	Formal LanguagesParsing	A formal syntax is a finite or recursively specified system of symbols, lexical classes, formation and combination rules, delimiters, precedence, scope, and parse conventions that determines which expressions in a formal or programming language are well formed and how their structural organization is recovered.
Formal Verification	Formal Methods	Establish with the rigor of a theorem that an engineered artifact satisfies a precisely stated specification by producing a machine-checkable proof that holds over every input in scope at once, rather than sampling behavior on tested inputs the way testing does.
Format Relation	Information TechnologyResource Description	Bind a resource to the encoding it is materialized in as an explicit, queryable metadata field drawn from a controlled registry, so rendering, routing, and preservation read off the recorded format rather than re-parsing the bytes.
Formula Game	Theoretical Computer ScienceComputational Complexity	Evaluate a closed quantified Boolean formula as a perfect-information contest in which Existential and Universal assign their variables in prefix order and truth is equivalent to Existential having a winning strategy.
Forward chaining	Artificial IntelligenceRule Based Systems	Forward chaining (or forward reasoning) is one of the two main methods of reasoning when using an inference engine and can be described logically as repeated application of modus ponens.
Forward declaration	Programming LanguagesDeclaration and Linkage	A declaration that introduces an identifier and enough type information for earlier use while postponing the entity's complete definition until later compilation context.
Forward–Backward Algorithm	—	Two dynamic-programming passes combine past-observation and future-observation likelihood messages to compute every hidden-state smoothing marginal in a chain model.
FOSD program cubes	Software Product LinesFeature Oriented Development	An n-dimensional feature-oriented representation whose axes encode independent variability dimensions and whose cells or transformations compose into members of a software product line.
Fourth Normal Form	Database Theory	A relational schema is in 4NF when every nontrivial multivalued dependency that holds on it has a superkey as its determinant.
FPT (complexity class)	Parameterized ComplexityComputational Complexity	A parameterized problem that allows for such an FPT algorithm is said to be a fixed-parameter tractable problem and belongs to the class , and the early name of the theory of parameterized complexity was fixed-parameter tractability.
Fractal transform	Image ProcessingFractal Compression	A lossy image-compression transform that represents image blocks by contractive affine mappings from other image regions, exploiting approximate self-similarity.
Fragmentation (computing)	Memory AllocationFile Systems	A computing-storage layout mismatch in which allocation leaves unusable slack inside units, disperses free capacity below a request's contiguity need, or scatters one file across nonadjacent extents.
Frame (Artificial intelligence)	—	Frames are an artificial intelligence data structure used to divide knowledge into substructures by representing "stereotyped situations".
Fredkin gate	Reversible Computing	A reversible three-bit controlled-swap gate that preserves the control bit and swaps the other two bits exactly when the control is active.
Free-block Coalescing	Memory AllocationOperating Systems	An allocator operation that combines adjacent eligible free memory blocks into one larger free extent under a declared merge rule.
Frequency analysis	Cryptanalysis	Cryptanalysis that exploits nonuniform symbol or pattern frequencies in ciphertext to infer a substitution or other weak classical encoding.
Friend-to-friend	Peer to Peer NetworksComputer Networking	A friend-to-friend (F2F) computer network is a type of peer-to-peer network in which users only make direct connections with people they know.
Fully polynomial-time approximation scheme	Computational Complexity	An approximation scheme whose running time is polynomial both in input size and in the reciprocal of the requested error tolerance.
Funarg problem	Programming LanguagesClosures and Runtime Environments	Resolve how a first-class nested function can retain or access lexically scoped nonlocal variables when its invocation outlives or occurs outside the defining stack frame.
Function call	Programming LanguagesSubroutines	In computer programming, a function (also procedure, method, subroutine, routine, or subprogram) is a callable unit of software logic that has a well-formed interface and behavior and can be invoked multiple times.
Function point	Software Measurement	A standardized unit estimating software functional size from user-visible inputs, outputs, inquiries, data groups and interfaces.
Function-Level Programming	Programming Language Semantics	Build programs from whole programs through a closed vocabulary of program-forming operations, so program construction becomes an algebra over functions rather than a value-level expression with variables.
Functional Design	Software DesignModular Design	A modular design discipline that assigns each component one coherent responsibility while minimizing its side effects and coupling to other components.
Functional Programming	Computer Science	A programming style that organizes computation around function application and composition, often emphasizing immutable data and explicit effects.
Functional reactive programming	Functional ProgrammingReactive Programming	Functional reactive programming (FRP) is a programming paradigm for reactive programming (asynchronous dataflow programming) using the building blocks of functional programming (e.g., map, reduce, filter).
Fuzzy rule	Fuzzy Rule Based Inference	Represent a graded IF-THEN relation whose linguistic antecedents and consequent are fuzzy sets, then compute a consequent degree or fuzzy output through declared connective, implication, aggregation, and output conventions.
Game complexity	Combinatorial Game TheoryComputational Complexity	The state-space complexity of a game is the number of legal game positions reachable from the initial position of the game.
Gating Mechanism (neural networks)	Machine LearningNeural Network Architecture	A neural network computes learned, input-dependent control values that modulate which signals or computational paths contribute downstream.
Gaussian Naive Bayes	Machine LearningProbabilistic Classifiers	A naive Bayes classifier for continuous features that models each feature’s class-conditional distribution as Gaussian and combines their likelihoods under conditional independence.
General recursive function	Computability Theory	A partial natural-number function generated from initial functions by composition, primitive recursion and unbounded minimization.
General-Purpose Modeling	Model Driven Engineering	Represent multiple kinds of system structure and behavior through a reusable modeling language whose metamodel is intentionally broader than any one application domain.
Generalized Büchi Automaton	Omega AutomataAutomata TheoryFormal Verification	An ω-automaton with a family of accepting state sets, accepting an infinite run only when every set in the family is visited infinitely often.
Generalized context-free grammar	Formal Language Theory	A grammar formalism extending context-free rewriting with composition functions capable of combining discontinuous or otherwise non-context-free structures.
Generalized Game	Computational ComplexityCombinatorial Games	In computational complexity theory, a generalized game is a game or puzzle that has been generalized so that it can be played on a board or grid of any size.
Generalized multidimensional scaling	Shape AnalysisComputer VisionMultidimensional Scaling	Generalized multidimensional scaling (GMDS) is an extension of metric multidimensional scaling, in which the target space is non-Euclidean.
Generative adversarial network	Machine Learning	A generative-learning framework in which a generator and discriminator are trained in opposition so generated samples approach a data distribution.
Geocoding	Geographic Information SystemsSpatial Data	Resolving a textual address or place description against geographic reference data to return a mapped location with its granularity.
Gestalt pattern matching	String Algorithms	A recursive string-similarity algorithm that anchors on a longest common substring and repeats on the unmatched left and right regions.
GI (complexity)	Computational ComplexityGraph Isomorphism	GI is the complexity class of decision problems having a polynomial-time Turing reduction to the graph isomorphism problem.
GI-complete	Computational ComplexityGraph Isomorphism	A decision problem is GI-complete when it belongs to GI and is GI-hard, so a polynomial-time solution for it and for graph isomorphism would yield polynomial-time solutions for one another.
Global Index Grammar	Formal Language TheoryGrammar Formalisms	A formal grammar class whose derivations share one global index stack under restricted production and stack-changing rules.
Global network positioning	Internet PerformanceNetwork MeasurementNetwork Coordinates	Landmark-based virtual coordinates used to predict Internet round-trip delay.
Goal Modeling	Requirements Engineering	Goal modeling represents intended outcomes and their relations so stakeholders can examine refinements, dependencies, responsibilities, and system alternatives.
God Object Anti-Pattern	Software Architecture Anti Patterns	Diagnose a maintenance mess as concentrated rather than diffuse: one class or service accumulates outlier fan-in and fan-out to become the integration hub, collapsing modularity so all change-cost, comprehension, and new features funnel through that single node.
Golden Hammer Anti-Pattern	Software Architecture Anti Patterns	Diagnose a team applying its familiar technology to a poorly-fitting problem because the acquisition cost of an alternative is visible while the misfit cost is diffuse and downstream, so fluency reshapes what counts as the right tool before fit is ever asked.
GQM+Strategies	Software MeasurementOrganizational Alignment	Link organizational goals and strategies to lower-level goals and measurement plans so evidence can test strategic alignment.
Grammar-oriented programming	Software Language Engineering	A software-development approach that makes a domain grammar the primary executable model for a domain-specific language and its processing architecture.
Granularity Trade-off in Computer Systems	System Design	Choosing the scope of separately handled computer-system units as handling cost pulls against independent use.
Graph canonization	Graph AlgorithmsGraph Isomorphism	The problem of computing a canonical labeled representative shared by every graph in an isomorphism class.
Graph Data Type	Data Structures	The programmatic abstraction representing entities as nodes and relationships as edges behind a traversal/mutation/query interface — insulating algorithm code from the in-memory layout so representation becomes a profiling-driven swap, not a rewrite.
Graph neural network	Machine LearningGeometric Deep Learning	A neural-network family that learns node, edge or whole-graph representations by repeatedly aggregating relational information in a permutation-aware graph structure.
Graph reduction	Functional Programming	Evaluation of a functional program by rewriting a shared expression graph so lazy subexpressions are computed at most once.
Graph rewriting	Theoretical Computer Science	Rule-based transformation of a host graph by matching a left-hand pattern and replacing or relinking it according to a right-hand graph.
Graph-Structured Stack	Generalized Parsing	Represent many simultaneously live stack histories as a shared directed acyclic graph whose paths encode stacks, whose frontier nodes are tops, and whose split, merge, and pop operations avoid duplicating common history during nondeterministic parsing.
Graphical Game Theory	Algorithmic Game TheoryMultiagent Systems	A compact representation of a strategic game in which a graph records each player's local payoff dependencies, so a player's utility is specified only over its own action and those of its graph neighbors.
Graphical User Interface	Human Computer Interaction	A visual interaction surface that lets people inspect and control digital functions through graphical elements and feedback.
Gray Code	Combinatorial GenerationDigital Coding	A Gray code orders distinct fixed-width binary words so every required neighboring pair differs in exactly one bit.
Greedy coloring	Graph Algorithms	A sequential graph-coloring algorithm that assigns each vertex the first available color not used by already colored neighbors.
Greenspun's Tenth Rule	Programming Language Design	The aphorism that any sufficiently complicated C or Fortran program contains an ad hoc, bug-ridden implementation of half of Common Lisp — because features a language withholds do not vanish but migrate inside the program as defective re-implementations.
Grzegorczyk hierarchy	Computability TheorySubrecursive Hierarchies	A stratification of primitive-recursive functions into successively stronger classes generated from rapidly growing basis functions and closure operations, calibrating rates of growth and definitional complexity.
Guard (computer science)	Programming LanguagesControl Flow	A Boolean condition that controls whether a branch, transition, command, pattern, or procedure body may execute, including early guard clauses that reject unmet preconditions before the main logic while preserving explicit control-flow and side-effect semantics.
Halstead complexity measures	Software Metrics	A family of static software metrics derived from counts of distinct and total operators and operands.
Halting Problem	Computability Theory	Turing's proof that no general algorithm can decide, for every program-input pair, whether the program halts or loops forever — established by a diagonal argument that builds an adversary doing the opposite of any claimed decider's prediction about itself.
Happened-before	Distributed SystemsLogical Time and Causality	The least strict partial order on distributed events generated by local program order, message send-before-receive, and transitivity, capturing potential causality without assuming synchronized physical clocks.
Hardening (computing)	CybersecuritySystem Security Configuration	Reduce a computing system's exploitable possibilities by removing unnecessary functionality, establishing secure configurations, minimizing privilege and exposure, and maintaining those restrictions against configuration drift.
Harrison–Ruzzo–Ullman Security Model	Computer SecurityAccess Control	An access-control transition model of subjects, objects, rights-valued matrix cells, and guarded commands whose general new-right leakage safety problem is undecidable.
Hartley's Law	Information TechnologyChannel Capacity and Signalling	Fix the maximum information a noiseless bandwidth-limited channel can carry as H = 2WT·log₂(M) — the product of a linear sample-rate factor (bandwidth) and a logarithmic resolution factor (distinguishable signal levels).
Hash Table	Data Structures and Algorithms	Store key-value pairs in a fixed-capacity array by computing each key's index with a hash function, so the address is derived from the content and lookup, insertion, and deletion run in expected-amortised O(1) independent of collection size.
HATEOAS	REST	HATEOAS makes available application transitions discoverable through hypermedia controls in received representations.
HBJ model	Message Passing Cost Models	Estimate a message-passing parallel algorithm's cost by separating maximum per-processor computation from latency-and-bandwidth communication over regular block permutations.
Heap	Data Structures and Algorithms	Keep the single most extreme element instantly readable at the root of a partially ordered tree, so insert and extract cost only O(log n) under continuous churn by declining to maintain any more order than the extreme requires.
Heapsort	Comparison Sorting Algorithms	A comparison sort that builds a heap and repeatedly extracts its extremal element to produce an ordered sequence.
Heartbeat message	Distributed SystemsComputer Networking	A heartbeat message is a periodically emitted liveness signal whose timely receipt indicates that a component, link, or peer is operating, while missed intervals trigger suspicion, timeout, or recovery logic.
Heat Kernel Signature	Shape AnalysisGeometry ProcessingComputer Graphics	A pointwise multiscale shape descriptor obtained by sampling diagonal heat-kernel return values, combining local-to-global intrinsic geometry with isometry invariance.
Heisenbug	Debugging Concurrency	Name the software defect whose failure vanishes under observation because attaching a debugger, adding a print, or disabling optimization perturbs the timing window or interleaving it rides on — so disappearance-under-observation is the diagnostic tell, not evidence the bug is gone.
Held–Karp algorithm	AlgorithmsExact Traveling Salesman Methods	An exact dynamic-programming algorithm for the traveling-salesman problem that stores the cheapest start-to-end path through each subset of cities, reducing tour enumeration to exponential subset recurrence.
Hi/Lo algorithm	Database Systems	A distributed identifier-allocation strategy that reserves a high-value block centrally and generates low values locally within that block.
Hidden algebra	Formal Methods	An algebraic specification framework for stateful and concurrent systems that distinguishes visible data sorts from hidden state sorts and characterizes state by observable behavior.
Hidden layer	Machine Learning	A neural-network layer situated between inputs and outputs whose learned nonlinear transformations construct intermediate representations used by later layers.
Hidden linear function problem	Quantum Complexity	A search problem that asks for a vector satisfying a linear relation hidden by phase data encoded in an explicitly supplied quadratic-form instance.
Hierarchical Radial-Basis-Function Interpolation	Computer GraphicsGeometric Modeling	Interpolate scattered spatial data by recursively partitioning it into overlapping local RBF systems and blending their solutions through a spatial tree.
Hierarchical Storage Management	Storage SystemsData Management	Policy-controlled movement of addressable data among storage tiers with different access and cost characteristics, coupled to a defined retrieval path.
Hierarchical temporal memory	Machine LearningBiologically Inspired AI	Hierarchical temporal memory (HTM) is a biologically constrained machine intelligence technology developed by Numenta.
Higher-Order Message	Programming LanguagesMessage Oriented ProgrammingMetaprogramming	A message-oriented construct that captures a following message as data and interprets it through an outer message to transform iteration, timing, routing, or delivery.
HITS Algorithm	Information RetrievalLink Analysis	A link-analysis algorithm that iteratively assigns each node an authority score from incoming high-hub links and a hub score from outgoing links to high-authority nodes, usually on a query-dependent directed subgraph.
Hoare Logic	Axiomatic Semantics and Program Verification	A compositional program logic that proves precondition–command–postcondition judgments by rules aligned with program constructs, using assertions and invariants to reduce global correctness to local proof obligations.
Holland's Schema Theorem	Evolutionary ComputationGenetic Algorithm Theory	Lower-bound the one-generation expected count of a binary-string schema from relative fitness and variation-survival factors.
Homomorphic Secret Sharing	Cryptography	A secret-sharing primitive in which servers locally evaluate an allowed function on input shares so their output shares reconstruct the function value without revealing the inputs.
Hop-by-hop transport	Computer Networking and Disruption Tolerance	A networking principle in which each intermediate node independently receives, buffers, controls and forwards data to the next hop rather than leaving transport state only at endpoints.
Hunt–Szymanski Algorithm	String Algorithms	A longest-common-subsequence algorithm that orders equal-symbol index pairs and reduces LCS computation to thresholded increasing-subsequence updates with match-sensitive cost.
Hybrid algorithm	AlgorithmsAdaptive Algorithm Design	An algorithmic design that combines two or more methods for the same problem and selects or switches among them to exploit complementary performance regimes.
Hybrid cloud storage	Cloud Computing	A storage architecture coordinating organization-controlled local resources with provider-operated public cloud storage as one governed data tiering system.
Hybrid Kohonen self-organizing map	Machine Learning	A neural architecture coupling a self-organizing map front end to supervised hidden and output layers.
Hyperproperty	Formal Verification	A system specification whose truth depends on the system's whole set of possible execution traces, allowing relations among multiple runs such as noninterference and observational determinism.
Hyrum's Law	API Design and Evolution	With enough users of an interface, every observable behaviour will come to be depended upon by someone regardless of the formal contract, so the cost of changing an observable is set by its dependent count, not its documented status.
IDEF3	Process Modeling	A scenario-driven process-description method that captures activity sequences and object-state transitions from domain experts.
Idempotent Consumer Pattern	Distributed Systems and Messaging	Build a message consumer so that processing the same message any number of times has the same effect as processing it once, by remembering each message's ID in a dedup store and committing the business effect inside the same atomic boundary.
Identity map pattern	Enterprise Software	A unit-of-work cache that guarantees one in-memory object instance per persistent database identity within a declared context.
Identity transform	Data ProcessingTransformation Patterns	A data transformation that reproduces every input unchanged, serving as a neutral pipeline stage and as a recursively extensible base template in transformation languages.
Image color transfer	Computer Vision	A mapping that transforms a source image’s color or tone distribution to resemble that of a target image while aiming to preserve source content.
Image rectification	Computer Vision	A geometric transformation that maps images into a common plane so corresponding scene points align along simplified search loci.
Image-Based Flow Visualization	Scientific VisualizationFlow Visualization	In scientific visualization, image-based flow visualization (or visualisation) is a computer modelling technique developed by Jarke van Wijk to visualize two dimensional flows of liquids such as water and air, like the wind movement of a tornado.
Image-Processing Method	Image ProcessingComputational Imaging	An image-processing method is a reproducible computational procedure that maps one or more sampled image representations and declared calibration or acquisition metadata to transformed imagery, extracted features, measurements, segmentation, reconstruction, compression, or visualization under specified objectives, parameters, and error criteria.
Implicit Authentication	Mobile SecurityUsable Security	Verifying a user from ordinary interaction signals without demanding an explicit credential at every check.
In Silico Experimentation	Computational ScienceModeling and Simulation	Experimentation conducted within a computer model or simulation, where virtual interventions and observations probe a represented biological, physical, or social system rather than directly manipulating material specimens.
In-database processing	Database Systems	Analytic computation executed inside the database where its data is managed.
In-Place Adjacent-Block Rotation	Sequence Algorithms	Reorder adjacent sequence blocks AB as BA with each block's internal order preserved and only constant auxiliary storage.
In-Place Algorithm	Space Efficient Algorithms	An algorithm that replaces its designated input with the result while using only a constant number of auxiliary units under a stated memory model.
Inception Module Architecture	Deep LearningConvolutional Neural Networks	A convolutional-network module that transforms one feature map through parallel aligned branches at different receptive-field scales and concatenates their outputs along the channel axis.
Increment and decrement operators	Programming Languages	Unary programming operators that increase or decrease a mutable operand by one, with prefix and postfix forms differing in the value yielded by the expression.
Incremental Backup	Data Backup	A recoverable backup point captures changed data since a prior protected state while retaining the bases and references needed to reconstruct the whole.
Index set (computability)	Computability Theory	A set of program indices whose membership depends only on the partial computable function or computably enumerable set denoted by the index, not on the particular code chosen.
IndieWeb	Web DevelopmentDecentralized Web	The IndieWeb refers to the usage of decentralized, independently-hosted websites and personal web pages as the main form of connecting on and publishing material on the Internet, in contrast to social media.
Induction of regular languages	Grammatical Inference and Computational Learning	The learning problem of inferring a finite automaton, regular grammar, or regular expression from labeled or otherwise informative example strings under a declared identification criterion.
Inferential Theory of Learning	Machine Learning	Model an agent's learning as goal-guided search through knowledge states by selecting and composing deductive, inductive, abductive, analogical, abstraction, and other inference operators under task-specific applicability conditions.
Infinite Scrolling	Human Computer InteractionWeb Interface Design	An interface pattern that extends a content collection as people traverse one scrollable surface, without requiring a next-page action.
Information exchange	Data InterchangeInteroperability	The transfer of encoded information from one person, organization, or technical entity to another through an agreed channel, format, and interpretation context.
Information Flow (Information-Flow Security)	Information Flow Security	Track whether observations in one security domain can depend on information from another, enforcing a policy over explicit, implicit, and indirect program channels rather than only access to stored objects.
Information Gain for Decision-Tree Splits	Decision Tree Induction	A greedy decision-tree split rule choosing the attribute with the greatest expected reduction in class entropy at each node.
Information model	Information Systems	A formal representation of the entity kinds, relationships, constraints, rules and operations that give data shared semantics within a chosen domain of discourse.
Information-Scent Failure	Human Computer Interaction	Diagnose a navigation failure as the surface cues a user reads before clicking — link text, labels, snippets — failing to predict the destination's content, so the user invests a click on a wrong prediction and backtracks, hunts, or abandons.
Infrastructure as a service	Cloud Computing	A cloud service model in which a provider supplies API-controlled compute, storage, networking, virtualization, and physical facilities on demand while the customer manages operating systems, deployed software, data, identities, and configuration under a shared-responsibility boundary.
Injection Weakness	Software Security and Attack Surfaces	The software-security failure in which untrusted data crosses into a control channel and a downstream interpreter executes it as command, query, or instruction — a collapse of the data/control boundary that a legitimate, often credential-free, input channel is enough to exploit.
Inner loop	Program Structure and Performance	A loop nested inside another loop whose full execution is initiated during each applicable iteration of the enclosing loop.
Inner-Platform Effect	Software Architecture Anti Patterns	A system built on top of another tends to re-implement the host's facilities inside itself, badly, because the embedded sub-system's customisation surface is narrower than the host's while the requirements arriving at it are not bounded by that narrowness.
Input Manipulation Attack	AI Security and Adversarial Machine Learning	Recognize an adversary crafting inputs to a fixed decision system so it produces a preferred output, by taking as the unit of analysis the gap between the input manifold the system was specified against and the manifold the attacker can construct.
Insecure Deserialization	Application Security	Recognize the weakness where a runtime reconstitutes an untrusted serialised byte stream into behaviour-bearing objects because the parser's own semantics execute code during the parse — safe only if the parser's power sits strictly below the runtime it feeds.
Instant messaging	Computer NetworkingCommunication Software	Synchronous or near-real-time networked communication in which identified users exchange text and often presence, multimedia, files, voice, or video through persistent applications or services.
Instruction pipelining	Computer ArchitectureInstruction Level Parallelism	A processor implementation that divides instruction execution into stages and overlaps different instructions across those stages to increase throughput without requiring each instruction to finish before the next begins.
Instruction Set Architecture	Computer ArchitectureProcessor Architecture	The programmer-visible processor contract specifying machine instructions, architectural state, data types, addressing, memory behavior, and execution semantics independently of a particular microarchitecture.
Instruction-level parallelism	Computer Architecture	The degree to which independent machine instructions from one execution stream can overlap or execute simultaneously.
Integer Overflow	Software Reliability and Numerical Computing	The failure mode where an arithmetic result exceeds a fixed-width integer field's range and the runtime silently writes back a wrapped value with no trap or flag — so downstream code trusts a number that is no longer what the computation demanded.
Inter-process communication	Operating Systems	Operating-system and network mechanisms that let separate processes exchange data, synchronize actions or invoke services while preserving process isolation.
Interaction Nets	Theoretical Computer ScienceGraph Rewriting and Models of Computation	Compute by replacing principal-port-connected pairs of fixed-arity graph agents with interface-preserving local nets under a one-rule-per-agent-pair discipline, so distinct redexes are disjoint and reductions are strongly confluent by construction.
Interactive proof system	Computational ComplexityInteractive Proofs	A protocol in which a computationally unbounded but untrusted prover exchanges messages with a resource-bounded randomized verifier to establish language membership with completeness and soundness guarantees.
Interactive-Predictive Correction	Prefix Based Structured PredictionHuman Machine Collaboration	Iteratively validate a model's correct output prefix, correct the next error, and regenerate the remaining sequence under that prefix constraint.
Interface (computing)	ComputingComponent Interfaces	A specified shared boundary through which hardware, software or human components exchange information and invoke services while hiding internal implementation.
Interface segregation principle	Object Oriented Design	The SOLID rule that clients should not depend on interface methods they do not use — decompose a fat interface into role-specific ones sized to each consumer's usage footprint, so a contract change's blast radius is read off the boundary rather than the call graph.
Interface transparency (computing)	Software InterfacesDistributed Systems	A computing property in which changed or mediated internals preserve a familiar external interface for clients within stated limits.
Interface-Based Programming	Software ArchitectureObject Oriented Design	A component architecture in which clients depend on abstract interfaces, obtain implementations through factories or registries, and avoid direct cross-component use of concrete classes so implementations can be substituted behind stable contracts.
Intermediate representation	Compiler ConstructionIntermediate Languages and Data Structures	Represent a program inside a compiler or virtual machine in a typed form designed for analysis, optimization, transformation, and translation between source and target languages.
Internationalization–Localization Interface	Software GlobalizationUser Interface Architecture	Separates shared software behavior from locale-specific resources and choices through a defined lookup or formatting interface.
Internet Blocking	Computer NetworkingInternet Blocking and Censorship	An Internet intervention that prevents a selected user, endpoint, route, protocol, domain, or content object from reaching or acting on a network resource within a declared scope and duration.
Internet Bot	ComputingInternet Software	A persistent software actor that executes a delegated task policy through Internet-facing identities and client interfaces, converting repeated human interactions into a stateful, scalable observe-select-act loop.
Internet Mix	Network Equipment BenchmarkingComputer Networking	A repeatable mixture of packet sizes used to benchmark routers, switches, firewalls, and related equipment under representative traffic load.
Internet Protocol Suite	Computer Networking	Organize interoperable packet-network communication into link, internet, transport, and application layers centered on IP internetworking and endpoint protocols such as TCP and UDP.
Internet socket	Computer NetworkingOperating Systems	Because of the standardization of the TCP/IP protocols in the development of the Internet, the term network socket is most commonly used in the context of the Internet protocol suite, and is therefore often also referred to as Internet socket.
Interpreter	Programming Languages	Execute a program directly from its source or intermediate form by looping fetch-decode-act over one unit at a time against maintained runtime state, producing no standalone binary — so the engine must be present at every run and pays a per-instruction dispatch cost.
Intersection Non-Emptiness Problem	Automata TheoryComputational Complexity	The decision problem asking whether a finite list of deterministic finite automata accepts at least one common string, a PSPACE-complete problem when the number of automata is part of the input.
Intrusion tolerance	Computer SecurityFault Tolerance	Intrusion tolerance is a fault-tolerant design approach to defending information systems against malicious attacks.
Inverted index	Information Retrieval	An information-retrieval index mapping each content term or feature to the documents and positions in which it occurs.
Inverter Logic Gate	Digital Logic	A one-input logic gate whose Boolean output is the complement of its input.
IP Addressing	Computer Networking	The Internet Protocol scheme that assigns IPv4 or IPv6 addresses to network interfaces and divides address bits into routing prefixes and interface portions so packets can identify endpoints and be forwarded across interconnected networks.
Island grammar	Program AnalysisPartial Parsing	A partial parsing grammar that recognizes selected constructs of interest as islands while treating the surrounding unmodeled text as permissive water.
Isolation lemma	Theoretical Computer ScienceRandomized Algorithms and Combinatorics	Assign independent random weights to elements of a finite set system so that, with a controlled positive probability, a nonempty family has a unique minimum-weight member.
Iteratee	Functional ProgrammingStream IO	A resumable stream consumer that processes externally supplied input chunks and returns a result or a continuation requesting more input.
Jailbreak Adaptation	AI Security and Alignment	The dynamic in which a distributed community collectively probes a deployed AI system's policy boundary, turns each bypass into a shared public good, and so out-iterates the deployer's update cycle — making the contest a rate race no single patch can win.
Join-pattern	Concurrent Programming	A concurrency construct that atomically fires a reaction when a declared combination of asynchronous messages is simultaneously available on several channels.
K-d Tree	Associative RetrievalSpatial Data Structures	A k-d tree organizes multidimensional records by recursive binary splits on coordinate keys, enabling bounded-region search and pruning.
K-means clustering	Unsupervised Machine Learning	An optimization method that partitions vectors into k groups by assigning each observation to its nearest centroid and minimizing total within-cluster squared Euclidean distance.
Kahn Process Networks	Concurrent Models of Computation	An untimed computation network of deterministic sequential processes connected by conceptually unbounded FIFO streams, where blocking reads and nonblocking writes yield a least-fixed-point output independent of execution schedule.
Kerckhoffs's principle	Cryptography	Design a cryptosystem to stay secure even when the entire algorithm is public, confining secrecy to the key alone — because a leaked key is cheaply rotated while a leaked algorithm cannot be replaced without rebuilding the whole system.
Kernel principal component analysis	Machine Learning	Nonlinear dimensionality reduction obtained by performing PCA in an implicit reproducing-kernel feature space.
Key Escrow	Cryptographic GovernanceExceptional Access and Cryptographic Key Recovery	A cryptographic access-control arrangement that prepositions decryption key material with one or more custodians for release or reconstruction only under a specified recovery authorization.
Keyboard Trap	Human Computer Interaction and Accessibility	The accessibility failure where a keyboard-only user moves focus into a UI element that receives focus but never yields it — an absorbing state in the focus-navigation graph, invisible to mouse users because a click supplies the exit edge they lack.
Keyspace (distributed data store)	Distributed Data StoresNosql Databases	The keyspace is the highest abstraction in a distributed data store.
Key–Value Database	Databases	A persistent data store organizes records as values addressed by unique keys, making key-based access its primary contract while allowing richer implementation features.
Kind (Type Theory)	Type TheoryProgramming Language Theory	A type-level classifier that governs which types and type constructors can be formed or applied.
Kneser–Ney Smoothing	Statistical Language ModelingN Gram Models	An n-gram probability-estimation method that discounts observed counts and backs off using how widely a word continues distinct contexts, not just its total frequency.
Knowledge acquisition	Knowledge Engineering	The elicitation, extraction and formal encoding of domain knowledge needed to build or maintain a knowledge-based system.
Knowledge graph embedding	Representation LearningKnowledge GraphsMachine Learning	In representation learning, knowledge graph embedding (KGE), also called knowledge representation learning (KRL), or multi-relation learning, is a machine learning task of learning a low-dimensional representation of a knowledge graph's entities and relations while preserving their semantic meaning.
Knowledge integration	Knowledge RepresentationData Integration	Knowledge integration is the process of synthesizing multiple knowledge models (or representations) into a common model (representation).
Knowledge representation and reasoning	Artificial Intelligence	The AI discipline of encoding knowledge in formal structures whose semantics and inference procedures support machine reasoning about a domain.
Koomey's law	Information TechnologyComputing Hardware	The empirical trajectory by which computations delivered per joule dissipated have doubled about every 1.57 years (slowing to ~2.6 after Dennard scaling broke in 2005), tracking the energy cost of a logical operation toward the Landauer floor.
Kranzberg's first law	Information TechnologyHistory of Technology	Technology is neither good nor bad, nor is it neutral: an artifact's valence is not fixed by its properties, but neither is it zero, because by reshaping what is cheap, easy, or possible it takes a context-indexed position even when no actor intends it to.
Kuroda normal form	Formal Language Theory	A restricted production-rule form for noncontracting grammars that characterizes context-sensitive languages apart from the empty-string convention.
L-Attributed Grammar	Compiler TheoryAttribute Grammars	Constrain inherited attributes to parent context and earlier siblings so parse-tree attributes can be evaluated left to right.
L-Reduction	Theoretical Computer ScienceApproximation Complexity	Transfer approximation guarantees and hardness between optimization problems through polynomial instance and solution maps whose two fixed-constant inequalities control optimum scale and solution-error distortion.
L-system	Formal Languages	A parallel formal rewriting system that repeatedly replaces every symbol according to production rules, often interpreting resulting strings as branching geometry.
L4S	Computer Networking	A coupled Internet congestion-control architecture that combines scalable endpoint response, immediate fine-grained ECN marking, and latency-isolating queue treatment so high utilization need not require a persistently deep bottleneck queue.
Lambda lifting	Compiler Construction	A semantics-preserving program transformation that removes local free variables by parameterization and promotes nested functions to a broader or global scope.
Language-based System	Operating SystemsSoftware Protection	An operating-system protection architecture using checked safe code, runtime-enforced component boundaries and controlled interactions.
Large width limits of neural networks	Theoretical Machine Learning	Asymptotic regimes in which neural-network layer widths tend to infinity and random networks converge to analytically tractable Gaussian-process, kernel, mean-field, or feature-learning descriptions.
Latent Dirichlet Allocation	Probabilistic Topic Models	A finite generative model gives each group Dirichlet-distributed mixture weights and each discrete item a latent component drawn from those weights.
Latent semantic analysis	Natural Language Processing and Information Retrieval	A distributional-semantic technique that applies truncated singular-value decomposition to a term–document matrix so terms and documents are represented in a shared lower-dimensional latent space.
Lava Flow (Anti-Pattern)	Code Quality and Maintainability	Explain why obsolete or unused code hardens into a codebase when uncertain dependencies and inadequate verification make deletion seem riskier than indefinite retention.
Layered Queueing Network	Computer System PerformanceLayered Queueing ModelsSoftware Performance Engineering	A queueing model for nested services in which callers may wait for lower-layer requests, causing one node's effective service time to depend on another queueing subsystem's response time.
Lazy Class	Code Quality and Maintainability	The code smell in which a class (or function, module, package) carries too little responsibility to justify the overhead it imposes — the defect living in the economy, not the behaviour, so a correct, clearly-named boundary can still be flagged when its carried value fails to clear its enumerable tax.
Lazy learning	Machine Learning	A machine-learning strategy that postpones generalization from stored training examples until a prediction query arrives.
Least-squares support vector machine	Machine LearningKernel Methods	Least-squares support-vector machines (LS-SVM) for statistics and in statistical modeling, are least-squares versions of support-vector machines (SVM), which are a set of related supervised learning methods that analyze data and recognize patterns, and which are used for classification and regression analysis.
Left Recursion	Theoretical Computer ScienceFormal Grammar and Parsing	A grammar nonterminal can derive itself again as the leftmost symbol before consuming input, a useful associativity idiom that naive top-down parsers cannot terminate on without transformation or special handling.
Leftist grammar	Formal Languages	In formal language theory, a leftist grammar is a formal grammar on which certain restrictions are made on the left and right sides of the grammar's productions.
Legendre moment	Image Processing	An image descriptor obtained by projecting image intensity onto a two-dimensional orthogonal Legendre-polynomial basis.
Lehman's law of conservation of familiarity	Information TechnologySoftware Engineering	Hold the mean change shipped per release of a long-lived software system roughly constant, because the producer and consumer communities have a bounded capacity to absorb novelty, and overdrawing it forces a corrective contraction.
Lehman's law of conservation of organizational stability	Information TechnologySoftware Engineering	Observe that a long-lived software organization's long-run work rate returns to a band set by structural parameters no matter how you push the local dials — staffing, hours, pressure — so durable throughput gains require restructuring, not loading.
Lehman's law of continuing change	Information TechnologySoftware Engineering	The empirical software-evolution law that an E-type system — one embedded in a moving real-world environment — must be continually adapted or it progressively becomes less satisfactory, because its fitness is relational (the gap between what the code does and what the world now requires) and that gap widens monotonically while the code stands still.
Lehman's law of continuing growth	Information TechnologySoftware Engineering	State that a long-lived software system must continually expand its functional content to retain users, because satisfaction is judged against a rising competitive reference point — adaptation alone holds fitness constant while rivals grow past it.
Lehman's law of declining quality	Information TechnologySoftware Engineering	Read software quality as the system's fit to its present environment rather than its intrinsic defect count, so an unchanged, bug-free release still degrades in the field as the surrounding world drifts away from the conditions it was built for.
Lehman's law of increasing complexity	Information TechnologySoftware Engineering	Observe that the structural, behavioral, and conceptual complexity of an evolving software system rises monotonically under unmanaged change — an entropy-positive default that only deliberate, non-feature restructuring can bend back down.
Lehman's law of self regulation	Information TechnologySoftware Engineering	Treat a long-lived software project as a closed feedback loop that self-regulates around an operating point, so single-node pushes are absorbed and only structural changes to the loop durably relocate its release-size, cadence, and defect-density distributions.
Lempel–Ziv Adaptive Dictionary Coding	Lossless Compression	A lossless coding family that reconstructs phrases from decoder-derived history through branch-specific references and extensions.
Lempel–Ziv–Welch	Lossless Compression	An adaptive lossless dictionary coder whose encoder and decoder synchronously add encountered strings while exchanging only dictionary codes.
Lernmatrix	Artificial Neural NetworksAssociative Memory	Lernmatrix (German for "learning matrix") is a special type of artificial neural network (ANN) architecture, similar to associative memory, invented around 1960 by Karl Steinbuch, a pioneer in computer science and ANNs.
Let-Polymorphism	Type TheoryProgramming Languages	Type-scheme generalization at let bindings with fresh instantiation at each use in Hindley–Milner systems.
Level ancestor problem	Data Structures	A rooted-tree query problem asking for a node’s ancestor at a specified depth after preprocessing the tree.
Level structure	Graph Algorithms	A graph level structure partitions vertices by their equal shortest-path distance from a selected root, producing ordered distance layers used by traversal and layout algorithms.
Lexical analysis	Compiler DesignLanguage Processing	Lexical analysis transforms a character stream into a sequence of classified tokens by applying lexical rules, resolving token boundaries, and usually discarding or channeling whitespace and comments.
Linear Grammar	Formal LanguagesGrammar ClassesAutomata Theory	A context-free grammar whose productions contain at most one nonterminal on each right-hand side, maintaining one active derivational obligation while emitting terminals around it.
Linear speedup theorem	Computational Complexity	The Turing-machine result that any fixed constant-factor reduction in running time can be obtained by enlarging the tape alphabet, up to lower-order overhead.
Linearizability	Concurrent Objects	Test whether a concurrent object's operation history has a legal sequential explanation that preserves the real-time order of nonoverlapping calls.
Link-state Routing	Computer NetworkingRouting Protocols	Distribute local connectivity state so network nodes can calculate routes from a topology view.
Linus's Law	Information TechnologySoftware Engineering	Given enough eyeballs, all bugs are shallow: defect discovery scales with the size and diversity of the pool of independent inspectors examining code — provided they are skilled, motivated, and actually reading it, not merely granted access.
Liskov Substitution Principle	Information TechnologySoftware Engineering	Certify that a subtype can safely replace its supertype only when it honours the supertype's full contract toward clients — weakening preconditions, strengthening postconditions, preserving invariants — regardless of taxonomy or compilability.
List (computing)	Data StructuresAbstract Data Types	A finite ordered collection whose positions remain distinct even when values repeat, exposed through sequence operations independently of its concrete array or linked representation.
Literate Programming	Programming MethodsSoftware Documentation	Literate programming authors executable code and its human explanation in one reader-ordered source, then derives program and document views.
Live distributed object	Distributed Programming	A running distributed protocol instance presented as one identity-bearing object with encapsulated state, participants and externally observable behavior.
LL Grammar	Theoretical Computer ScienceDeterministic Top Down Parsing	A context-free grammar whose next production in a leftmost derivation is uniquely determined while scanning input left-to-right with a fixed amount of lookahead.
Load-link/store-conditional	Concurrent Computing	An atomic instruction pair that reads a memory location and commits a later store only if the implementation has observed no conflicting update since the linked load.
Locality-sensitive hashing	Algorithms	A randomized indexing method using hash families whose collision probability increases with similarity under a target distance measure.
Locks with ordered sharing	Database Concurrency Control	A family of transaction-concurrency protocols that soften lock conflicts by admitting ordered sharing while preserving a serialization order.
Lockstep (computing)	Fault Tolerant Computing	A fault-tolerance method in which redundant computing channels execute the same state transitions in synchrony so their outputs can be compared for error detection or majority-voted for correction.
Lockstep protocol	Networked Game Protocols	A peer-to-peer multiplayer synchronization protocol that commits participants to concealed actions before revealing them, preventing one client from choosing after seeing another’s same-turn move.
Log shipping	Database Reliability	A warm-standby database strategy that repeatedly backs up transaction logs from a primary and restores them in order on a secondary server.
Logarithmic number system	Computer Arithmetic	A numerical representation encoding a real number by sign and the logarithm of its magnitude.
LOGCFL	Computational Complexity Theory	In computational complexity theory, LOGCFL is the complexity class that contains all decision problems that can be reduced in logarithmic space to a context-free language.
Logic form	Natural Language ProcessingSemantic Representation	A shallow first-order knowledge representation that maps natural-language content into conjoined predicates connected by shared event and entity variables, optionally decorated with word senses.
Logic gate	Digital Logic and Computation	A functional element that maps one or more logical input values to an output value according to a Boolean operation.
Logic Programming	Programming LanguagesComputational Logic	A programming paradigm that expresses relations as logical clauses and obtains answers through inference under a declared semantics and evaluation strategy.
Logico-linguistic modeling	Knowledge Based SystemsKnowledge Engineering	Logico-linguistic modeling is a method for building knowledge-based systems with a learning capability using conceptual models from soft systems methodology, modal predicate logic, and logic programming languages such as Prolog.
Logistic model tree	Machine LearningHybrid Tree and Logistic Classification	Partition predictor space with a decision tree while fitting logistic-regression models through the tree, yielding piecewise probabilistic classification whose local linear logits are induced, inherited, and pruned together.
Long Parameter List	Software Design Code Smells	The code smell in which a function requires many separately-supplied inputs at its call boundary because internal complexity was offloaded onto callers — the defect being not the count but hidden co-variation structure that belongs inside the interface.
Longest Repeated Substring Problem	String Algorithms	Find a longest contiguous factor that occurs at two distinct starts in one sequence, and return that factor.
Lookup Table	Data StructuresComputational Optimization	A prepared, addressable set of associations that returns a stored value or output for a supplied key instead of deriving or selecting it afresh.
Lossy Data Conversion	Data ConversionDigital Preservation	A completed change of data representation drops a distinction present in the source, so the converted result alone cannot recover it.
Lottery ticket hypothesis	Machine LearningNeural Network Pruning	In machine learning, the lottery ticket hypothesis is that artificial neural networks with random weights can contain a subnetwork which (entirely by chance) can be tuned to a similar performance as tuning the whole network.
LR-Attributed Grammar	Compiler ConstructionAttribute Grammars	An attribute grammar whose semantic values, including any inherited values, can be evaluated during LR parsing under a specified compatible method.
Luby transform code	Rateless Erasure Coding	A rateless fountain-code construction using sparse random bipartite combinations and XOR operations to recover source symbols from slightly more encoded symbols than the source count.
Luhn Mod N Algorithm	Check Digit Algorithms	A check-character scheme that maps an ordered alphabet to residues, alternates Luhn transformations by position, and chooses a character completing a modular checksum.
Machine Unlearning	Machine LearningPrivacy Preserving Machine Learning	Machine unlearning is a branch of machine learning focused on removing specific undesired element, such as private data, wrong or manipulated training data, outdated information, copyrighted material, harmful content, dangerous abilities, or misinformation, without needing to rebuild models from the ground up.
Machine-Learning Learning Curve	Machine LearningModel Evaluation and Diagnosis	Compare training and validation performance across increasing data or optimizer progress so curve levels, gaps, and slopes diagnose what is limiting a model and what intervention is likely to help.
Machine-Learning Model	Machine LearningStatistical Learning	A parameterized computational mapping or distribution whose operative state is fitted from data to perform prediction, classification, generation, ranking, or decision support on new cases.
Magic number (programming)	Software EngineeringCode Smells	A literal value embedded in program code whose purpose or provenance is not apparent from its local context, making behavior harder to understand and safely change.
Magic Pushbutton	Software EngineeringGraphical User Interface Anti Patterns	A UI and architecture antipattern that funnels a complex form and many unrelated business rules through one terminal button, causing monolithic logic and delayed feedback.
Majority Logic Decoding	Coding Theory	A decoder reconstructs a code bit or coefficient from redundant estimates when the code keeps correctable errors from overturning their majority.
Mandelbug	Software Reliability	Reclassify a chaotic, irreproducible software defect as deterministic-but-undersampled — triggered by a rare joint configuration of hidden state — so effort shifts from finding the right breakpoint to sampling that joint state until the configuration is caught.
Manifold Regularization	Machine Learning	Add an intrinsic, geometry-sensitive soft penalty to a learning objective so the learned function varies smoothly along relevant structure in the data distribution.
Map Matching	Movement Trajectory AnalysisNetwork Positioning	A geospatial inference method that aligns uncertain movement observations with plausible connected positions and paths in a represented travel network.
MapReduce	Distributed Systems	A distributed-computation model that processes oversized datasets in two stages — a stateless map over each record and a key-scoped associative reduce — so that once the programmer honours that contract, the runtime handles parallelism, fault tolerance, and locality, with the shuffle as the single cost-governing synchronization point.
Markov algorithm	Theoretical Computer ScienceModels of Computation	A deterministic ordered string-rewriting procedure that repeatedly applies the first applicable production, halting when no rule applies or a designated terminal rule fires.
Marshalling (computer science)	Distributed ComputingData Interchange	The transformation of an in-memory object or call's structured state into a representation suitable for storage, transmission or crossing a runtime boundary, often with metadata needed for reconstruction.
Mass Assignment	Web Application Security	The web-application vulnerability in which a request-binding layer writes all client-supplied fields directly to a domain object with no allow-list, letting a caller set server-managed attributes like role or owner_id simply by naming them.
Matrix grammar	Formal Language Theory	A controlled formal grammar whose productions must be applied in prescribed finite sequences called matrices rather than as independent rules.
MAX-3SAT	Computational Complexity	The optimization problem of assigning truth values to maximize the number or weight of satisfied clauses in a Boolean formula with at most three literals per clause.
Maximal set (computability theory)	Computability Theory	A coinfinite computably enumerable set that cannot be enlarged by another computably enumerable set without changing it only finitely or making the enlargement cofinite.
Maximum Inner-Product Search	Information Retrieval	Find a stored vector whose raw inner product with a query vector is maximal.
Maximum subarray problem	Algorithm DesignDynamic Programming	The problem of finding a contiguous interval of a numeric array whose elements have the maximum possible sum.
Maze generation algorithm	AlgorithmsProcedural Generation	An algorithm that constructs a maze by selecting passages in a cell-adjacency graph, usually enforcing connectivity and optionally uniqueness of paths, loops or stylistic constraints.
Mealy machine	Automata Theory	In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs.
Measure (Data Warehouse)	Data Warehousing	A fact-level or calculated quantity in a dimensional model whose value is summarized within dimension contexts under declared grain, unit, and aggregation semantics.
Measuring network throughput	Computer NetworkingNetwork Performance Measurement	The controlled estimation of data delivered over a network path per unit time, with explicit distinctions among link rate, protocol throughput, and application goodput and with transport, latency, endpoint, and test-load limits reported.
Membership Inference Attack	AI Security and Adversarial Machine Learning	Determine whether a specific record was in a model's training set by reading the systematic behavioural gap — lower loss, higher confidence — between the samples it saw and statistically matched samples it did not.
Memory address	Computer ArchitectureMemory Addressing and Translation	Use a fixed-width value within a declared address space to identify an addressable storage unit, with architecture and translation rules determining which physical location a load or store reaches.
Memory Corruption	Memory SafetySystems Security	An effective memory-safety-violating write that actually changes stored program contents beyond a valid access, bounds, ownership, or lifetime constraint.
Memory disambiguation	Computer ArchitectureOut of Order Execution	Memory disambiguation is a set of techniques employed by high-performance out-of-order execution microprocessors that execute memory access instructions (loads and stores) out of program order.
Memory Management	Systems Programming	The policy and machinery by which a running program acquires regions of a finite address space at the point of use and safely releases them once no longer reachable or owned — bridging the gap between logic-driven allocation and reachability-driven reclamation against a memory budget.
Memory Organisation	Computer Architecture	The arrangement of memory banks, word widths, addressing, and buses that governs how computer main memory supplies data and programs to a cache.
Memory paging	Operating SystemsMemory Management	In computer operating systems, memory paging is a memory management scheme that introduces a level of indirection between physical and logical addresses and allows the physical memory used by a program to be non-contiguous.
Memory Rank	Computer Architecture	Group DRAM devices behind one chip-select so they activate together and contribute parallel bit lanes to one logical data-width unit on a memory channel.
Memory refresh	Computer ArchitectureDynamic Memory Retention Maintenance	Periodically sense and restore charge in every dynamic-memory row before leakage crosses the retention margin, preserving stored bits at a recurring availability and energy cost.
Memory-bound function	Computer Performance	A computation whose elapsed time is limited primarily by memory capacity, bandwidth or latency rather than arithmetic throughput.
Merge algorithm	Algorithms and Data Processing	An algorithm that combines multiple already-sorted input sequences into one sorted output while preserving every input element and the declared ordering policy.
Merge Conflict	Version Control	Halt an automatic merge and hand the decision to a human exactly where two branches diverged from their common ancestor on the same region, because a three-way merge over text can rank a one-sided edit but has no syntactic basis to choose between two competing edits whose correctness lives in intent it cannot see.
MERSI protocol	Computer Architecture	A five-state cache-coherence protocol extending MESI with a Recent or Read-Only state to optimize shared cache-line ownership and response behavior in PowerPC G4 systems.
Mesh generation	Computational ScienceDiscretization	The construction of a discrete cell complex approximating a continuous geometric domain for numerical simulation, balancing geometric fidelity, element quality and computational size.
Message Authentication Code	CryptographyMessage Integrity	A secret-key-dependent tag and verification test that binds a specified message to a key-holding group for integrity and origin assurance, without itself supplying secrecy or freshness.
Metadata modeling	Software EngineeringMetamodeling	Metadata modeling is a type of metamodeling used in software engineering and systems engineering for the analysis and construction of models applicable to and useful for some predefined class of problems.
Metamodeling	Software Systems and Modeling Language Engineering	The construction and use of a model whose subject matter is a class of models, specifying their admissible elements, relations, constraints, semantics, and conformance rules.
Method (computer programming)	Object Oriented Programming	A callable procedure associated with a class or object whose dispatch and access to receiver state express that object's behavior.
Method Chaining	Computer ProgrammingObject Oriented Programming	A programming idiom in which each nonterminal method result becomes the receiver of the next method call in one expression.
Method stub	Software Development	A deliberately incomplete method implementation that preserves a callable interface and supplies placeholder behavior until the real implementation exists.
Method-as-Metadata	Information TechnologyResource Description	The cataloging move of recording how a resource was produced or what procedure it employs as a first-class, controlled-vocabulary field — orthogonal to topic, creator, date, and form — so a corpus becomes filterable by technique without reading each item.
Metric interval temporal logic	Model CheckingTemporal Logic	In model checking, the Metric Interval Temporal Logic (MITL) is a fragment of Metric Temporal Logic (MTL).
Metric k-center	Theoretical Computer ScienceApproximation Algorithms	In graph theory, the metric -center problem or vertex k-center problem is a classical combinatorial optimization problem studied in theoretical computer science that is NP-hard.
Metric temporal logic	Formal Verification	A temporal logic whose modalities carry quantitative time intervals, allowing formulas to require that events occur within explicit deadlines or durations.
Metropolis light transport	Physically Based Rendering	A global-illumination rendering method that uses Metropolis-Hastings mutations of complete light-transport paths to concentrate samples on image contributions that are difficult to find independently.
Micro-bursting	Computer NetworkingNetwork Traffic	In particular, micro-bursting is often caused by the use of TCP on such a network.
Micro-thread (multi-core)	Parallel Computing	A software-managed fine-grained threading scheme that overlaps computation with memory or I/O latency on multicore processors.
Miller Columns	Human Computer InteractionHierarchical Navigation	Adjacent lists expose successive levels of a hierarchy, with a selection revealing its children while earlier levels remain in view.
Minimal mappings	Semantic Matching	Semantic mappings from which every correspondence not needed to preserve the intended cross-structure meaning has been removed, reducing ambiguity and redundancy.
Minimum-weight triangulation	Geometric Optimization	A fixed planar point set or polygon is triangulated with noncrossing straight edges so that total Euclidean edge length is least among all admissible triangulations.
Mirror world	Spatial Computing and Digital Representation	A geographically registered digital representation intended to mirror real places, objects, activities, and changes as a navigable information environment.
Mixed Criticality	Embedded SystemsReal Time Systems	Cohosting differently critical computing functions while accounting for interference and preserving their required guarantees.
MK II FPA	Software MetricsFunction Point Analysis	The MK II Method is one of the software sizing methods in functional point group of measurements.
Mobile DevOps	Software EngineeringDevops	Mobile DevOps is a set of practices that applies the principles of DevOps specifically to the development of mobile applications.
Mobile Location Analytics	Location Analytics	Convert privacy-governed observations of mobile-device presence and movement within physical venues into aggregate footfall, path, dwell, repeat-visit, and space-use metrics while preserving uncertainty and identifier limits.
Mobile Virtual Private Network	Computer NetworkingMobility Resilient Virtual Private Networking	A protected logical network session whose authenticated security context and inner addressing persist while its device changes physical links, points of attachment, or outer network locators.
MobileNet	Efficient Deep Learning Architectures	A family of convolutional neural-network architectures designed for efficient vision inference through depthwise-separable convolutions and later mobile-oriented bottleneck, activation, attention, and scaling designs.
Mode collapse	Generative Modeling	A generative-model failure in which the learned output distribution represents too few modes and produces markedly reduced diversity.
Model Checking	Formal Verification	Verify a system by taking a finite-state model plus a temporal-logic property and exhaustively exploring every reachable state to decide whether the property holds universally, returning a concrete counterexample trace on failure.
Model compression	Machine Learning Systems	The reduction of a trained machine-learning model’s storage, memory or computation while preserving an explicitly tolerated level of task performance.
Model elimination	Automated Reasoning	A goal-directed automated theorem-proving calculus that extends resolution with ancestor links and a chain-based proof state.
Model Inversion Attack	AI Security and Adversarial Machine Learning	Recover the content of individual training records by treating a deployed model as a constrained inverse oracle — combining predictions-as-evidence with a prior over the input space to solve for the generating input, so 'the model is not the data' becomes a quantitative claim.
Model Skewing	AI Security and Adversarial Machine Learning	The adversarial AI-security attack in which a stream of individually-unflaggable, region-biased inputs to an online learning loop gradually pulls a model's decision boundary off the deployer's criterion toward one the attacker prefers — capturing a deployment that launched clean.
Model Theft	AI Security and Adversarial Machine Learning	Clone a deployed model's valuable function from its outputs alone by treating it as a high-bandwidth oracle — querying it, harvesting (input, prediction) pairs, and fitting a substitute — so the IP boundary becomes a price set by extraction cost, not a wall.
Model transformation	Model Driven EngineeringSoftware Engineering	A model transformation, in model-driven engineering, is an automated way of modifying and creating platform-specific model from platform-independent ones.
Model-based reasoning	Artificial Intelligence	An inference approach deriving explanations, predictions or diagnoses by combining observations with an explicit declarative model of how a system works.
Model-Driven Engineering	Software Engineering	Make metamodel-conformant models primary engineering artifacts and use explicit transformations to derive, synchronize, analyze, and generate implementation artifacts across abstraction and platform boundaries.
Model-Free Reinforcement Learning	Reinforcement LearningModel Free Methods	Reinforcement learning that improves a policy or value estimate directly from sampled interaction without first learning an explicit transition-and-reward model for planning.
Modular programming	Software Engineering	A programming paradigm that decomposes software into cohesive units with explicit interfaces and limited dependence on one another.
Mogensen–Scott encoding	Functional ProgrammingLambda Calculus	Mogensen–Scott encoding represents constructor data as functions that select a matching handler and expose immediate fields.
Monad Transformer	Functional Programming	A constructor that turns an eligible base monad into a new monad and lawfully lifts base computations into it.
Monochromatic triangle	Graph Coloring and Computational Complexity	The graph decision problem of coloring or partitioning edges with a fixed number of colors so that no triangle has all three edges of one color.
Monotonic Query	Relational QueriesDistributed Querying	A fixed database query preserves every prior answer tuple when its input fact instance grows by inclusion under declared set-valued semantics.
Mooers's law	Information TechnologyInformation Retrieval	The retrieval-system regularity that a system tends not to be used whenever having the information is more troublesome than not having it — adoption governed by the per-query cost-benefit ratio against a substitute, not the content's absolute value.
Moore machine	Automata Theory	A finite-state transducer whose output is determined solely by its current state, while input affects output only indirectly by selecting later states.
Moore's law	Information TechnologySemiconductor Industry	The empirical observation that transistor count per economically optimal integrated circuit doubles roughly every two years — a self-fulfilling industry roadmap that coordinated investment across the semiconductor supply chain so the complementary inputs for each process node arrived together.
Morphological parsing	Natural Language Processing	Analysis of a word into morphemes together with their lexical identities, grammatical features, and combinatorial structure.
Mortality (computability theory)	Computability Theory	The reachability property asking whether some finite composition from a given set of transformations sends the system to a designated zero, empty or dead state.
Motion Compensation	Video Signal ProcessingInter Frame Prediction	Use motion correspondence to map reference-frame visual content into a target video frame, forming aligned content for prediction or temporal processing.
MPLS VPN	Computer NetworkingProvider Provisioned VPN	Deliver logically isolated Layer 2 or Layer 3 private-network services across a shared provider backbone by coupling edge-specific VPN state with MPLS label-switched transport.
Multi-factor authentication	Identity and Access Management	Authentication requiring evidence from at least two independent factor categories such as knowledge, possession, and inherence before granting access.
Multi-stage programming	Programming LanguagesMetaprogramming	Multi-stage programming (MSP) is a variety of metaprogramming in which compilation is divided into a series of intermediate phases, allowing typesafe run-time code generation.
Multi-trials technique	Distributed Algorithms	A distributed symmetry-breaking technique in which each node tests an increasing batch of randomized choices per communication round to reduce round complexity.
Multifit algorithm	Scheduling and Partition Algorithms	An approximation algorithm for identical-machine makespan scheduling that repeatedly runs first-fit-decreasing bin packing while binary-searching a trial capacity.
Multikernel	Operating Systems Architecture	A multikernel operating system treats a multi-core machine as a network of independent cores, as if it were a distributed system.
Multilinear Principal-Component Analysis	Machine Learning	Multilinear Principal-Component Analysis is a recurring machine learning, tensor analysis, signal processing identity in which mode-specific projections reduce M-way arrays while preserving multilinear variance structure.
Multimap	Abstract Data Types	A multimap is an abstract data type that associates one key with zero or more values while preserving key-based insertion, lookup, removal, and iteration semantics beyond an ordinary one-value map.
Multiple buffering	Computer SystemsBuffer Management	A producer-consumer technique using two or more buffers so rendering, transfer or processing can proceed concurrently with display or consumption of previously completed data.
Multiple instance learning	Machine Learning	A supervised-learning setting in which labels attach to bags of instances while instance-level labels are absent or only indirectly constrained.
Multiply–accumulate operation	Computer Arithmetic	A computational recurrence that multiplies two operands and adds the product into a running accumulator, with numeric behavior determined by precision, rounding, overflow, and update semantics.
Multiset Abstract Data Type	Abstract Data Types	In computer science, a set is an abstract data type that can store distinct values, without any particular order.
Multisite Cloud	Distributed Cloud Computing	Expose multiple distinct cloud sites as one schedulable environment while preserving site identity so placement, data movement, policy, latency, and failure-domain tradeoffs remain explicit.
Mutual recursion	Recursive Definitions	A recursive structure in which two or more functions, predicates, grammars or datatypes are defined in terms of one another rather than each referring only to itself.
N-Version Programming	Software Fault Tolerance	Independently designed software versions perform one required function, and a cross-version decision uses their comparable results to tolerate some design faults.
Naked objects	Software ArchitectureArchitectural Patterns	Naked objects is an architectural pattern used in software engineering.
Nash equilibrium computation	Algorithmic Game Theory	The computational problem of finding an exact or approximate Nash equilibrium from a represented game and reporting a strategy profile with bounded unilateral deviation gain.
NAT Traversal	Computer Networking	Techniques that discover, establish, and maintain network paths across address-translating gateways by coordinating mappings, testing candidates, and relaying when necessary.
Natural-Language Programming	Programming LanguagesEnd User Programming	Natural language programming (NLP) is an ontology-assisted way of programming in terms of natural language sentences, e.g.
Navigation loop	Information TechnologyHuman Computer Interaction	Diagnose a workflow where a user cannot reach their goal by modeling the interface as a directed graph and asking one structural question — is any goal state reachable from the current state? — rather than blaming screen quality or user confusion.
NC (complexity)	Computational Complexity Theory	In computational complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors.
NE (complexity)	Computational Complexity Theory	In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non-deterministic Turing machine in time 2^{O(n)}.
Nearest neighbor search	—	The optimization problem of finding dataset items minimizing a specified distance or dissimilarity to a query.
Negation as Failure	Logic Programming and Nonmonotonic Reasoning	Treat a ground goal's finite, exhaustive proof failure under a declared logic program and search semantics as defeasible support for weak default negation, while preserving nonmonotonicity, nontermination, floundering, and classical-negation boundaries.
Neocognitron	Artificial Neural NetworksComputer Vision	The neocognitron is a hierarchical, multilayered artificial neural network proposed by Kunihiko Fukushima in 1979.
Nested Set Model	Relational DatabasesHierarchical Data Modeling	Encode a tree in relational rows with nested traversal bounds so interval comparisons recover ancestry and subtrees.
Nested stack automaton	Automata Theory	A finite-state automaton with a recursively nested stack store whose head operates on the innermost active stack.
Nested word	Formal Language TheoryNested Words	A finite or infinite linear word augmented with a properly nested matching relation between call and return positions, representing sequential order and hierarchical structure in one object.
Nets-Within-Nets	Petri NetsConcurrency Theory	Nets within nets is a modelling method belonging to the family of Petri nets.
Network allocation vector	Computer NetworkingWireless Mac	A per-station duration state that virtually reserves a shared wireless medium.
Network Congestion	Computer NetworkingTeletraffic	Offered traffic pressing beyond a network resource's effective service capacity and degrading packet delivery, delay, or call completion at that resource.
Network Function Virtualization	Computer NetworkingVirtualization	Network function virtualization (NFV) is a network architecture concept that leverages IT virtualization technologies to virtualize entire classes of network node functions into building blocks that may connect, or chain together, to create and deliver communication services.
Network Layer	Computer Networking	The transport-facing service level that identifies destinations and directs data across underlying links or subnetworks in a layered communication architecture.
Network management	Computer Networking	The coordinated monitoring, configuration, provisioning, fault, performance and security administration of a computer network.
Network mapping	Computer NetworkingNetwork Measurement	Constructing a layer-specific representation of computer-network connectivity from bounded evidence.
Network Motif	Network ScienceGraph Analysis	A small connected graph pattern that occurs significantly more often in a network than under a stated randomized comparison.
Network Protocol	Computer NetworkingCommunication Protocols	A shared specification of roles, messages, states, timing, error handling, and semantic effects governing interoperable communication among networked participants.
Network scheduler	Computer NetworkingPacket Scheduling and Quality of Service	A packet-queue arbiter that selects the transmission or reception order of network packets according to a queueing discipline.
Network segmentation	Computer Network Security	The partition of a computer network into controlled segments whose communication crosses explicitly governed boundaries.
Network simulation	Computer NetworkingDiscrete Event Simulation	In computer network research, network simulation is a technique whereby a software program replicates the behavior of a real network.
Network throughput	Computer Networking	The achieved rate at which data units are successfully delivered through a specified network path or system boundary.
Network topology	Computer Networking	Network topology is the physical or logical arrangement of nodes, links, and interconnection paths in a communications network, independent of the traffic currently flowing over them.
Network Transparency	Distributed Systems	The property of a distributed system or protocol that lets clients use remote resources through substantially the same interface and naming conventions as local resources while hiding network location and communication mechanics.
Network-Security Architecture	CybersecurityNetwork Security	A network-security architecture is a structured allocation of trust, identity, policy, enforcement, control, monitoring, and management responsibilities across network endpoints, links, overlays, services, and administrative layers to protect traffic and resources against a declared threat model.
Neural Field	Machine Learning	A learned neural function that represents a field by mapping query coordinates to signal values.
Neural modeling fields	Pattern RecognitionArtificial Neural Networks	A hierarchical adaptive-recognition framework that increases similarity between bottom-up signals and competing top-down concept models through graded, vague-to-crisp association dynamics.
Neural scaling law	Machine Learning	An empirical relation describing how neural-network loss or capability changes with model size, data, training compute or inference compute.
Neural Turing machine	Machine Learning	A differentiable recurrent architecture coupling a neural controller to an addressable external memory.
NEXPTIME	Computational ComplexityTime Complexity	The decision-problem class solvable by nondeterministic Turing machines in time exponential in a polynomial of input length.
Ninety-Ninety Rule	Software Engineering Estimation	The first 90 percent of the code takes the first 90 percent of the time and the last 10 percent takes the other 90 percent — a deadpan warning that nominal-progress metrics measure only the estimable bulk-work population and never the non-parallelizable, heavy-tailed completion tail.
No-Force Policy	Database Recovery	A database buffer-management policy that permits commit before every page dirtied by the transaction reaches its durable home location, shifting commit durability to stable redo information and allowing page writeback to occur later.
Node graph architecture	Visual ProgrammingSoftware Architecture	Node-graph architecture organizes a software application's executable operations and authoring interface as composable nodes connected through typed input-output links.
Noisy Channel Model	Natural Language Processing	Infer a plausible hidden message from an observation by ranking candidates with a forward channel likelihood and, when appropriate, a source prior.
Non-Blocking Algorithm	Concurrent Algorithms	A concurrent shared-object procedure whose operation-progress guarantee does not depend on a paused thread releasing exclusive ownership.
Non-local variable	Programming Language SemanticsScope and Environment Representation	Treat a variable reference as non-local to a program unit when its binding is supplied by an enclosing or otherwise noncurrent scope, making scope resolution and captured-environment lifetime explicit.
Non-negative Matrix Factorization	Machine LearningNumerical Linear Algebra	A constrained matrix representation approximating nonnegative observations as additive combinations of nonnegative learned basis components.
Non-uniform memory access	Computer Architecture	A shared-memory multiprocessor architecture in which access latency and bandwidth depend on which processor or node physically owns the addressed memory.
Noncontracting Grammar	Formal Language TheoryChomsky Hierarchy	In formal language theory, a noncontracting grammar (also called monotonic grammar) is a type of formal grammar whose production rules never decrease the total length of a string during derivation.
Nondeterministic Finite Automaton	Automata TheoryFormal Language Theory	A finite-state string recognizer with set-valued transitions that accepts when at least one complete run reaches an accepting state.
Nondeterministic Turing machine	Computability Theory	A Turing-machine model whose transition relation may offer multiple successor configurations and which accepts when at least one computation branch accepts.
Nonelementary Problem	Computational Complexity	A decidable decision problem whose inherent worst-case resource needs exceed every fixed-height exponential-tower bound.
Nothing-up-my-sleeve number	Cryptographic Design and Transparency	A cryptographic constant selected by a simple publicly verifiable procedure with little discretionary freedom, reducing suspicion that hidden properties or a backdoor were chosen deliberately.
NP-Equivalent	Complexity TheorySearch and Optimization	A decision or output problem that is both NP-hard and NP-easy under polynomial-time Turing reductions.
NSPACE	Computational ComplexitySpace Complexity	A family of complexity classes containing decision problems solvable by nondeterministic Turing machines using at most a specified asymptotic amount of work space.
NTIME	Complexity TheoryComputational Complexity	NTIME(f(n)) is the complexity class of decision problems solvable by a nondeterministic Turing machine within O(f(n)) steps, with NTIME denoting the corresponding time-bounded nondeterministic hierarchy.
Null coalescing operator	Programming LanguagesOperators	While its behavior differs between implementations, the null coalescing operator generally returns the result of its left-most operand if it exists and is not null, and otherwise returns the right-most operand.
Null dereference	Reliability and Defensive Programming	The failure where code operates on a reference under the unstated assumption that the object exists, while the reference is in fact absent — so the defect is the missing existence-precondition check, not the absence itself.
Null Move	Game Theory and Adversarial SearchComputer ChessGame Tree Search	Passing or simulating a skipped turn without an ordinary board or resource action, while turn control changes; useful in game analysis or reduced-depth search but unsafe as a pruning premise in zugzwang.
Null pointer	Programming Languages	A distinguished pointer or reference value guaranteed not to designate any valid object.
Object graph	Runtime Object Representation and Memory Management	A point-in-time graph view whose nodes are runtime objects and whose directed edges are direct or chained object references.
Object-modeling technique	Software Modeling	An early object-oriented software-analysis and design method combining object, dynamic, and functional models across development stages.
Object-Oriented Operating System	Operating SystemsKernel and Executive Architecture	Structure operating-system resources and services as encapsulated, identity-bearing objects whose typed interfaces and polymorphic refinements govern kernel or executive interaction.
Object-Oriented Programming	Computer ProgrammingProgramming Paradigms	A programming paradigm that organizes computation as interactions among identity-bearing objects that combine state with behavior and respond through method or message dispatch.
Object–Action Interface	Human Computer Interaction	Model a user's task objects and actions as corresponding interface hierarchies in which a visible object is selected first and the interface then exposes actions applicable to it.
Object–relational model	DatabasesData Models	An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language.
Oblivious RAM	CryptographyMemory Systems	Preserve logical memory reads and writes while making observed physical access traces indistinguishable for equally long request sequences.
Occasionally Connected Computing	Distributed SystemsMobile Computing	A data-work arrangement that preserves local reads and writes through intermittent remote reachability, then exchanges and reconciles changes.
Offset binary	Computer Arithmetic	A signed-integer encoding that stores value n as the unsigned binary representation of n plus a fixed bias K.
OLAP Cube	Data Warehousing	A multidimensional analytical model that organizes measures by dimension members and supports valid aggregate views.
Onboarding cliff	Information TechnologyHuman Computer Interaction and User Experience	Diagnose first-use abandonment as a geometry of two curves — cumulative cost crossing the user's willingness-to-invest before cumulative value crosses willingness-to-stay — separating first-contact complexity from steady-state complexity and naming exactly two levers.
One clean qubit	Quantum ComputingQuantum Complexity Theory	A restricted quantum-computation model whose input is one pure qubit tensored with an otherwise maximally mixed register, followed by a polynomial-size unitary circuit and a bounded-gap decision readout of a designated qubit.
One-Sided Communication	Remote Memory Access	An origin specifies access to eligible memory associated with another participant, without a matching application receive for each transfer, under explicit access and completion rules.
One-to-many (data model)	Data ModelingEntity Relationship Cardinality	A relationship cardinality in which one parent entity may relate to multiple child entities while each child participates with at most one parent in that relationship, commonly enforced by a child-side foreign key.
One-to-one (data model)	Data ModelingEntity Relationship Modeling	A relationship cardinality in which each instance of either entity type is associated with at most one instance of the other, with optionality specified separately.
One-way quantum computer	Quantum ComputingMeasurement Based Quantum Computation	The one-way quantum computer, also known as measurement-based quantum computer (MBQC), is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it.
Online Codes	Coding TheoryErasure CodesFountain Codes	Rateless erasure codes with locally generated check blocks and staged probabilistic message recovery.
Online Machine Learning	Machine LearningOnline Learning	Adapt a usable predictive or decision model during a sequence of arriving observations or feedback, rather than waiting for a completed fixed training set.
Opaque data type	Data Type DesignProgramming LanguagesInformation Hiding	In computer science, an opaque data type is a data type whose concrete data structure is not defined in an interface.
Open-Source Artificial Intelligence	Artificial IntelligenceOpen Source AI Governance	An AI-system release whose terms and modifiable materials jointly let recipients use, study, modify, and share the system, including sufficient data information, complete training-and-operation code, and model parameters.
Operational transformation	Collaborative Software	A concurrency-control technique that transforms editing operations against concurrent operations so replicas converge while preserving user intentions.
Operator (computer programming)	Programming LanguagesLanguage Semantics	A programming-language construct whose notation, arity, precedence, evaluation rules, and semantics combine operands in ways that may differ materially from an ordinary function call.
Operator-precedence grammar	Formal Language Theory	A context-free grammar in operator form whose production-derived terminal-pair precedence matrix is conflict-free.
Optimal Substructure	Algorithm Design	Require an optimization problem's globally optimal solution to decompose into subsolutions that are themselves optimal for the correctly inherited subproblems, enabling safe replacement and recursive reuse.
Optimizing Compiler	Compiler Optimization	A compiler that transforms a program to improve a declared resource objective while preserving its defined behavior.
Ordinal Data Type	Discrete Types	An ordinal data type gives its language-defined values ordered integer positions that support stepping and contiguous subranges.
Organic computing	Autonomic ComputingSelf Organizing Systems	Organic computing designs autonomous computing systems with self-organizing properties such as self-configuration, self-optimization, self-healing, and self-protection.
Orphan Process	Operating SystemsProcess Lifecycle and Reaping	A live child process whose creating parent terminates first, causing the operating system to preserve the child while reassigning its parent and eventual wait-accountability to a system reaper or subreaper.
OSI model	Computer NetworkingNetwork Architecture	The Open Systems Interconnection (OSI) model is a reference model developed by the International Organization for Standardization (ISO) that "provides a common basis for the coordination of standards development for the purpose of systems interconnection.".
Out-of-bag error	Machine Learning	A predictive-error estimate computed for each training case using only bagged models that excluded it from their bootstrap samples.
Overlap (term rewriting)	Term RewritingCritical Pairs	A term-rewriting configuration in which left-hand sides of rules match intersecting positions in one term, creating competing reductions and a critical-pair confluence obligation.
Overlay network	Computer Networking	A logical network whose nodes and links are implemented as endpoints and multi-hop paths over an underlying network.
P versus NP Problem	Computational Complexity Theory	Ask whether every problem whose solutions can be verified in polynomial time can also be solved in polynomial time — turning the apparent gap between checking and finding into the open question of whether it is a structural barrier (P ≠ NP) or mere ignorance (P = NP).
P2PTV	Distributed Media	A peer-to-peer distribution architecture in which participating viewers relay portions of live or near-live video streams to one another.
PACELC Theorem	Distributed Database Design	Classify a replicated data system by two regime-dependent trade-offs — availability vs. consistency under Partition, and Else (normal operation) latency vs. consistency — into a four-letter posture from which its workload behaviour reads directly.
Packet switching	Computer NetworkingNetwork Switching Architectures	Carry digital traffic by dividing messages or streams into addressed packets that share links on demand and are independently received, buffered, forwarded, and reassembled or delivered.
Padding argument	Computational ComplexityResource Bound Transfer Arguments	A complexity-theoretic proof technique that appends irrelevant symbols to change input length and thereby translate one resource bound into another while preserving membership in the encoded language.
Page Fault	Operating SystemsVirtual Memory	A memory-access exception that lets the operating system resolve an absent or disallowed virtual-memory mapping.
Parallel algorithm	Parallel Computing	An algorithm organized so multiple operations can execute concurrently on several processing elements while coordinating dependencies and shared data.
Parallel Array	Data Structures	A multi-field record sequence represented by separate field arrays whose matching positions jointly form each logical record.
Parallel computation thesis	Parallel Complexity TheoryComputational Complexity	In computational complexity theory, the parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallel machine is polynomially related to the space used by a sequential machine.
Parallel computing	Parallel Systems and Algorithms	Execute multiple computations simultaneously across processing elements by decomposing work and coordinating data, communication, synchronization, dependencies, and load to reduce time or increase throughput.
Parallel RAM	Parallel Computing	A shared-memory abstract machine for analyzing parallel algorithms by processor count, time and concurrent memory-access rules.
Parameterized Macro	Programming LanguagesPreprocessors	A parameterized macro (or function-like macro) is a macro that is able to insert given objects into its expansion.
Parametricity	Programming Language TheoryPolymorphism	The uniformity principle that a parametrically polymorphic program must behave relationally the same at every type instantiation because it cannot inspect the abstract type.
Paramorphism	Functional ProgrammingRecursion Schemes	A structural recursion scheme whose combining step receives both each original recursive subobject and the result recursively computed from it.
Paranoid algorithm	Game AI	A multiplayer game-tree search that treats every opponent as a single coalition minimizing the focal player’s payoff.
Parity P	Computational Complexity Theory	The complexity class of decision problems for which a nondeterministic polynomial-time machine accepts exactly when it has an odd number of accepting computation paths.
Parsimonious reduction	Computational Complexity	A problem transformation that preserves the exact number of solutions.
Partial sorting	Algorithms	Rearrangement that places the k smallest or largest elements in their fully sorted positions while leaving or discarding the remainder without requiring a total order output.
Partition problem	Computational ComplexityNP Complete Problems	The problem of dividing a multiset of positive integers into two exhaustive parts with equal sums, or minimizing their sum difference.
Partitioned Global Address Space	Parallel Programming	A programming model makes eligible data referable across locality domains while exposing each location's partition or affinity and defining local and remote access.
Passwordless authentication	Identity Security	Authentication that verifies a claimant without requiring entry of a memorized knowledge secret, usually through a registered device, cryptographic key or inherence factor.
Patch management	It OperationsSoftware Maintenance	The governed lifecycle for identifying, prioritizing, acquiring, testing, deploying, verifying, and monitoring software and firmware patches across an asset fleet.
Path Expression	XML QueryGraph Query	A structured-data query expression that composes navigation steps to select nodes or values under a language's tree or graph semantics.
Path ordering (term rewriting)	Term Rewriting	A well-founded term ordering based on root-symbol precedence and recursive comparison of subterms.
Pattern calculus	Programming Language TheoryPattern Matching Calculi and Operational Semantics	Make pattern matching the primitive computational interaction, allowing patterns and pattern abstractions to be constructed, passed, returned, and applied to decompose both functions and data structures.
Pattern Language (Formal Languages)	Formal Language Theory	The formal language generated from one constants-and-variables pattern by consistently replacing each variable with a nonempty terminal string while preserving every constant.
Pattern matching	Symbolic Matching	The exact or rule-governed comparison of a token sequence, tree or structured value against a pattern to determine a match and optionally bind components for extraction or rewriting.
Peer-to-Peer Architecture	Peer to Peer Systems	A peer-to-peer architecture lets participating endpoints supply service data or work to one another instead of relying solely on a dedicated server.
Penultimate-Hop Popping	Computer NetworkingMPLS Routing	Penultimate hop popping (PHP) is specified in Section 3.16 and is a function performed by certain routers in an MPLS enabled network.
Performance-Enhancing Proxy	Computer NetworkingTransport Protocol Performance	An intermediary network agent that mitigates link-specific protocol degradation by modifying, splitting, caching, acknowledging, retransmitting, filtering, or otherwise optimizing traffic in flight.
Petri net	Formal MethodsConcurrent System Models	A bipartite place-transition graph with a token marking whose enabled transition firings consume and produce tokens, modeling concurrency, synchronization and resource flow in discrete-event systems.
Phantom reference	Programming Languages	A Java reference object that becomes enqueued after its referent is finalized or otherwise unreachable and before the associated memory is reclaimed.
Phase-Change Memory	Computer EngineeringNonvolatile Memory	Nonvolatile memory that stores data in electrically programmed amorphous and crystalline material states distinguished by resistance.
Plaintext	Encryption Interface Roles	Identify data in the input-to-encryption or output-from-decryption role at a declared cryptographic layer, regardless of human readability, while separating that relative role from cleartext exposure and message encoding.
Planar SAT	Computational ComplexitySatisfiability	A Boolean satisfiability restriction in which the bipartite incidence graph connecting variables to the clauses containing them is planar, while the decision question remains whether a satisfying truth assignment exists.
Planarity testing	Graph Algorithms	The algorithmic decision problem of determining whether a graph admits a crossing-free plane embedding and producing either an embedding or an obstruction.
Platform-specific model	Software ArchitectureModel Driven Architecture	A system-design model whose structure is expressed for a chosen programming, database, operating-system, or other implementation platform.
Point-normal triangle	Computer GraphicsCurved Pn Triangle Tessellation	Construct a cubic Bézier triangle from three vertex positions and corresponding normals to approximate a smooth surface patch while retaining the original vertices.
Point-set registration	Computer VisionGeometric Alignment	The estimation of a spatial transformation that aligns two or more point sets into a common coordinate frame despite noise, outliers or incomplete overlap.
Pointer	Data Structures and Memory	A small, fixed-size value that stores the memory address of another object, providing indirect access through three operations — take-address, dereference, and reassign — so linked structures can span non-contiguous storage and mutate in place by rewiring rather than copying.
Polyhedral Model	Polyhedral CompilationLoop Nest Optimization	A compiler framework that lifts an affine program region into integer-set iteration domains, access and dependence relations, and a multidimensional schedule, searches legal schedule transformations for locality or parallelism, then regenerates equivalent executable loops.
PolyL	Computational ComplexitySpace Complexity Classes	The deterministic complexity class of decision problems solvable with polylogarithmic work space, DSPACE((log n)^O(1)).
Polynomial hierarchy	Computational Complexity Theory	A nested hierarchy of decision-problem classes formed by bounded alternations of existential and universal polynomial-time computation, generalizing NP and coNP within PSPACE.
Polynomial identity testing	Algebraic Complexity Theory	The computational problem of deciding whether an algebraic expression or arithmetic circuit represents the identically zero polynomial rather than merely vanishing at selected inputs.
Polyvariance	Static Program AnalysisAbstract Interpretation	A static-analysis design that retains distinct abstract approximations for selected calling contexts or value origins instead of merging them into one state.
Portable object (computing)	Distributed ComputingDistributed Objects	In distributed programming, a portable object is an object which can be accessed through a normal method call while possibly residing in memory on another computer.
Position-Independent Code	Systems Programming	Machine code whose intended execution survives placement at different supported load addresses without rewriting its instruction bytes for the chosen address.
Post Canonical System	Computability TheoryString Rewriting	A finite string-production formalism that derives words from finite axioms by matching whole-word antecedent patterns and reassembling their matched variables in consequents.
Postback	Web DevelopmentWeb Analytics	In web development, a postback is the exchange of information between servers to report a user's action on a website, network, or app.
Postcondition	Formal Methods	A predicate required to hold immediately after a program operation or specified code region completes normally.
Postel's Law (Robustness Principle)	Information TechnologyProtocol Design and Interoperability	Postel's protocol-design maxim — be conservative in what you send, liberal in what you accept — which keeps a multi-vendor system interoperable by having every implementation produce tightly to spec while its acceptance window absorbs the realistic scatter of others.
Postings List	Information RetrievalInverted Index Representation and Query Processing	A postings list is the term-conditioned occurrence sequence in an inverted index, storing ordered document identifiers and optional frequencies, positions, offsets, impacts, or payloads so query operators can traverse only matching corpus regions.
Powerset Construction	Automata TheoryFormal Language Theory	Convert a nondeterministic finite automaton into a language-equivalent deterministic automaton by making each possible-state set one state.
PPP (complexity)	Computational Complexity TheoryTotal Search Problems	The class of total polynomially verifiable search problems reducible by efficient witness-preserving maps to the zero-preimage-or-collision PIGEONHOLE CIRCUIT problem.
Preboot Execution Environment	Network Booting	In computing, the Preboot eXecution Environment (PXE; often pronounced as pixie), often called PXE boot (pixie boot), is a specification describing a standardized client–server environment that boots a software assembly, retrieved from a network, on PXE-enabled clients.
Predicate Dispatch	Programming Languages	A guarded method-selection mechanism that tests arguments for applicability and, in its formal form, orders applicable implementations by predicate implication.
Prediction by Partial Matching	Data CompressionSequence Prediction	Estimate the next symbol from adaptive continuation statistics at the longest informative recent context, backing off to shorter contexts when the continuation is unseen.
Prefix hash tree	Distributed Hash TablesPeer to Peer Systems	A distributed prefix-trie index whose logical nodes are located through a DHT, enabling prefix and range queries through adaptive distributed partitions.
Presentation layer	Computer NetworkingOsi Model	In the seven-layer OSI model of computer networking, the presentation layer is layer 6 and serves as the data translator for the network.
PRF Advantage	CryptographyProvable Security	In cryptography, the pseudorandom-function advantage (PRF advantage) of an algorithm on a pseudorandom function family is a measure of how effectively the algorithm can distinguish between a member of the family and a random oracle.
Primitive Obsession	Software Design	The code smell of representing domain concepts that carry structural commitments — units, valid ranges, well-formedness, identity — as bare primitives like int or string, so the type system cannot enforce the distinctions and they survive only as validation duplicated at every callsite.
Prim’s Algorithm	Graph Algorithms	A greedy minimum-spanning-tree algorithm that grows one connected tree from a chosen start vertex by repeatedly adding a cheapest edge crossing from the current tree to an unreached vertex.
Principal type	Type TheoryType Inference	The most general type or type scheme assignable to a term in a fixed environment, such that every other valid type for that term is obtained as an instance of it.
Prioritised Petri Net	Concurrency Theory	A Petri net whose firing rule suppresses an enabled transition while an eligible higher-priority transition exists.
Proactive learning	Machine Learning	A cost-sensitive active-learning strategy that jointly selects which unlabeled instance to query and which imperfect oracle to ask, accounting for expertise, reliability, reluctance, and price.
Probabilistic argumentation	Formal ArgumentationArtificial Intelligence	Probabilistic argumentation is a family of formal systems that attach probabilistic uncertainty to arguments, premises, attacks, supports, or conclusions and define how that uncertainty affects acceptability or inference.
Probabilistic CTL	Model CheckingTemporal Logic	Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) that allows for probabilistic quantification of described properties.
Probabilistic programming	Programming Languages	A programming paradigm that specifies generative probability models as programs and delegates posterior inference to a general inference engine.
Problem Frames Approach	Requirements Engineering	The problem frames approach specifies a machine through its interfaces with world domains so that domain properties and machine behavior jointly satisfy a world-level requirement.
Process Migration	Distributed Operating SystemsProcess Mobility and State Transfer	Relocate an executing or suspended operating-system process by capturing its computational state, transferring it across an execution boundary, repairing external bindings, and resuming one logical continuation at the destination.
Process state	Operating Systems	A scheduler-relevant lifecycle condition of an operating-system process, such as new, ready, running, blocked, suspended, or terminated, together with permitted transitions.
Process-data diagram	Information SystemsMethod Engineering	A modeling diagram that places a process structure beside the data or deliverable structure it creates, linking activities directly to their outputs.
Processor	Computer Architecture	Processor is a recurring computer architecture, digital electronics identity in which a digital processing unit fetches or receives data and performs a defined instruction or operation repertoire under physical constraints.
Processor Sharing	Queueing Theory	An ideal preemptive service discipline that divides a server's instantaneous capacity among all jobs currently present, usually equally or by fixed weights.
Product-family engineering	Product Line Engineering	An engineering discipline that builds a shared product-line platform with explicitly modeled common features and planned variability from which related products are derived.
Profile-Guided Optimization	CompilersPerformance Engineering	Use measured program behavior to choose later or adaptive transformations at the code sites that generated the profile.
Program Profiling	Software PerformanceProgram Analysis	Measuring a running program's resource use or execution events and attributing them to functions, source lines, or call paths under a specified workload.
Program Realization Strategy	Programming Language Implementation	Assign how a formal program is turned into running behavior — by ahead-of-time translation to an independent artifact, direct execution by an always-present engine, or an adaptive mixture — and thereby fix when semantic work and its costs are paid.
Program Transformation	Program AnalysisSoftware Engineering	Program transformation rewrites a program under an explicit relation between the old and new program's behavior.
Programming Class	Programming LanguagesObject Oriented Programming	A programming-language construct that defines a kind of object and governs how its instances are created and obtain attributes or behavior.
Programming Fold	Functional ProgrammingProgramming Language Semantics	A parameterized reduction of structured data using a supplied base and combining operation, with right-recursive or left-accumulator variants.
Programming Paradigm	—	A programming paradigm is a coherent set of computational concepts, composition rules, state and control models, and programming constraints that organizes how programs are expressed, reasoned about, executed, and evolved across multiple implementations or languages.
Programming Variable	Programming Languages	A programming variable is a language-governed binding that lets a program reference a value or location in an execution context.
Prompt engineering	Generative Model Prompt Design	Deliberately shape a textual inference prompt for a trained generative model to steer a specified output aim without changing that target model in the prompting step.
Prompt Injection	AI Security	Untrusted content delivered to a language model through a data channel is interpreted as instructions rather than material to process, so an embedded directive executes at the model's privilege — the failure being the absence of any in-band boundary between instructions and data, not a lapse in alignment.
Proof of correctness	Formal VerificationProgram Correctness	A mathematical demonstration that an algorithm satisfies a formal specification, separating partial correctness from the additional obligation to prove termination for total correctness.
Proof-Carrying Code	Computer SecurityFormal Methods	A code-admission method in which an untrusted producer supplies executable code with a formal proof that the consumer checks against its policy for that received code.
Property-Based Testing	Software Testing	State an invariant that must hold for all inputs of a class and let a framework generate many samples, check each, and shrink any failure to a minimal counter-example — replacing hand-picked examples with systematic search over an input space.
Protection Ring	Computer ArchitectureOperating SystemsComputer Security	A hardware-enforced hierarchy of execution privilege levels with controlled transitions from less-privileged outer rings to protected inner-ring services.
Proto-value function	Reinforcement Learning	A task-independent spectral basis function learned from a state-transition graph to approximate value functions in reinforcement learning.
Protocol pipelining	Computer NetworkingApplication Protocol Performance	A communication technique that sends multiple requests on one connection before earlier responses arrive, overlapping network latency while preserving protocol-defined association and ordering.
Protocol spoofing	Computer NetworkingPerformance Enhancing Proxy	Improve a constrained network path by interposing a proxy that locally emulates selected endpoint protocol responses while preserving and translating remote session semantics.
Protocol Stack	Computer Networking	An implemented arrangement of communication protocols ordered by the services lower levels provide to higher levels.
Prototype-based programming	Object Oriented Programming Language Design	An object-oriented programming paradigm in which objects inherit behavior directly from reusable prototype objects rather than from classes.
Proximity search (text)	Information Retrieval	An information-retrieval query requiring separately matching terms to occur within a specified textual distance, optionally in a specified order.
Proxy Pattern	Software EngineeringObject Oriented Design	An object-design pattern in which an interface-compatible surrogate receives a client request, governs or mediates access, and delegates the admissible operation to a real subject.
Prune and search	Algorithm Design	An optimization technique that repeatedly discards a guaranteed constant fraction of candidate input while preserving at least one optimum, then recurses on the remainder.
Pseudo-polynomial transformation	Computational ComplexityStrong NP Completeness Reductions	Map instances between numerical decision problems while preserving yes/no membership and polynomially controlling computation, encoding growth, and the target's largest numerical parameter.
Pseudorandom generators for polynomials	PseudorandomnessComputational Complexity	Pseudorandom generators for low-degree polynomials are a particular instance of pseudorandom generators for statistical tests, where the statistical tests considered are evaluations of low-degree polynomials.
Pseudorandom Number Generator	Random Number Generation	A deterministic seeded algorithm that evolves finite internal state or a keyed counter to emit a reproducible sequence engineered to meet specified statistical or computational unpredictability criteria.
PSPACE	Computational Complexity	The complexity class of decision problems solvable by a deterministic Turing machine using polynomial workspace.
PTAS Reduction	Approximation Complexity	Transfer a polynomial-time approximation scheme from a target optimization problem back to a source problem by polynomial instance and solution maps whose parameter translation preserves every requested approximation tolerance.
Public-Key Cryptography	Cryptography	Give each party a mathematically linked public/private key pair where an operation done with one key is invertible only with the other and the private key cannot feasibly be computed from the public one, so confidentiality and verifiable authorship need no pre-shared secret.
Publisher Relation	Information TechnologyBibliographic Metadata Governance	Collapse a long chain of authorship, review, and production into one resolvable metadata handle naming the agent who effected a resource's release, so every downstream governance question routes to the same addressable accountable party.
Pulse-Coupled Neural Network	Image ProcessingNeural Computation	Couple thresholded pulse-generating units so external input and neighboring firings jointly shape temporal signals.
Pumping lemma	Formal Language TheoryAutomata Theory	A family of necessary repeatability conditions for language classes, used chiefly to prove nonmembership by showing that some sufficiently long word defeats every permitted pump decomposition.
Q Number Format	Fixed Point Arithmetic	Encode binary fixed-point values as stored integers with an implicit power-of-two scale, using a Q notation that declares fractional bits, integer width, and signedness while keeping vendor sign-bit conventions explicit.
QMA	Computational ComplexityQuantum Computing	QMA is a recurring computational complexity, quantum computing identity in which polynomial-size quantum witnesses are verified in quantum polynomial time with bounded completeness and soundness error.
Quadtree	Spatial Data Structures	A hierarchical spatial data structure whose internal nodes recursively divide a two-dimensional region into four child regions.
Qualification Principle	Programming Language Theory	A programming-language design principle that permits any semantically meaningful phrase class to introduce a local declaration environment whose bindings are visible only while that phrase is processed.
Qualification problem	Artificial IntelligenceCommonsense Reasoning	The knowledge-representation problem that real-world actions have indefinitely many exceptional preconditions, making a complete list of conditions for their intended effects impossible to state in advance.
Qualitative Simulation	Qualitative ReasoningModel Based Simulation	Derive possible successor behaviors of a changing system from qualitative states, explicit relations, and an initial scenario.
Quality of service	Computer Networking	The measurable performance delivered by a communication or computing service, together with mechanisms that differentiate or guarantee it for selected traffic.
Quantification (machine learning)	Machine LearningSupervised Class Distribution Estimation	A supervised-learning task that estimates class prevalences in an unlabeled sample rather than classifying each item.
Quantum Byzantine Agreement	Distributed ComputingQuantum Computing	This shows that the quantum implementation of classical Byzantine Agreement protocols is indeed feasible.
Quantum cellular automaton	Quantum ComputingCellular Automata	A spatially organized quantum-computation model whose finite-dimensional cells evolve by a homogeneous, local, globally quantum-consistent rule, often constrained to be reversible or unitary and sometimes universal for quantum computation.
Quantum Computing	Quantum Computation	A computational paradigm that encodes and transforms information in controlled quantum states, using superposition, interference, entanglement, measurement, and error management to implement algorithms whose resource behavior can differ from classical computation.
Quantum finite automaton	Quantum ComputationFormal Language Theory	A finite-control input-reading quantum automaton whose specified transitions and measurements assign acceptance probabilities to words.
Quantum Interactive Polynomial Time (QIP)	Quantum ComplexityComputational Complexity	In computational complexity theory, the class QIP (which stands for Quantum Interactive Proof) is the quantum computing analogue of the classical complexity class IP, which is the set of problems solvable by an interactive proof system with a polynomial-time verifier and one computationally unbounded prover.
Quantum pseudo-telepathy	Quantum InformationNonlocal Games	A nonlocal-game phenomenon in which entangled players win with certainty without communication although no classical no-communication strategy can do so.
Quantum Random-Access Code	Quantum InformationQuantum Communication Complexity	Quantum random access codes (QRACs) are a quantum information theoretic primitive used to encode a string of classical bits into a quantum state of smaller dimension, such that any single bit of the original string can be retrieved with a certain probability of success.
Quantum-Computation Model	Quantum ComputingModels of Computation	A quantum-computation model is a formal specification of quantum information carriers, admissible initial states, operations, spatial or circuit organization, resource bounds, noise assumptions, and measurement rules used to define computations and compare computational power.
Queap	Data StructuresPriority Queues	An amortized priority-queue structure that buffers recent insertions in a minimum-tracked list and migrates them into an insertion-ordered modified 2–4 tree when deletion requires it, making deletion cost depend on item age.
Query Optimization	Databases	Let the author state only what result a declarative query should return, then have a separate optimiser search the space of algebraically equivalent execution plans and emit the cheapest one under a cost model.
Query rewriting	Database Systems	Transformation of a database query into a semantically equivalent form intended to improve execution or use available views.
Queue (FIFO Abstract Data Type)	Data Structures	A FIFO queue adds elements at the rear and removes the earliest still-pending element from the front, independent of its storage implementation.
Quotient Filter	Approximate Membership Query Data Structures	Store hashed key fingerprints as quotient-indexed, remainder-bearing runs in a compact metadata-coded table, supporting locality-friendly one-sided membership and, under compatible parameters and duplicate semantics, deletion, merge, and resize.
Quotient of a Formal Language	Formal Language TheoryAutomata Theory	An operation on formal languages that removes a suffix or prefix drawn from another language: L₁/L₂ contains w when wx∈L₁ for some x∈L₂, with a dual left quotient defined by xw∈L₁.
Racetrack problem	Concurrent Systems	A cyclic race-condition flaw in which signals or events repeatedly chase one another around a feedback path, making the result depend critically on relative timing.
Rademacher complexity	Statistical Learning TheoryMachine Learning	A sample-dependent measure of how strongly a function class can correlate with independent random ±1 labels, used to bound generalization error.
Radial basis network	Neural NetworksMachine Learning	In the field of mathematical modeling, a radial basis function network is an artificial neural network that uses radial basis functions as activation functions.
Radix tree	Data StructuresTries	In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie (prefix tree) in which each node that is the only child is merged with its parent.
Random Binary Tree	Analysis of AlgorithmsRandom Trees	In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees.
Random number generation	Probability and ComputingRandomness Generation	Produce symbols intended to be unpredictable or distributionally random by sampling physical entropy or evolving a deterministic pseudorandom state under an explicit seeding and output convention.
Random sample consensus	Computer Vision and Robust EstimationSample Consensus Model Fitting	Estimate a model under substantial outlier contamination by repeatedly fitting random minimal subsets, scoring each hypothesis by thresholded consensus support, and refining the best supported model.
Random seed	ComputingPseudorandom Generation	The initial state value supplied to a pseudorandom generator so that it deterministically produces a reproducible sequence.
Random-Access Machine	Theoretical Computer ScienceModels of Computation	Analyze algorithms on an abstract sequential computer with numbered registers and indirect addressing, making instruction set, word size, and operation-cost assumptions explicit.
Randomized Algorithm	Algorithm Design	A randomized algorithm makes internal random choices and states its output or cost guarantee over those choices for each fixed input.
Randomized Rounding	Theoretical Computer ScienceApproximation Algorithms and Combinatorial Optimization	Map a tractable fractional or convex relaxation into a distribution over discrete candidates whose marginals, correlations, and geometry retain enough of the relaxation to prove feasibility and approximation quality probabilistically.
Randomness extractor	PseudorandomnessComputational Complexity	A randomness extractor, often simply called an "extractor", is a function, which being applied to output from a weak entropy source, together with a short, uniformly random seed, generates a highly random output that appears independent from the source and uniformly distributed.
Rate-Limit Absence	Security and Systems Engineering	Diagnose a whole family of endpoint abuses as one defect — a callable action left uncapped whose per-invocation cost to the service far exceeds the attacker's, so no enforced per-source budget separates legitimate demand from adversarial demand driven at machine speed.
Rational data type	Programming LanguagesNumeric Data Types	Haskell provides a type, which is really an alias for ( being a polymorphic type implementing rational numbers for any type of numerators and denominators).
Ray Tracing (Graphics)	Computer Graphics	Synthesize image samples by launching geometric rays through a scene, ordering their intersections, and evaluating visibility and light transport as paths reflect, refract, scatter, or terminate.
Reachability analysis	Distributed Protocol VerificationFormal Verification	Exploring reachable global states of communicating entities and their message medium from an initial configuration.
Reachability problem	Formal Verification	The decision problem asking whether allowed transitions can carry a system from a specified initial state to a target state.
Reaching definition	Compiler TheoryForward May Dataflow Analysis	Track which variable assignments may flow to a program point along control-flow paths without an intervening assignment to the same variable.
Reactive Programming	Programming LanguagesReactive Systems	A programming paradigm that declares dependencies among changing values or events and lets an execution model propagate their effects to derived computations.
Real-time computing	Computer Systems	Computing whose correctness depends on producing results within specified timing constraints as well as computing the right values.
Reconfigurable Computing	Computer ArchitectureReconfigurable Systems	Computing by mapping functions onto a reusable hardware fabric whose logic or processing interconnections can be retargeted.
Reconfiguration	Reconfiguration ProblemsTheoretical Computer Science	In discrete mathematics and theoretical computer science, reconfiguration problems are computational problems involving reachability or connectivity of state spaces.
Recursive Grammar	Formal Language TheoryGrammar and Parsing	A generative grammar in which a nonterminal can return to itself through a nonempty chain of productions, directly or indirectly.
Recursive join	Relational DatabasesRecursive Queries	Repeatedly join relational query results to a relation to derive further rows from seeds, with duplicate and stopping rules determining whether a completed result is reached.
Reduced Instruction Set Computer	Computer Architecture	A reduced instruction set computer uses a comparatively regular instruction-set design to balance efficient hardware implementation with compiled program cost.
Reduction (complexity)	Computational ComplexityProblem Reductions	An algorithmic transformation from instances of one computational problem to another that preserves answers and is efficient enough to transfer solvability or hardness results.
Reduction operator	Parallel Programming	A reduction operator associatively combines array elements into one result and thereby supports parallel aggregation.
Reentrant mutex	Concurrent ComputingSynchronization Primitives	A mutual-exclusion lock that its owning thread may acquire repeatedly, tracking recursion depth and releasing ownership only after a matching number of unlocks.
Refused Bequest	Object Oriented Design	Flag an inheritance edge as broken when a subclass accepts a parent's implementation but refuses part of its contract — stubbing, throwing, or silently mishandling inherited members — because that refusal is exactly the Liskov substitutability violation the is-a declaration promised not to make.
Region connection calculus	Qualitative Spatial Reasoning	A qualitative spatial calculus representing topological relations among regions through connection and derived predicates.
Register allocation	Compiler Optimization	The compiler task of assigning live program values to a limited set of processor registers while inserting spills and respecting calling and instruction constraints.
Register Machine	Models of Computation	A formal computation model that executes a finite instruction program over addressed numeric registers, with register operations, conditional control, and an explicit result convention.
Register window	Processor ArchitectureCalling Conventions	Call-indexed remapping of fixed architectural register names onto portions of a larger physical register file, often overlapping adjacent windows for argument handoff.
Register–memory architecture	Instruction Set ArchitectureComputer Architecture	Register–memory architecture denotes a computer instruction set architecture within instruction-set architecture.
Regular Expression	Automata and Formal Languages	A pattern language for denoting and matching sets of strings, classically equivalent to finite automata but extended by engine-specific constructs with distinct semantics and complexity.
Regular Grammar	Formal Language TheoryRegular Languages and Finite Automata	A regular grammar is a formal grammar whose productions keep at most one nonterminal consistently at one edge of the right-hand side, so derivation carries only finite-state memory and generates exactly a regular language under the declared right- or left-linear convention.
Reification (knowledge representation)	Knowledge Representation	The conversion of a relation or assertion into an addressable object about which further assertions can be made.
Reinforcement learning	Reinforcement Learning	Learn a policy for sequential action from evaluative reward generated through agent–environment interaction, balancing exploration, delayed credit, and long-run return.
Relational data mining	Data MiningInductive Logic Programming	Relational data mining discovers patterns spanning multiple related tables, entities, or relations rather than restricting analysis to attributes in one flat table.
Relational database	Database Systems	A database that represents data as relations of tuples and attributes governed by keys, constraints, and relational operations.
Relational Model	Database Theory	Organize data as typed sets of tuples queried by a small closed algebra of relation-to-relation operators, so any composition is itself a valid query, rewrites preserve meaning, and the logical schema is separated from physical storage.
Relational operator	Programming Languages	A programming-language operator that compares two operands under a specified relation and returns a truth-valued result.
Relational transducer	Database Theory and Distributed Computation	A state-machine model whose input, output, memory and transition state are finite relational database instances transformed by declarative queries.
Relationship extraction	Natural Language ProcessingInformation Extraction	An information-extraction task that detects entity pairs or other arguments in artifacts and assigns the semantic relation expressed between them.
Release Consistency	Shared Memory Multiprocessors	Release consistency relaxes ordinary shared-memory ordering while enforcing specified acquire/release synchronization boundaries for correctly labeled concurrent programs.
Release Early, Release Often	Software Engineering	A software project exposes usable intermediate versions repeatedly so tester and user feedback can shape later fixes and releases.
Relevance (information retrieval)	Information Retrieval	The degree to which retrieved information satisfies a user’s information need within a task and context.
Reliability (computer networking)	Computer Networking	A communication service property that detects loss or failure and provides declared guarantees about delivery, ordering, duplication and notification.
Rematerialization	Compiler Optimization	Recompute a needed intermediate at its later use instead of retaining or retrieving it, trading extra work for less storage or data movement.
Remote evaluation	Mobile CodeDistributed Systems	A mobile-code pattern in which a client sends executable code to a remote server for execution and receives the resulting values back.
Remote Procedure Call	Distributed Computing	A declared procedure invocation across an execution-context boundary, with target binding, argument transfer, remote dispatch, and an explicit result-or-failure contract.
Rendering (computer graphics)	Computer Graphics	The computation of an image from a formal scene, geometry, material, lighting, camera, or volume specification.
Reorder Buffer	Processor Microarchitecture	A reorder buffer tracks out-of-order instruction results in program order so architectural effects retire from an eligible oldest prefix.
Replacement Relation	Information TechnologyResource Governance and Versioning	Record that a distinct successor resource takes over a predecessor's canonical standing and flags it obsolete, as a bidirectional machine-routable link, so consumers read currency off the chain rather than inspecting the artifacts themselves.
Request-Response	Distributed Systems	Treat any bounded network exchange as one shape — an initiator's addressed request causally paired to one responder's reply over a return path — so the same fixed checklist of addressing, correlation, retry, idempotency, and error handling applies regardless of payload.
Requirement	Requirements Engineering	An engineering condition that a product, service, process, or work result must satisfy to be acceptable to a declared stakeholder, contract, standard, or verification regime.
Requirements analysis	Systems and Software Engineering	Requirements analysis elicits, reconciles, documents, validates, and manages stakeholder needs and testable system conditions.
Requirements Volatility	Software Engineering Practice	Treat frequent, substantive change in a system's requirements as a measurable churn rate matched against the team's absorption capacity, then flatten Boehm's cost-of-change curve so late changes force only local rework rather than cascading redesign.
Residual neural network	Deep LearningNeural Network Architectures	A deep feedforward neural architecture built from blocks that learn residual transformations added to identity or projected skip paths, improving optimization of very deep models.
Residue number system	Computer Arithmetic	A numeral representation encoding an integer as its residues modulo a set of pairwise coprime moduli.
Resolution Proof Compression by Splitting	Automated ReasoningProof Compression	A post-processing algorithm that splits a resolution refutation on a chosen variable into complementary branch proofs, recombines them by resolution, and retains the result when it reduces proof size.
Resolution-Proof Redundancy	Automated ReasoningProof Compression	A propositional resolution proof is redundant under a node-count measure when a valid proof from the fixed inputs derives the same or a subsuming root with fewer proof-DAG nodes.
Resource acquisition is initialization	Programming LanguagesCpp Idioms	Resource acquisition is initialization (RAII) is a programming idiom used in several object-oriented, statically typed programming languages to describe a particular language behavior.
Resource leak	Software EngineeringResource Lifecycle Failures	Fail to release an acquired finite computing resource after its logical lifetime, causing retained ownership, exhaustion, or degraded availability across repeated execution.
Retrievability	Information RetrievalDocument Centric Evaluation	A document-centric information-retrieval measure of how broadly and prominently a fixed system exposes an information object across a declared population of queries.
Retrieval Data Structure	Data StructuresStatic Functions	Retrieval Data Structure is a recurring identity in computer science and information systems, formal models and representations, mathematics, logic, and statistics, social sciences, humanities, and arts defined by this frozen evidence: In computer science, a retrieval data structure, also known as static function, is a space-efficient dictionary-like data type composed of a collection of (key, value) pairs that allows the following operations: Construction from a collection of (key, value) pairs Retrieve the value associated with the given key or anything if the key is not contained in the.
Retrieval-augmented generation	Artificial IntelligenceRetrieval Conditioned Language Generation	Retrieve external records for an input, condition a generative model on the selected context, and produce an output whose grounding remains auditable but not guaranteed.
Reverse geocoding	Geographic Information SystemsGeocoding	Resolving a coordinate against geographic data to return a nearby readable place or address label.
Reverse Polish notation	Expression Notation	A postfix expression notation in which each operator follows its operands, eliminating parentheses when operator arities are known and enabling direct stack evaluation.
Reversible computing	Models of Computation	Reversible computing is any model of computation where every step of the process is time-reversible.
Review	Evidence Structure	A structured evaluative artifact linking four slots — an identified evaluator, a bounded object under evaluation, a verdict, and a warrant — into a persisted, addressable record, so evaluative testimony becomes aggregable, citable, and revisable.
Rewriting	Formal Methods	Rule-governed replacement of a subexpression by another expression within a formal object.
Rice's Theorem	Computability Theory	Every non-trivial semantic property of programs — anything depending on the input-output function rather than the source text — is undecidable, proved by a generic reduction from the halting problem, so no exact analyzer for such a property can exist.
Ring network	Computer NetworkingNetwork Topology	A ring network is a network topology in which each node connects to exactly two other nodes, forming a single continuous pathway for signals through each node – a ring.
Role Class Model	Conceptual ModelingObject Oriented Design	An object-modeling pattern that represents a context-dependent role as a separate class linked to a core object, allowing one object to hold multiple concurrent roles with role-specific state and behavior.
Room-Scale Virtual Reality	Virtual Reality	A VR arrangement that maps walking within a tracked physical play area into movement through a virtual environment.
Rope (Data Structure)	Data Structures	A navigable, piece-composed sequence representation that supports local edits without routinely copying the whole sequence.
Round-Robin Scheduling	Operating System SchedulingNetwork Packet Scheduling	A cyclic scheduling discipline that gives each eligible job or queue a bounded service turn, then advances and returns unfinished work to a later cycle.
Round-Trip Conversion	Markup LanguagesDocument Conversion	The term round-trip is used in document conversion particularly involving markup languages such as XML and SGML.
Round-trip engineering	Model Driven EngineeringSoftware Engineering	Round-trip engineering (RTE) in the context of model-driven architecture is a functionality of software development tools that synchronizes two or more related software artifacts, such as, source code, models, configuration files, documentation, etc. between each other.
Routing	Computer NetworkingRouting Protocols	The process of computing and maintaining admissible network paths or next hops from topology, addressing, metrics, and policy so forwarding can deliver traffic toward destinations.
Routing Loop	Network Routing	A destination-specific cycle in installed router next hops that permits a packet to revisit a router instead of reaching its destination.
Rule-Based System	Knowledge Based Systems	A computational system that applies a separable body of domain rules to case data through a reusable rule-application procedure.
Runahead Execution	Out of Order ExecutionLatency Tolerance	Runahead execution checkpoints a stalled processor, pseudo-executes ahead for useful prefetches, then restores state and replays normally.
Running total	ComputationStream Aggregation	A cumulative sum updated incrementally by adding each new observation to the previous total, yielding every prefix sum without recomputing the full sequence.
Runtime Verification	Runtime MonitoringFormal Methods	Check an observed computational execution trace against an explicit behavioral property with a monitor that returns a trace-relative verdict.
S-attributed grammar	Compiler TheoryAttribute Grammars	An attribute grammar using only synthesized attributes, so each parse-tree node's attributes depend solely on its children and can be evaluated naturally during bottom-up parsing.
S-m-n Theorem	—	Effectively specialize a program index by fixing some inputs, producing a new index whose remaining-input behavior exactly matches the original program with those parameters embedded.
S2P (complexity)	Computational Complexity TheoryComplexity Classes	In computational complexity theory, S is a complexity class, intermediate between the first and second levels of the polynomial hierarchy.
Saga Pattern	Distributed Systems	Achieve all-or-nothing semantics across a multi-step operation that no single ACID transaction can span by pairing each local transaction with a forward compensating action, so a failure at step k runs compensations k-1 down to 1 and leaves the system as-if-nothing-happened.
Sample complexity	Computational Learning Theory	Quantify how many observations a learner needs to attain a stated accuracy with a stated confidence under an explicit hypothesis class, data model, and learning criterion.
SATPlan	Automated PlanningArtificial IntelligenceBoolean Satisfiability	An automated-planning method that encodes the existence of a bounded-length action sequence as a Boolean satisfiability formula, calls a SAT solver, and decodes any satisfying assignment into a valid plan.
SC (complexity)	Computational Complexity	The complexity class of decision problems solvable by one deterministic algorithm using polynomial time and polylogarithmic space.
Scale factor (computer science)	Fixed Point ArithmeticNumeric Representation	In computer science, a scale factor is a number used as a multiplier to represent a number on a different scale, functioning similarly to an exponent in mathematics.
Schema-Agnostic Database Access	Semantic Data AccessDatabasesKnowledge Graphs	A query-mediation capability that maps user terminology and structure onto an unfamiliar or changing database schema, constructs executable interpretations, and exposes ambiguity without requiring native vocabulary knowledge.
Scientific visualization	Visual Analytics	Visual representation of scientific data or simulated phenomena to support exploration, explanation and inference.
Scoreboarding	Computer ArchitectureInstruction SchedulingOut of Order Execution	Scoreboarding is a centralized method, first used in the CDC 6600 computer, for dynamically scheduling instructions so that they can execute out of order when there are no conflicts and the hardware is available.
Scratchpad memory	Computer Architecture and Memory Hierarchies	A small, fast memory explicitly managed by software or a processing unit for temporary data, unlike a hardware-managed cache that automatically mirrors selected main-memory contents.
Search Algorithm	Algorithms	Solve a problem by casting it as a state space explored with a frontier-ordering strategy, so completeness, optimality, and cost are read off the strategy's name — and an admissible heuristic buys a narrower search without sacrificing the optimal answer.
Search Problem	Theoretical Computer Science	A computational task that asks for an admissible output witness for each solvable encoded input, rather than only a verdict that one exists.
Second Normal Form	Relational Database Design	A first-normal-form relation schema is in second normal form when every non-prime attribute depends fully on every candidate key.
Secret Sprawl	Information Security	Diagnose a credential's danger not by whether its primary store is locked but by whether its copies have spread into more places than the issuer tracks, so revocability collapses and rotation cost scales with the unknown copy count.
Secure Attention Key (Trusted Path)	Operating System SecurityTrusted Path	A reserved user-invoked attention input that moves a sensitive exchange from an ordinary interface to a distinguishable trusted system path when enabled and correctly handled.
Secure Channel	Cryptographic Network Protocols	A protocol-established session that binds a verified intended peer to traffic keys and protects later traffic for both confidentiality and integrity across an attacker-accessible path.
Segment Protection	Transport NetworksNetwork Survivability	A prearranged alternate path or resource between the ends of a working network-path segment, with a declared protection mode for faults covered in that segment.
Segmentation Fault	Operating Systems and Systems Programming	A synchronous protection fault reported when an executing thread references a virtual address that is unmapped or uses a mapped address contrary to its access permissions.
Selection in Evolutionary Algorithms	Evolutionary ComputationGenetic Algorithms	Selection is a genetic operator in an evolutionary algorithm (EA).
Self-Organizing List	Data StructuresList Update	An ordered sequential-access list that updates item positions from accesses, making earlier requests alter later search costs or position readouts.
Self-organizing map	Machine LearningUnsupervised Competitive Learning	Train prototype vectors arranged on a low-dimensional lattice by repeatedly moving a best-matching unit and its lattice neighbors toward input samples, producing a topology-oriented representation of high-dimensional data.
Self-supervised learning	Machine LearningSelf Supervised Representation Learning	Training a model with supervisory targets derived from the data itself.
Self-Verifying Finite Automaton	Automata TheoryFormal Language Theory	A nondeterministic finite word recognizer whose paths may answer yes, no, or unknown, but always supply at least one consistent yes-or-no certificate per input.
Semantic analysis (compilers)	Compiler Construction	The compiler phase that checks context-sensitive program meaning and annotates parsed syntax before intermediate-code generation.
Semantic Architecture	Software ArchitectureKnowledge Representation	Software-architecture description using explicit machine-interpretable semantics for elements, relations, and constraints.
Semantic compression	Natural Language Processing	Lossy reduction of lexical diversity by replacing expressions with a smaller concept vocabulary while attempting to preserve their meaning.
Semantic gap	Representation Mismatch	The mismatch in meaning between descriptions formed in different representation systems, especially between human contextual concepts and the formal structures available to a computer system.
Semantic Heterogeneity	Information SystemsSemantic Integration	The condition in data integration where independently developed schemas or datasets encode overlapping domains with incompatible meanings, scopes, units, identifiers, or conventions, so syntactic exchange cannot produce correct interpretation without explicit reconciliation.
Semantic integration	Information SystemsData Interoperability	The reconciliation and interrelation of heterogeneous information sources by aligning meanings, entities and contextual assumptions rather than matching syntax alone.
Semantic knowledge management	Knowledge Engineering	Knowledge management that represents content with explicit machine-interpretable concepts and relations so heterogeneous resources can be linked, queried, inferred over, and reused by meaning.
Semantic parsing	Natural Language ProcessingFormal Meaning Representation	The computational task of mapping a natural-language utterance into a machine-interpretable formal meaning representation that supports execution, inference or structured comparison.
Semantic translation	Data Interoperability	Transformation of data between representations by aligning the meanings of source and target elements rather than only their syntax.
Semantic triple	Semantic Web	The atomic RDF statement consisting of a subject, predicate and object that asserts a directed labeled relation in a knowledge graph.
Semaphore (programming)	Concurrent ComputingSynchronization Primitives	A concurrency synchronization object maintaining a nonnegative permit count with atomic wait and signal operations that block or release execution according to resource availability.
Semicomputable function	Computability Theory	A real-valued function on a computable domain that admits a uniform computable sequence of rational approximations converging monotonically from below or from above.
Separating words problem	Automata Theory	The automata problem of finding the smallest deterministic finite automaton that accepts one of two given words and rejects the other.
Sequence Diagram	Software EngineeringBehavioral Modeling	A UML interaction view that orders message send-and-receive occurrences along participating lifelines, using typed messages and interaction fragments to specify permissible traces of a scenario.
Sequence number	Identifier DesignCommunications Protocols	A sequence number is an identifier assigned according to an ordering rule so receivers can distinguish instances, reconstruct order, detect gaps or duplicates, and coordinate state across a stream or collection.
Sequential access	Data Storage	An access mode in which elements are reached in a predetermined order and reaching a later element generally requires traversing earlier positions.
Sequential Coupling	Software Engineering	Bind the correctness or availability of one interface operation to a prior call sequence, creating a temporal dependency that is safe only when the protocol is explicit, enforceable, and aligned with the object's state machine.
Sequential logic	Digital Design	Digital logic whose outputs depend on both current inputs and stored state representing prior input history.
Server-Side Request Forgery	Information Security	Diagnose the web attack in which an attacker-supplied URL makes a server issue a request under its own credentials and network position, by asking whether the issuer of the intent and the carrier of the authority are the same principal.
Service autonomy principle	Service Oriented Architecture	A service-oriented design principle that gives each service maximal practical control over its logic, runtime resources, data, deployment, and change cycle.
Service discovery	Computer NetworkingDistributed Systems	Service discovery is the process of automatically detecting devices and services on a computer network.
Service Layer Pattern	Software ArchitectureService Oriented Architecture	Service layer is an architectural pattern, applied within the service-orientation design paradigm, which aims to organize the services, within a service inventory, into a set of logical layers.
Service Provider Interface	Software Interfaces	A service-provider interface lets interchangeable backend modules supply a shared service through a declared implementer contract and discovery or dispatch layer.
Service refactoring	Service Oriented ArchitectureService Design Patterns	Change the internal logic or implementation of an existing service while preserving its published contract and consumer-observable behavior.
Service-Oriented Programming	Software Design	A programming approach that builds application behavior from encapsulated in-memory service units, their interfaces, and their composition.
Set Cover Problem	Combinatorial OptimizationComputational ComplexityApproximation Algorithms	Given a finite universe and a family of subsets whose union is that universe, the optimization problem of selecting the fewest subsets that still cover every element, or the decision problem of whether a cover of size at most k exists.
Set splitting problem	Computational Complexity	The decision problem of two-coloring a finite set so every member of a specified family contains both colors.
Set theoretic programming	Programming Languages	A programming paradigm that treats sets, relations, mappings, and high-level set operations as primary data and control abstractions.
Shannon–Hartley Theorem	Information TechnologyChannel Capacity	Compute a noisy channel's maximum error-free bit rate as C = B·log₂(1 + S/N), a bound that is at once a wall no code can beat and a target codes can approach, linear in bandwidth but only logarithmic in signal-to-noise.
Shape analysis (digital geometry)	Digital Geometry	The computational representation, measurement and comparison of geometric form independently of irrelevant pose, sampling and sometimes scale.
Shape analysis (program analysis)	Program AnalysisHeap Analysis	A static-analysis family that infers the possible topology, sharing and reachability of dynamically allocated heap structures across program executions.
Shape from focus	Computer Vision	A three-dimensional reconstruction method that estimates scene depth from how image focus or defocus changes across a stack of differently focused views.
Shared memory	Concurrent and Parallel Computing	A memory region or address-space resource that multiple execution agents can access for communication or coordinated computation.
Shared-image stateless nodes	Networked SystemsDiskless Provisioning	Locally executing networked nodes use a centrally maintained system image while durable system or user data resides outside each replaceable node.
Sharp Satisfiability (#SAT)	Computational Complexity	The counting problem that maps a Boolean formula to the exact number of truth assignments satisfying it, refining SAT's yes/no question into a model count.
Shelving buffer	Computer ArchitectureSuperscalar Processors	A shelving buffer is a technique used in computer processors to increase the efficiency of superscalar processors.
Short Integer Solution Problem	Lattice Based Cryptography	Find a nonzero short integer vector in a stated matrix's modular kernel.
Shortest path problem	Graph Algorithms and Combinatorial Optimization	The optimization problem of finding a path between specified graph vertices whose accumulated edge or path weight is minimal among all admissible paths.
Shortlex order	Formal Language Theory	A total order on finite sequences that compares length first and lexicographic position second.
Signed number representations	Computer Arithmetic	Encoding schemes that map positive, zero and negative numbers into fixed-width digit patterns without an external sign symbol.
Signedness	Programming Language Integer Semantics	A programming-language type property that determines whether an integer representation and its operations include negative values or instead use a nonnegative modular range, affecting conversions, comparison, overflow, and interfaces.
Significant whitespace	Programming Language SyntaxOff Side Rule	An off-side rule language is also described as having significant indentation.
SIGTRAP	Operating SystemsPosix Signals	Signals are standardized messages sent to a running program to trigger specific behavior, such as quitting or error handling.
Simple Precedence Grammar	Compiler Theory	Use conflict-free precedence relations between grammar symbols to locate reducible handles.
Single instruction, multiple data	Computer Architecture	A parallel-computing organization in which many processing lanes perform the same instruction simultaneously on different data elements.
Single-Responsibility Principle	Object Oriented Design	A module should have exactly one reason to change — read as one external change-driver, not one function — so that aligning each boundary with a single driver keeps every edit's blast radius contained.
Site Multihoming by IPv6 Intermediation	Computer NetworkingInternet Protocols	The Site Multihoming by IPv6 Intermediation (SHIM6) protocol is an Internet Layer defined in RFC 5533.
Skew Heap	Data StructuresPriority Queues	A self-adjusting meldable min-heap that joins heap-ordered binary trees along their right paths and swaps merge-path children without stored balance ranks.
Skip list	Data StructuresProbabilistic Data Structures	In computer science, a skip list (or skiplist) is a probabilistic data structure that allows \mathcal O(\log n) average complexity for search as well as \mathcal O(\log n) average complexity for insertion within an ordered sequence of n elements.
SL (complexity)	Computational ComplexitySpace Complexity Classes	The complexity class Symmetric Logspace, equivalently problems log-space reducible to undirected s–t connectivity and, by Reingold's theorem, equal to deterministic logspace L.
Sleeping barber problem	Concurrent ComputingSynchronization Problems	A classic synchronization problem modeling one service worker, a bounded waiting room and arriving clients to illustrate mutual exclusion, blocking and coordination without lost wakeups.
Small Subgroup Confinement Attack	Cryptographic ProtocolsCryptanalysis	A cryptographic attack that feeds a small-order group element into a secret-dependent operation, restricting its outcomes and potentially leaking secret information when group validation is absent.
Small-bias sample space	Theoretical Computer SciencePseudorandomness	A compact distribution on binary strings whose parity over every nonempty coordinate subset differs from uniform by at most ε, providing pseudorandomness against linear tests.
Smallest grammar problem	Grammar Based CompressionCombinatorial Optimization	Find the least-cost straight-line grammar that generates exactly one specified string.
Smallest-Circle Problem	Computational GeometryGeometric Optimization	The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing circle problem) is a computational geometry problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.
Smart Contract	Distributed LedgersProgrammable Transactions	Executable protocol rules can return information or conditionally change shared state without necessarily constituting a legal contract.
Smart number	Identifier DesignData Modeling	A smart number is any synthetic unique identifier that communicates additional information about the entity identified.
Social Machine	Web Science	A sociotechnical process whose output is jointly constituted by patterned human participation and computational mediation, so neither the platform nor the participant population alone implements the operative machine.
Social Semantic Web	Web ComputingSocial Semantic Systems	Build machine-interpretable web knowledge through scalable human participation, so contribution produces semantic structure and that structure improves the value and coordination of later participation.
Social VPN	Computer NetworkingPeer to Peer NetworksNetwork Security	A peer-to-peer virtual private network whose authenticated membership and public-key discovery are derived automatically from declared social-network relationships, while encrypted IP traffic is carried through an overlay.
Social Web	Social Computing	The Web layer in which people, their social relations, user-created objects, and interaction activities become addressable network resources whose visibility and propagation are jointly shaped by software and social rules.
Soft Heap	Data Structures and Algorithms	A meldable priority queue permits a bounded number of keys to rise, making the minimum current key cheap to find while the client tracks possible original-order error.
Soft reference	Garbage CollectionMemory Management	A soft reference is a reference that is garbage-collected less aggressively.
Software Architecture	—	Software architecture is the consequential structural organization of a software system into elements, responsibilities, interfaces, dependencies, deployment and data relations, together with the principles and decisions governing its evolution and quality attributes.
Software architecture recovery	Software Architecture and Reverse EngineeringSoftware Maintenance	Reconstructing a software system's architectural components and relationships from code or observed behavior.
Software bus	Interprocess CommunicationEnterprise Application Integration	A shared software mediation arrangement connects independent participants through bus-facing interfaces and routes their messages or calls without requiring one physical channel or one wire format.
Software Component	Component Based Software EngineeringSoftware Engineering	A bounded, deployable or integrable software unit that encapsulates a coherent responsibility and interacts with a larger system through declared provided and required interfaces.
Software Coupling	Software Design	A dependency across software-module boundaries in which a relevant change to one module's contract, data, behavior, or mirrored logic can require coordinated change in another.
Software Entropy	Code Quality and Maintainability	Read a codebase's growing structural disorder as a predictable gradient under continuous modification: locally expedient edits flow toward the vast basin of working-but-disordered states, and order decays monotonically unless restoring engineering effort is continuously reinjected.
Software framework	Software Engineering	Reusable software structure that coordinates an application while developers supply defined extensions.
Software inspection	Software Quality Assurance	Software inspection is a defined peer-review process in which trained reviewers search work products for defects before execution.
Software Interface	Software EngineeringInterface Contracts	A software interface is a defined computational boundary through which software components, processes, users through software, or software and devices exchange operations, data, events, or resources under explicit syntax, semantics, state, compatibility, and error contracts.
Software quality assurance	Software EngineeringQuality Management	Planned process-level activities that establish, monitor and audit standards, methods and evidence so software work products and engineering practices meet defined quality requirements.
Software Regression	Software EngineeringSoftware Testing and Maintenance	A change-linked software failure in which behavior or performance that met a prior accepted baseline no longer does so, although the relevant expectation remains in force.
Software Review	Software Quality AssuranceSoftware Engineering	A criterion-bearing examination of a software work product by designated stakeholders to identify defects, assess status or compliance, and produce comments, approval, or action decisions.
Software-Architecture Style	Software ArchitectureArchitectural Styles	A software-architecture style is a reusable family of system organizations defined by characteristic component and connector kinds, dependency directions, interface rules, deployment or resource boundaries, and constraints that license system-level reasoning and tradeoffs.
Software-defined data center	Data Center VirtualizationCloud Computing	A data-center architecture concept in which compute, storage, networking, and security resources are virtualized, pooled, policy-controlled, and provisioned through software as services rather than configured mainly as isolated hardware.
Software-Defined Protection	Network SecuritySecurity Architecture	A layered network-security architecture separating traffic enforcement, protection-policy generation, and administrative orchestration across coordinated enforcement, control, and management layers.
Solid Modeling	Geometric ModelingComputer Aided Design	The computational representation of three-dimensional objects as valid volumetric regions with unambiguous interior, boundary, exterior, and physically meaningful operations and queries.
Solomonoff Induction	Theoretical Computer ScienceAlgorithmic Information Theory	Predict a continuation by Bayesianly mixing every computable generative hypothesis, giving shorter programs greater prior weight, with universality and convergence purchased at the cost of incomputability.
Sorted Array	Ordered Data Structures	A sorted array keeps comparable keys in contiguous index order, enabling binary-search lookup and contiguous ranges while making middle updates costly.
Sorting Algorithm	Algorithms	A computational procedure that rearranges a finite sequence into a specified total order, located in a coordinate space of complexity, stability, and memory, and bounded below by the Ω(n log n) decision-tree floor for comparison-based sorts.
Space Hierarchy Theorem	Theoretical Computer ScienceComputational Complexity	A complexity separation theorem showing that sufficiently larger constructible workspace bounds decide strictly more languages, in deterministic and nondeterministic forms.
Spaghetti Code	Software Engineering Maintenance	Diagnose a codebase as unmaintainable by reading its dependency graph: when boundary-violating edges accumulate past a threshold, the cost of any local change scales with the whole system rather than the unit being changed.
Sparse Distributed Memory	Associative MemoryHigh Dimensional Computing	Retrieve binary data through overlapping Hamming neighborhoods of sparsely realized hard locations whose counters hold distributed traces of stored words.
Sparse language	Computational ComplexityLanguage Density	A formal language containing at most polynomially many strings of each input length, regardless of how difficult membership may be to decide.
Spatial architecture	Spatial AcceleratorsDataflow Architectures	A computing organization that maps operations and dataflow across an array of processing elements with direct inter-element communication.
Speculative Generality	Code Quality and Maintainability	Diagnose a design that carries flexibility for imagined future variation not yet justifying its cost by pricing each abstraction as an unexercised option — with no named consumer, credible timeline, or second concrete instance, it is overhead masquerading as foresight.
Spherical Linear Interpolation	Computer GraphicsComputer Animation	Interpolation along a selected great-circle arc whose angular distance from the starting point varies linearly with the interpolation parameter.
Split-Brain Problem	Distributed Systems Consensus	The distributed-systems failure where a network partition splits a replicated cluster into subsets that each elect themselves as write authority and accept divergent writes; guard against it by enforcing that at most one subset — the quorum majority — may write.
SPQR Tree	Graph Algorithms	A canonical tree representation of a biconnected graph's decomposition at separation pairs, whose S, P, Q, and R skeletons expose series, parallel, edge, and rigid triconnected structure and reconstruct the graph through paired virtual edges.
Square-Root Sum Problem	Theoretical Computer ScienceExact Numerical Computation	The exact decision problem of comparing a binary-encoded sum of square roots of positive integers with an integer or competing radical sum, whose unresolved bit complexity turns nonzero separation from zero into the central computational resource.
Stable Model Semantics	Logic Programming	Interpret a normal logic program by retaining exactly the candidate atom sets reproduced by the least model of their own negation-free reduct.
Stable Sort	Sorting Algorithms	If a stable sorting algorithm is used in both cases, the sort-by-class-section operation will not change the name order; with an unstable sort, it could be that sorting by section shuffles the name order, resulting in a nonalphabetical list of students.
Stack-Based Memory Allocation	Memory ManagementRuntime Systems	If a region of memory lies on the thread's stack, that memory is said to have been allocated on the stack, i.e. stack-based memory allocation (SBMA).
Star height problem	Formal Language Theory	The formal-language problem of determining the minimum nesting depth of Kleene stars needed to express a regular language and how that depth can be decided.
State (computer science)	Stateful Systems	In information technology and computer science, a system is described as stateful if it is designed to remember preceding events or user interactions; the remembered information is called the state of the system.
State management	User Interface ProgrammingFrontend Development	State management refers to the management of the state of one or more user interface controls such as text fields, submit buttons, radio buttons, etc. in a graphical user interface.
State space (computer science)	—	The set of all possible system configurations together with transitions permitted between them.
Statement (computer science)	Programming LanguagesLanguage Semantics	A programming statement is a complete language-defined construct whose rules give it a runtime or compile-time role, from evaluation or branching to a null operation or scope directive.
Static single-assignment form	Compiler Design and Program Analysis	A compiler intermediate representation in which every variable name has exactly one definition and phi functions merge values from alternative control-flow predecessors.
Static Variable	Programming Language SemanticsVariable Storage and Lifetime	A program variable backed by one owner-associated storage cell retained across repeated activations or instances, with its initialization, lifetime, visibility, linkage, and sharing boundary fixed by the programming language's static-variable regime.
Stationary Subspace Analysis	Machine LearningBlind Source SeparationTime Series Analysis	A blind-source-separation method that finds linear projections of a multivariate time series whose distributional statistics remain stable across epochs and complementary projections that capture nonstationary change.
Steensgaard's algorithm	Program AnalysisPointer Analysis	A near-linear, flow-insensitive pointer analysis that models assignments as equality constraints and merges points-to equivalence classes with union–find.
Steering Law	Human Computer InteractionHuman Motor Performance	An empirically calibrated human-movement law relating continuous bounded-path traversal time to the integral of reciprocal local corridor width.
Stereotype (UML)	Software Modeling	A UML profile mechanism that specializes an existing metaclass with domain-specific semantics, tagged values and notation.
Stochastic Petri net	Performance Modeling	A Petri net whose enabled transitions fire after random delays governed by assigned rates or distributions.
Stored-program computer	Computer Architecture	A computer design in which a processor fetches instructions from an internal program store, with code and data held in shared or separate memory.
Straight-Line Grammar	Grammar Based CompressionFormal Language Theory	A straight-line grammar (SLG) is a formal grammar that generates exactly one string.
Strangler Fig Pattern	Legacy Migration Patterns	Replace a legacy system incrementally in place by fronting it with a stable interception layer, rerouting one validated request path at a time to the replacement, and retiring the legacy once nothing routes to it.
Stream Abstract Data Type	Functional ProgrammingType Theory	A lazy, potentially infinite sequence abstraction whose elements are produced on demand through a head-and-tail interface, commonly defined coinductively and consumed by guarded or incremental computation.
Stream Processing	Distributed Systems	Compute over data as it arrives — one record or small time-window at a time — under a bounded-latency commitment, decoupling when an event happened from when it arrived and using a watermark to decide when a time window is safe to close and emit.
Stream Tee Duplication	Stream and Pipeline Processing	A stream operation that forwards each accepted item to at least two branch interfaces without partitioning the input sequence.
Stream X-Machine	Software TestingModels of Computation	The Stream X-machine (SXM) is a model of computation introduced by Gilbert Laycock in his 1993 PhD thesis, The Theory and Practice of Specification Based Software Testing.
Streaming Media	Distributed Media	Deliver timed audio or video while a receiver presents earlier portions and depends on later usable material or signal arriving.
STRIDE Model	Software Security	Enumerate software threats across Spoofing, Tampering, Repudiation, Information disclosure, Denial of service, and Elevation of privilege against a concrete system model.
String (computing)	Programming LanguagesData Types	In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.
String kernel	Machine LearningKernel Methods	A positive-semidefinite similarity function on variable-length symbol sequences that enables kernel learning through implicit substring or subsequence features.
String-to-String Correction Problem	String Algorithms	Find the minimum total cost of transforming one symbol string into another by permitted single-symbol edits.
Strong connectivity augmentation	Graph AlgorithmsConnectivity Augmentation	Add the fewest or least-cost directed edges to a digraph so every vertex can reach every other, with the unweighted optimum governed by source and sink components of the condensation DAG.
Strong Consistency	Distributed Systems Consistency Models	Guarantee that every read of a replicated store reflects the most recently completed write and all clients see one real-time-consistent total order (linearizability), so the system can be reasoned about as a single copy — bought with a coordination round and partition-time unavailability.
Strong NP-completeness	Computational Complexity	In computational complexity, strong NP-completeness is a property of computational problems that is a special case of NP-completeness.
Strongly-polynomial time	Algorithm AnalysisComputational Complexity	A complexity notion requiring polynomially many arithmetic operations independent of numeric magnitudes.
Stropping (syntax)	Programming Language Design	A programming-language notation technique marking character sequences so keywords or special identifiers occupy a namespace distinct from ordinary names.
Structural Risk Minimization	Statistical Learning TheoryModel Selection	Select a predictor from capacity-ordered model classes by balancing training loss against a justified class-dependent bound on generalization risk.
Structural type system	Programming LanguagesType Systems	A static type discipline in which compatibility or subtyping is determined by the members and shapes a value provides rather than by declared type names or ancestry.
Structure chart	Software DesignStructured Design	A structure chart (SC) in software engineering and organizational theory is a chart which shows the smallest of a system to its lowest manageable levels.
Structured analysis	Software Engineering	A systems-analysis method modeling required data transformations and control responses through hierarchical data-flow and related structured diagrams.
Structured Concurrency	Concurrent ProgrammingProgramming Languages	A concurrency discipline that confines child tasks to lexical scopes with clear lifetime, cancellation, and error-propagation rules so no task outlives its owner unnoticed.
Structured entity relationship model	Data Modeling	An entity–relationship extension that organizes large data schemas through existence dependencies and structured entity types.
Structured storage	File FormatsCompound Documents	Structured storage is a compound-file organization that stores hierarchies of storage objects and byte streams inside a single file, allowing components to manage nested persistent data independently.
Stylometry	Computational Linguistics	Quantitative inference about authorship or style from measured patterns in language or other symbol-producing behavior.
Subdivision surface	Computer Graphics	A smooth limit surface generated by repeatedly refining a coarse polygonal control mesh with a fixed local subdivision rule.
Subgraph Isomorphism Problem	Theoretical Computer ScienceGraph Algorithms	Determine whether a target graph contains a structure-preserving copy of a pattern graph by finding an injective vertex mapping that preserves required adjacency, optionally also non-adjacency.
Subject reduction	Programming Language Metatheory	The type-preservation property that evaluation of a well-typed expression cannot change or destroy its assigned type.
Substring	Formal Languages and String Algorithms	A string value occurring as a contiguous factor of a host, including the empty value by convention.
Subtyping	Programming Language TheoryType Theory	In programming language theory, subtyping (also called subtype polymorphism or inclusion polymorphism) is a form of type polymorphism.
Suffix Tree	String AlgorithmsData Structures	A compressed trie of every suffix of a text, turning exact substring search into a root-path walk and occurrence reporting into a read of descendant suffix positions.
Sun–Ni Law	Parallel ComputingPerformance Modeling	Estimate scaled parallel speedup when usable memory capacity bounds workload growth, with Amdahl and Gustafson recovered as special choices of an application-specific growth factor.
Superblock (file system)	File SystemsPersistent Storage Formats	A format-governed persistent global record whose parameters let a reader interpret an enclosing filesystem and determine supported operation.
Superdistribution	Digital Rights Management	A digital-distribution model in which protected content is freely copied between users while authorization, payment or usage rights are enforced separately at consumption time.
Superquadrics	Geometric Modeling	A parameterized family of three-dimensional shapes that generalizes quadrics by replacing squared coordinate terms with adjustable powers, producing rounded, boxlike or pinched forms.
Swap regret	Online Learning and Game Theory	The cumulative improvement available in hindsight from consistently replacing every occurrence of each chosen action with a possibly different alternative action.
Swish function	Machine LearningActivation Functions	A smooth neural-network activation family fβ(x)=x·sigmoid(βx) that interpolates between a scaled linear map and a ReLU-like gate while remaining mildly nonmonotonic for positive β.
Switched fabric	Computer NetworkingInterconnect Architecture	Switched fabric or switching fabric is a network topology in which network nodes interconnect via one or more network switches (particularly crossbar switches).
Switching lemma	Circuit Complexity and Boolean Functions	A random-restriction theorem showing that a bounded-width CNF or DNF Boolean formula usually simplifies to a shallow decision tree and can therefore switch to the opposite normal form.
Symbolic Execution	Program Analysis	Execute a program over symbolic inputs, carrying symbolic stores and branch predicates so that each feasible path represents a class of concrete runs and a solver can recover witnessing inputs.
Symbolic trajectory evaluation	Formal VerificationModel Checking	Symbolic trajectory evaluation (STE) is a lattice-based model checking technology that uses a form of symbolic simulation.
Symmetric level-index arithmetic	Computer Arithmetic	A numerical representation and arithmetic system using signed nested logarithmic levels to span extremely large and small magnitudes.
Symmetric-Key Cipher	Cryptography	Symmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext.
Symmetry-breaking constraints	Constraint ProgrammingSymmetry Reduction	Additional constraints in a satisfaction or optimization model that retain at least one representative from each symmetry orbit while excluding equivalent assignments, reducing redundant search without changing feasibility up to symmetry.
Synchronous context-free grammar	Computational Linguistics	A paired grammar whose productions simultaneously rewrite linked nonterminals in two strings or trees, encoding structural correspondences and reorderings.
Synchronous Data Flow	Dataflow Models of Computation	A fixed-token-rate actor graph whose channel balance and feasible periodic execution can be analyzed before it runs.
Tacit Programming	Programming Languages	Defines a function without naming its data arguments, using a primitive or language-defined function-building forms.
Tagged architecture	Computer ArchitectureMemory Protection	Tagged architecture attaches type, permission, provenance, capability, or other metadata to machine words or memory objects and makes hardware operations interpret or enforce those tags during execution.
Tagged union	Programming Languages and Data Representation	Represent a value as exactly one member of a fixed family of payload alternatives together with a discriminator that records the active alternative and governs safe elimination or pattern matching.
Task Computing	Pervasive Service Computing	A pervasive-computing approach that maps a user's task to discoverable semantically described services, composes them, and executes the resulting workflow.
TC (Complexity)	Circuit ComplexityComputational Complexity Theory	The threshold-circuit complexity hierarchy whose level TC^i contains languages decided by polynomial-size, unbounded-fan-in Boolean circuit families of depth O(log^i n) with threshold or majority gates, and whose union over fixed i is TC.
TCP congestion control	Computer Networking	The end-to-end control system by which TCP adjusts its sending window in response to inferred network congestion.
Teaching dimension	Computational Learning TheoryMachine Teaching	The maximum, over concepts in a class, of the smallest labeled example set that uniquely identifies each concept to a learner when examples are chosen by a helpful teacher.
Technology Provisioning	Service ActivationIdentity Lifecycle	Technology provisioning maps an approved service or identity request into configured target-system state and manages that state as the request changes.
Temporal logic of actions	Formal Methods	Specify state-machine behaviors with predicates over states, actions over current and next states, temporal operators, and explicit stuttering invariance for concurrent-system reasoning.
Temporal Process Language	Concurrency Theory	A timed process calculus extending CCS with multiparty synchronization on an abstract global clock signal.
Temporary Field	Code Quality and Maintainability	The code smell in which an object carries an instance variable meaningful only during one operation or state yet visible as permanent structural state everywhere — a mismatch between the field's structural scope (every instance) and its validity scope (the subset where it holds a real value).
Tensor Product Network	Connectionist Cognitive Modeling	Represent structured symbolic bindings in a connectionist system by tensor-multiplying filler vectors with role vectors, superposing the products, and recovering a filler by contracting the representation with an appropriate dual role.
Terminating Reliable Broadcast	Distributed ComputingReliable Broadcast	A fault-tolerant distributed-broadcast specification requiring all correct processes eventually to decide the same delivered value or a distinguished sender-failure value despite crash failures.
Ternary search	Optimization Algorithms	An interval-reduction search for the extremum of a unimodal function that compares two interior points and discards the third of the domain that cannot contain the optimum.
Textual Case Based Reasoning	Artificial IntelligenceCase Based Reasoning	A case-based method that uses text-bearing past cases to retrieve relevant experience or reuse it for a new problem.
Thin-film memory	Computer EngineeringMagnetic Computer Memory	Magnetic computer memory whose addressable bit sites are patterned thin ferromagnetic films coupled to drive and sense conductors.
Third normal form	Relational Database Design	A relational-database normal form in which every nontrivial functional dependency has a superkey determinant or a prime dependent attribute, eliminating problematic transitive non-key dependencies.
Thompson's Construction	Formal Languages	A compositional conversion of a classical regular expression into a language-equivalent ε-NFA.
Thrashing	Memory Management	Repeatedly evict still-needed units from a fast memory tier, forcing costly refetches that displace useful computation.
Thread pool	Concurrent Software	A concurrency pattern that reuses a bounded set of worker threads to execute tasks drawn from a queue instead of creating a new thread for every task.
Thread-local storage	Concurrent Programming	A storage mechanism giving each execution thread its own instance of a variable that otherwise has static or global lifetime and access syntax.
Threat model	Computer SecuritySecurity Architecture and Risk Analysis	Represent a scoped system's assets, trust boundaries, adversary capabilities, plausible adverse paths, assumptions, impacts, and response priorities as a revisable security-decision artifact.
Tier 1 Network	Internet Interdomain Routing and Peering	An autonomous Internet network that obtains global route reachability without buying transit, using customer routes and settlement-free peering with the other provider-free core networks.
Time-sharing	Operating System SchedulingHistory of Computing	Sharing finite processor time by alternating execution intervals among runnable tasks or users.
Time-Utility Function	Real Time Scheduling	A function that assigns an application-specific utility to completing an action at each possible time, generalizing deadlines so schedulers can optimize accrued value rather than timeliness alone.
Top-down parsing language	Formal GrammarsParsing	A minimal analytic formal grammar whose nonterminals act like recursive-descent parsing functions that either fail without consuming input or succeed while consuming a prefix, using ordered limited backtracking in rules of the form BC/D.
Topological Sorting	Graph Algorithms	Produce a linear order over the nodes of a directed acyclic graph so every edge runs forward — every dependency before its dependent — by repeatedly emitting any node with no unmet prerequisite, well-defined exactly when the graph has no cycle.
Tornado Code	Coding Theory	A layered sparse-graph erasure code that performs most encoding and peeling recovery with fast XOR constraints, then protects a much smaller residual layer with a denser outer code.
Total functional programming	Programming LanguagesTermination Guaranteed Functional Programming	Restrict functional programs to total functions whose evaluation is defined and terminating for every input admitted by their types.
Tournament sort	AlgorithmsComparison Sorting	A comparison-sorting algorithm that organizes elements in a tournament tree, repeatedly outputs the winner and updates only the path affected by its replacement.
Tractable Problem	Computational Complexity TheoryAlgorithm Analysis	Tractable problems are frequently identified with problems that have polynomial-time solutions ( \textsf{P} , \textsf{PTIME} ); this is known as the Cobham–Edmonds thesis.
Transactional memory	Concurrency ControlParallel Computing	The goal of transactional memory systems is to transparently support regions of code marked as transactions by enforcing atomicity, consistency and isolation.
Transclusion	Hypertext Systems	The dynamic inclusion of content stored in one document within another document by reference rather than by copying.
Transdichotomous model	Analysis of AlgorithmsModels of Computation	In computational complexity theory, and more specifically in the analysis of algorithms with integer data, the transdichotomous model is a variation of the random-access machine in which the machine word size is assumed to match the problem size.
Transfer learning	Machine Learning	A machine-learning strategy that reuses representations, parameters or examples learned in a source task or domain to improve learning in a related target task.
Transfer-Learning Attack	AI Security	Vulnerabilities, backdoors, or poisoned representations baked into an upstream pretrained model ride intact into every downstream system built on it, because the downstream team's audit boundary encloses only its new layers while the attack surface spans the whole inherited substrate.
Transition system	Theoretical Computer ScienceFormal Verification	In theoretical computer science, a transition system is a state machine that may have infinite states.
Transport layer	Computer Networking	The protocol-stack layer that provides end-to-end application communication services such as multiplexing, reliability, ordering, flow control and congestion response over network delivery.
Transposition cipher	CryptographyClassical Ciphers	A classical cipher that permutes plaintext symbol positions according to a key while preserving the symbol multiset, unlike substitution which changes symbol identities.
Tree (abstract data type)	Data Structures	A hierarchical abstract data type of nodes linked by parent–child relations, with one root and a unique parent for every other node.
Tree (Data Structure)	Data Structures	The computer-science container for rooted, single-parent, acyclic hierarchies whose recursive type lets every algorithm decompose as act-at-the-root, recurse-on-each-subtree, combine — with operation cost governed by one quantity, the tree's height.
Tree rotation	Data Structures	A local binary-tree restructuring that preserves in-order key order while changing parent-child shape.
Tree Sort	Algorithms and Data Structures	A comparison-sorting method that inserts items into a search tree and emits them by in-order traversal, making output order depend on the tree invariant and runtime depend on tree height.
Tree toplology	Computer NetworkingNetwork Topology	A tree topology, or star-bus topology, is a hybrid network topology in which star networks are interconnected via bus networks.
Trellis quantization	Video CodingRate Distortion Optimized Transform Quantization	Choose a block's quantized transform-coefficient sequence by searching a trellis whose states capture coding context and whose path cost combines distortion with estimated coded rate, rather than rounding coefficients independently.
Trie	Data Structures	A tree of symbol-labelled edges storing a set of strings so that every root-to-node path spells a prefix and strings sharing a prefix share a path, answering prefix queries in time proportional to the query length alone, independent of how many strings are stored.
Trigram tagger	Natural Language ProcessingPart of Speech Tagging	In computational linguistics, a trigram tagger is a statistical method for automatically identifying words as being nouns, verbs, adjectives, adverbs, etc. based on second order Markov models that consider triples of consecutive words.
Trusted Timestamping	CryptographyDigital Signatures	Trusted timestamping is the process of securely keeping track of the creation and modification time of a document.
Truth-table reduction	Computability TheoryReducibility and Degree Structures	Reduce membership in one decision problem to a finite, nonadaptive batch of oracle queries whose answer bits are combined by an input-computable Boolean truth table.
Truthful cake-cutting	Algorithmic Game Theory and Fair Division	The design of fair-division mechanisms for a heterogeneous divisible resource in which truthful reporting of valuations is an optimal strategy for participants.
Turing degree	Computability Theory	An equivalence class of sets or decision problems under mutual Turing reducibility, representing one level of relative computability.
Turing Machine	Theory of Computation	The canonical formal model of computation — finite control plus an unbounded read-write tape governed by a finite transition function — whose one unbounded resource is the tape, and against which computability and complexity are given exact, provable meaning.
Turing tarpit	Programming Language Design	A computationally universal language or interface whose lack of useful abstractions makes ordinary tasks disproportionately difficult to express and maintain.
Turmite	Theoretical Computer Science	A two-dimensional Turing-machine model whose oriented finite-state agent reads and rewrites grid cells while turning and moving locally.
Two Generals' Problem	Distributed Consensus and Coordination	Prove that no finite exchange of messages can make two parties certain they agree when any single message might be lost, because the last message in any protocol is itself unacknowledged.
Two-phase commit protocol	Distributed Transactions and Databases	A distributed atomic-commit protocol in which a coordinator first collects durable prepare votes and then tells every participant to commit or abort the transaction.
Type Error	Type SystemsProgramming Languages	A detected mismatch between a program term's assigned or inferred type and the type required by the operation or context in which the term is used.
Type Inference	Programming Language Theory	Algorithmically reconstruct the types of expressions from their usage context rather than from annotations, by generating an equality constraint at each syntactic form and solving them by unification to return either each expression's principal (most general) type or a genuine type error.
Type signature	Programming Languages	A formal declaration of the input types, output type, and sometimes constraints, effects, or calling structure of a program entity.
Type System	Programming Language Theory	A discipline that assigns every value and expression a type and uses that classification to constrain which operations may legally apply, verifying via compositional typing rules that well-typed programs cannot reach a wrong-kinded state (soundness).
Type theory	Logic and Computation	The family of formal systems that classify expressions by types and govern how typed terms may be formed, transformed and interpreted.
Typed assembly language	Programming LanguagesTyped Low Level Code	A low-level instruction language augmented with machine-checkable types for registers, memory, code pointers, stacks and heaps, allowing native code to carry a static proof of specified safety properties.
Typing Environment	Type SystemsProgramming Languages	In statically typed programming languages, these environments are used and maintained by typing rules to type check a given program or expression.
U-Form	Distributed Data Modeling	A mutable attribute–value object whose immutable universally unique identifier separates continuing object identity from changeable data and distinguishes distributed replicas from copies.
U-Net	Deep LearningImage Analysis	A multiscale convolutional architecture that contracts spatial features, expands them toward dense predictions, and fuses aligned features from corresponding contracting levels.
UI Data Binding	Software Design PatternsGui Development	UI data binding is a software design pattern to simplify development of GUI applications.
UML Profile	Software and Systems ModelingUml Extensibility	Package a coherent, additive customization of UML as stereotypes, extensions, properties, constraints, and supporting definitions that apply domain vocabulary to standard UML model elements without replacing their UML identity.
Unambiguous finite automaton	Automata Theory	In automata theory, an unambiguous finite automaton (UFA) is a nondeterministic finite automaton (NFA) such that each word has at most one accepting path.
Unambiguous Turing machine	Computational Complexity	A nondeterministic Turing machine with at most one accepting computation path on each input, regardless of how many rejecting branches it has.
Unary language	Formal Language Theory	A formal language over a one-symbol alphabet, equivalently encoding a set of natural numbers by string length.
Unbounded nondeterminism	Concurrency Theory	A concurrency-model behavior in which a computation may make an unboundedly delayed or infinitely branching choice while fairness can still require eventual progress.
Uncertain Database	Database Theory	A database representation whose semantics admit multiple possible ordinary instances and define query answers across them.
Undefined Behavior	Programming LanguagesLanguage Standards	A programming-language case for which the governing specification imposes no requirements on implementation behavior.
Unicode Collation Algorithm	Internationalized Text Processing	Map Unicode strings, under a declared collation table and settings, into canonical-equivalence-safe multilevel weights or sort keys whose comparison yields the selected linguistic or application order.
Unidirectional data flow	Software Architecture	A software-state architecture in which events trigger state changes in one direction and views derive from the resulting immutable or controlled state rather than mutating it bidirectionally.
Unified process	Software EngineeringSoftware Development Process	A customizable iterative software-development framework organized around use cases, architecture, early risk reduction, and four lifecycle phases from inception through transition.
Uniform function call syntax	Programming Language DesignCall Syntax and Name Resolution	Allow an eligible free-function call f(x, y, ...) to be written in receiver form x.f(y, ...), preserving the resolved callable while exposing a uniform chainable surface syntax.
Uniform Memory Access	Computer Architecture	A shared-memory processor domain with no local-versus-remote main-memory placement tier.
Uniform Resource Identifier	Internet ArchitectureWeb Resource Identification	Identify a resource through a federated scheme-governed character sequence whose generic syntax separates scheme, hierarchical part, query, and fragment roles.
Uniform-grid spatial bin index	Computational GeometrySpatial Data Structures	A flat regular-grid index that retrieves local spatial candidates for exact relation or distance checks.
Unique Name Assumption	Knowledge RepresentationDescription LogicsDatabases	A semantic assumption that distinct individual names denote distinct entities, making the interpretation of names injective within the formal reasoning system.
Unique set size	Operating System Measurement	The portion of a process’s resident memory backed by pages private to that process and therefore expected to be reclaimed if it terminates.
Uniqueness type	Type SystemsFunctional Programming	Uniqueness types are implemented in functional programming languages such as Clean, Mercury, SAC and Idris.
Unit of Work	Software Design PatternsObject Relational Persistence	A software persistence pattern that tracks all database-affecting changes made during one business transaction and coordinates their final write as a consistent whole.
Unit testing	Software Testing	Checking a bounded software unit against expected behavior with repeatable test cases.
Unix Domain Socket	Operating SystemsInterprocess Communication	Unix Domain Socket is a recurring operating systems, interprocess communication identity in which processes on one Unix-like host exchange streams, datagrams, or sequenced packets through a local socket namespace.
Urgent Computing	High Performance Computing	Emergency-oriented computing that secures prompt high-performance resources and delivers a decision-relevant result before its operational value expires.
URL	Internet Architecture and Identifiers	A Uniform Resource Identifier that identifies a resource through a scheme-specific description of how and where it can be accessed.
URL Redirection	Web ArchitectureRequest Routing and Resource Migration	Route a navigation or request from a source URL to a distinct target URL by returning or executing a redirect instruction whose permanence, method handling, cache behavior, and trust boundary govern the follow-up request.
User interface	Human Computer InteractionHuman System Interaction	Provide the perceptible controls, representations, mappings, and feedback through which a person directs an interactive system and interprets its changing state.
Van Jacobson TCP/IP Header Compression	Network Protocols	A stateful link protocol that compresses TCP/IP headers by transmitting small changes relative to a synchronized connection context.
Variable Elimination	—	An exact factor-based inference algorithm that removes nonquery variables one at a time by combining their incident factors and summing or optimizing them out, with complexity controlled by elimination order.
Variable-Length Encoding	Coding Theory	Assign source symbols codewords of unequal lengths under an explicit decodability rule, trading average length against parsing complexity, error propagation, synchronization, and source-model mismatch.
Variable-order Bayesian network	Probabilistic Graphical Models	A Bayesian-network model whose parent set for a variable can change according to the realized context of preceding variables.
Variadic Function	Programming Language SemanticsFunction Calls	A programming-language callable that admits a variable number of positional arguments and gives its body a language-defined way to access them.
Vector Addition System	Theoretical Computer ScienceConcurrency and Verification	An infinite-state transition system whose configurations are nonnegative integer counter vectors and whose finitely specified steps add integer displacement vectors only when no counter would become negative.
Vector Graphics	Computer GraphicsDigital Imaging	Images are specified as coordinate-defined geometric objects that can be edited and rendered for different output conditions, rather than as one fixed pixel grid.
Verifiable Computing	CryptographyVerifiable Computation	Delegated computation that returns an output plus evidence enabling a client to check the specified result substantially more cheaply than recomputing, under explicit soundness and trust assumptions.
Version control	Software Engineering	Track every change to a corpus of diff-amenable artefacts as atomic, authored, parent-pointed commits forming an append-only DAG, making history a first-class object over which branching, merging, reverting, blame, and bisect become routine graph queries.
Very long instruction word	Computer ArchitectureCompiler Technology	Encode software-scheduled groups of operations so a processor can issue independent work to multiple functional units in parallel.
View model	Systems Architecture	An architecture-description framework that defines a coherent set of viewpoints for representing one system to different stakeholder concerns.
Virtual address space	Operating Systems and Memory Management	The process-visible range of virtual memory addresses that an operating system maps, protects and backs independently of the machine's physical-address layout.
Virtual circuit	Computer Networking	A packet-network service that establishes logical connection state and a path or label mapping before data transfer, while statistically multiplexing physical links rather than reserving a dedicated circuit.
Virtual class	Programming Languages	An object-oriented language feature whose nested member class can be overridden so its runtime identity varies with the enclosing object’s dynamic type.
Virtual Desktop	Human Computer Interaction	Expand a graphical workspace beyond one physical screen by retaining windows in multiple switchable contexts or in a larger logical surface and exposing only the selected viewport at a time.
Virtual file system	Operating Systems	An operating-system abstraction layer that presents a uniform file and directory interface over multiple concrete local, remote or synthetic file systems.
Virtual finite-state machine	Control Software Engineering	An executable software specification that models a control system through named input conditions, virtual states, transitions and output actions.
Virtual function	Programming Languages	An overridable object-oriented method whose implementation is selected at runtime from the actual receiver type.
Virtual memory	Computer SystemsOperating System Memory Management	Give each process a protected logical address space by translating virtual addresses to physical storage and managing residency, protection, sharing, and replacement independently of the program's apparent contiguous memory.
Visual hull	Computer Vision	The maximal three-dimensional shape consistent with a set of calibrated object silhouettes, formed by intersecting their back-projected silhouette cones.
Visualization (graphics)	Information VisualizationComputer Graphics	The deliberate construction of images, diagrams, maps, plots, or animations to encode information for communication, reasoning, or exploration.
Volume mesh	Computer GraphicsMesh Generation	In 3D computer graphics and modeling, a volumetric mesh is a polyhedral representation of the interior region of an object.
Volumetric path tracing	Computer GraphicsLight Transport Rendering	A Monte Carlo rendering method that samples light-transport paths through scattering and absorbing participating media as well as surfaces.
Wang B-machine	Computability TheoryModels of Computation	A four-instruction, mark-only sequential tape machine—left, right, mark, and conditional jump—that retains Turing-complete computational power without a primitive erase operation.
Warranting theory	Computer Mediated Communication	A theory that observers give greater credence to information about a person when the person has less ability to manipulate that information.
Weak reference	Programming Languages and Memory Management	A managed reference that can locate an object while not preventing a garbage collector from reclaiming that object when no sufficiently strong reachability path remains.
Weak Symbol	Linkers and LoadersObject File Formats	A weak symbol denotes a specially annotated symbol during linking of Executable and Linkable Format (ELF) object files.
Web of Trust	Cryptographic IdentityOpenpgp Public Key Authentication	A decentralized OpenPGP authentication model in which a relying party combines peer certifications of key–identity bindings with locally assigned introducer trust to determine which bindings it will treat as valid.
Web services protocol stack	Distributed Computing	A layered collection of transport, messaging, description and discovery protocols that makes network services interoperable.
Web-Oriented Architecture	Web Service ArchitectureSoftware ArchitectureDistributed Systems	A software architecture style that exposes composable services or resources through Web identifiers, HTTP interactions, and transferable representations.
Well-founded semantics	Logic Programming	A unique three-valued semantics for general logic programs that assigns each ground atom true, false or undefined.
Wildcard Character	—	A reserved metacharacter denotes an underspecified character or sequence under a particular pattern language's matching or expansion rules.
Winner Determination	Combinatorial AuctionsAlgorithmic Mechanism Design	An equivalent problem in the context of combinatorial auctions is called the winner determination problem.
Winner-take-all (computing)	Neural NetworksNeural Computation	Winner-take-all (computing) names a recurring computing and information systems identity with specialized roles and obligations not carried by the frozen neighbors.
Witness set	Computational Learning Theory	A set of input points whose labeled values distinguish one Boolean function or concept from every rival in a declared class.
Word embedding	Natural Language Processing	A learned vector representation of words or tokens in which geometric relations encode patterns of distributional or task-specific similarity.
Word-sense disambiguation	Computational LinguisticsLexical Semantics and Contextual Interpretation	Select the contextually intended sense of an ambiguous word from a declared sense inventory, while keeping inventory granularity and annotation uncertainty separate from model accuracy.
Work systems	Information Systems	A sociotechnical system in which people and machines perform processes with information and technology to produce products or services for customers.
Working Set	Operating Systems	Estimate a running process's current memory demand as the distinct pages referenced within a moving process-time window, and use that demand to govern residency and load.
Working set size	Computer Performance Engineering	Working-set size is the memory footprint of the input and intermediate data required to solve a particular problem instance.
Wormhole switching	Computer Networking	A network flow-control method that divides a packet into flits and pipelines them through successive routers while the header reserves the path.
X + Y Sorting	Algorithms and Data StructuresSorting	The structured problem of ordering every pair from two numeric collections by its coordinate sum, while preserving the full Cartesian product and its duplicate sums.
Xcast	Computer Networking	An explicit multi-unicast packet-delivery scheme that places the complete small-group destination list in each packet so routers need no persistent per-session multicast state.
XOR gate	Digital LogicCombinational Gates	A digital logic gate that outputs true exactly when an odd number of its binary inputs are true, implementing exclusive disjunction and two-input inequality.
Yannakakis Algorithm for Acyclic Joins	Database Theory	Evaluate an alpha-acyclic relational join by propagating semijoins up and down a join tree to remove every dangling tuple, then joining or enumerating the reduced relations with input-plus-output cost for a fixed full query.
Yield (multithreading)	ConcurrencyOperating Systems	In computer science, yield is an action that occurs in a computer program during multithreading, of forcing a processor to relinquish control of the current running thread, and sending it to the end of the running queue, of the same scheduling priority.
Yo-Yo Leader-Election Algorithm	—	A distributed leader-election protocol repeatedly propagates minimum identifiers forward through an oriented graph and returns yes/no decisions backward to eliminate candidates and prune the graph.
Yo-yo Problem	Object Oriented DesignSoftware Testing	A single object's inherited call path repeatedly crosses class levels, making its behavior difficult to reconstruct from any one method definition.
Z-Order Curve	Spatial Data Structures	Linearize a quantized multidimensional grid by interleaving coordinate bits into a Morton code, making every quadtree or octree cell a contiguous one-dimensional key interval while preserving locality imperfectly.
Zero-shot learning	Machine Learning	A learning setup that predicts classes absent from training by transferring through auxiliary semantic descriptions or attributes shared with seen classes.
Zero-Touch Provisioning	Network ManagementDevice Provisioning	Automatically apply a preassigned initial configuration or management enrollment when an eligible device first starts, replacing manual per-device programming at deployment.
Zero-trust architecture	Cybersecurity ArchitectureIdentity and Access Management	Zero-trust architecture requires every access request to be explicitly authenticated, authorized, and continually evaluated from identity, device, resource, and context signals without granting implicit trust from network location or prior admission.
Zombie process	Operating SystemsUnix Process Management	A terminated Unix child process whose process-table record and exit status remain until its parent waits and the kernel reaps it.
Zooko's Triangle	Network Naming	A contested network-naming design triangle weighs human-readable names, secure binding, and decentralized control under explicit trust and namespace assumptions.