Computer Science & Software Engineering

50 primes originate from Computer Science & Software Engineering. 72 more draw from it as a secondary origin.

Primary members (50)

Primes whose canonical origin is Computer Science & Software Engineering.

• Abstract Data Type — Specify a component by its externally observable behaviour while suppressing its implementation, so any conforming implementation is interchangeable behind the contract.
• Access Control — Restrict system access.
• Algorithm — Step-by-step problem-solving procedure.
• Caching — Store for faster retrieval.
• Calibrated Rule versus Moving World — A rule, model, or policy fitted to a past distribution of the world degrades as the world it was calibrated on drifts away from that distribution.
• Complexity (Time/Space) — Resource scaling with input size.
• Concurrency — Manage simultaneous processes.
• Confirmation Dialog — An enforced pause and re-affirmation inserted before an irreversible action.
• Consensus Problem
• Data Integrity — Accuracy and consistency preserved.
• Deadlock — Mutual blocking processes.
• Decidability Computability — A class of yes/no questions admits a finite procedure that always terminates with the correct answer.
• Denormalization — Deliberately re-introduce controlled redundancy against a canonical form, trading a synchronization burden for access-side wins.
• Dependency — Directed relation in which one element relies on another being present, prior, compatible, or supplied, with a specifiable failure mode if the condition is unmet.
• Evaluative Rating — Compress an evaluative judgment into a position on a shared ordered scale that downstream actors can act on without re-examining the evidence.
• Fault Tolerance — Continue operating under failure.
• Future Or Promise — A first-class placeholder for a value committed to be supplied later.
• Fuzzing — Generating inputs from a wider-than-designed distribution to surface latent failures.
• Hashing — Deterministically reducing any object to a short fixed-size token used as its handle.
• Higher Order Function — Treating a rule itself as a first-class object that other rules consume or produce.
• Immutability — State that cannot be modified after creation.
• Indirection — Introduces intermediary references.
• Interference and Contention — Competing demands for shared bottleneck degrade throughput.
• Interoperability — Systems function together.
• Iteration — Repeats steps to refine outcomes.
• Latency — The irreducible delay between an input and the system's response.
• Layering — Segments systems into levels.
• Lazy Evaluation — Defer work until its result is actually demanded.
• Load Balancing — Distributing work across resources so none is overloaded.
• Locality Of Reference — Accesses cluster in time and space, making prediction and caching effective.
• Message Passing — Autonomous holders of private state interact only through discrete addressed messages over intermediating channels.
• Mutual Exclusion — Guarantee that at most one party occupies a designated state or resource at a time.
• Observable Surface Becomes Contract — Every observable behaviour, exposed to enough observers over enough time, becomes a binding dependency regardless of the nominal contract.
• Open-Closed Principle — Harden a stable kernel against modification and route all change through an open extension surface.
• Pipeline — Sequential processing stages.
• Premature Optimization — Committing local refinement effort before global structure is known pays both search-cost and rigidity-cost without the information to spend either well.
• Principle of Least Privilege — Granting each component only the minimum authority its function requires bounds the blast radius of its compromise or error.
• Recursion — Breaks processes into self-similar steps.
• Search and Retrieval — Locate and extract information.
• Sharding — Partition a load across owners by a stable key-to-shard function.
• Side Effect — An action's change to shared state beyond its declared interface.
• Single Point of Failure — A component on the critical path of every essential function, with no parallel route, that caps the whole system's reliability at its own.
• Stack — A strictly nested discipline where what was opened last must close first.
• Standardization — The act or process by which independent parties converge on a single shared specification, format, or interface — agreement on a common norm rather than the benefits that follow from it.
• State and State Transition — Captures system condition and evolution.
• Stovepipe System — Capabilities built as parallel vertical stacks that each re-implement shared concerns, with no horizontal layer between them, are locally efficient but globally incoherent and pay a super-linear integration tax.
• Technical Debt — A present expedient choice imposes a future cost that compounds with system growth until it is paid down, with a principal, an interest payment, and a pay-down.
• Transaction — All-or-nothing operations.
• Versioning — Tracks incremental changes over time.
• Virtualization — Abstracts physical resources.

Also draws from Computer Science & Software Engineering (72)

Primes whose canonical origin is elsewhere, but who list Computer Science & Software Engineering among their alternate origin domains.

• Aggregation — Deliberately collapsing many items into a single summary, choosing which information to discard to gain tractability.
• Attention — The selective allocation of a fixed processing capacity to some inputs while the rest are filtered out, surfacing scarcity upstream of every decision.
• Bottleneck — The single limiting stage that caps an entire system's throughput.
• Branch and Bound — Systematic search with pruning.
• Buffering — A maintained intermediate capacity that absorbs excess and releases it during shortfall, smoothing variation and decoupling a source from a consumer whose rates do not match.
• Calibration — Aligning a system's output to a trusted reference by measuring deviation, adjusting to reduce it, and monitoring for drift.
• Classification — Sorting entities into discrete categories by explicit rules, turning unbounded variation into a finite, reusable map for downstream reasoning and action.
• Compatibility — The relational condition under which two or more entities can coexist or compose without breakage, interference, or contradiction.
• Competition — Rivalrous pursuit of a scarce prize where one party's gain is another's loss.
• Complexity — Measures system intricacy.
• Compression — Reduce redundancy.
• Controlled Reentry — Re-establishing a suspended activity or state through staged, monitored steps with the capacity to abort, because returning to normal is a separate engineered process and not a simple reversal of the exit.
• Cooperation — Agents bear individual costs to produce a shared benefit.
• Coordination — Aligning independently controlled actors so their separate actions combine into a coherent collective outcome despite distributed decision-making and incomplete shared information.
• Correlation — Systematic co-variation between variables, distinct from causation.
• Coupling — Interdependence among subsystems.
• Decision — Committing to one alternative from a set under uncertainty and trade-off, collapsing open deliberation into a chosen path and foreclosing the others.
• Decomposition — Breaking a whole into parts that can be analyzed independently and recombined to reconstitute the whole, making complexity tractable through divide-and-conquer.
• Design Patterns — Reusable solutions.
• Diseconomies of Scale — Rising per-unit cost once scale grows past a point.
• Diversity — Maintaining functionally distinct types within a system so that variation provides resilience and coverage that uniformity cannot.
• Dynamic Programming — Solve via subproblem reuse.
• Economies Of Scope — Cost savings from producing varied outputs together.
• Experimental Design — Structuring an investigation through deliberate intervention, controlled assignment, and measurement so that causation can be distinguished from mere correlation and confounding.
• Fairness — Judging whether an allocation or procedure treats comparable parties impartially according to a defensible standard, given that multiple such standards can conflict.
• Falsifiability — A claim is scientific only if it could in principle be empirically refuted.
• Free Riding — The systematic under-provision that results when individuals can enjoy a non-excludable shared good without contributing proportionately to producing it.
• Governance — The durable architecture of authority, accountability, and decision rights through which a group makes binding collective choices and resolves disputes internally.
• Heuristic — Mental shortcuts.
• Idempotence — Repetition yields same result.
• Information Asymmetry — Parties to an interaction hold unequal private knowledge.
• Information Cascade — The sequential dynamic in which actors copy earlier actors' visible choices and suppress their own private signals, driving collective convergence that can be confidently wrong.
• Interface — A bounded, rule-governed surface across which two systems exchange information or control while hiding their internals, letting each evolve independently behind a stable contract.
• Interleaving — Mixing topics during practice to improve discrimination and retention.
• Maintenance — Sustained preventive work that keeps a system's intended function intact against inevitable degradation, acting ahead of failure rather than repairing after it.
• Markov Decision Processes (MDPs) — Sequential decision-making under uncertainty.
• Mechanism Design — Rule engineering.
• Meta-Symbolic Reflection — Reflect on own rules.
• Modularity — Breaks systems into smaller units.
• Monitoring — Continuously observing a system's state to detect deviation from expected behavior and trigger a response, separating genuine signal from routine noise.
• Network Effect — Value increases with users.
• Ontology — What exists and how entities relate.
• Optionality — The asymmetric value of having a choice—bounded downside, unbounded upside—without obligation to act.
• Overfitting — Poor generalization.
• Path Dependence — Outcomes are shaped by the specific historical sequence of past choices, which lock in consequences and foreclose alternatives that persist despite present incentives to change.
• Pattern Recognition — Identify regularities.
• Platform Design — Extensible core systems.
• Predictive Coding — A system predicts its input and propagates only the prediction error.
• Prioritization — Ordering competing claims on finite resources by a value or urgency metric to produce a ranked sequence of action under constraint, making explicit what gets done first and what does not get done at all.
• Problem Space — Range of possibilities.
• Propagation — The systematic spreading of a signal, effect, or state from a source through a medium or network, where the medium's structure governs how fast it moves, how it attenuates, and which paths it follows.
• Provenance — A documented, traceable record of an entity's origin and successive custody transfers that establishes authenticity and assigns accountability by linking present state back to first known state.
• Quality Control — Checking output against a specification before release and rejecting or reworking non-conforming items, binding process variation to defined tolerances through a measure-compare-act feedback gate.
• Recurrence — The property by which a state, event, or value reappears across time or iterations because the present state depends on prior states, distinct from mere repetition by its measurable lag structure.
• Refinement — Iteratively improving a candidate solution toward adequacy through repeated cycles of evaluation and adjustment that narrow the gap to a target, rather than deriving the answer in one shot.
• Representation — Model complex ideas.
• Reputation — An aggregated signal of past behaviour that shapes how others treat an agent.
• Scalability — Handle growth.
• Scheduling — Organizing tasks over time.
• Self Control — Overriding immediate impulses in service of longer-term goals.
• Sequencing — Deliberately ordering steps under precedence constraints so that the arrangement itself, not just the set of tasks, determines the outcome.
• Simulated Annealing — Probabilistic search escaping local optima.
• Statistical Inference — Reasoning from a finite, noisy sample back to the underlying population or process while explicitly quantifying the uncertainty that sampling introduces.
• Synchronization — The emergence of stable shared timing or phase among independent oscillating processes through local coupling, without any central conductor.
• Texture — The fine-grained surface variation beneath an object's gross form that carries perceptual, material, and emotional information rather than mere decoration.
• Traceability — The infrastructure of bidirectional links that lets any element be followed backward to its origin and forward to its uses, turning opaque processes into auditable, queryable histories.
• Transformation — A rule-governed mapping that restructures an input into a different output, holding certain invariants fixed while altering others.
• Trust — Willingly accepting vulnerability to another party's future behavior under incomplete monitoring, based on positive expectations about their competence and intentions.
• Two-Sided Matching — Forming stable pairings between two sides of a market under each side's preferences.
• Validation — Confirming that an artifact actually solves the intended problem in its real operational context, as distinct from confirming it was merely built to specification.
• Variation Strategies — Deliberately injecting controlled variation into a system and selecting from the results to explore alternatives, accelerate learning, and gain robustness.
• Weak Ties — Distant acquaintances that bridge otherwise separate social clusters.