n
Someone who or something which performs arithmetic addition; a machine for adding numbers.
n
(computing theory) A formula giving the theoretical speedup in latency of the execution of a task at fixed workload that can be expected of a system whose resources are improved.
n
(programming) An object that waits for the completion of an asynchronous task.
n
(statistics) Any method or instance of estimating properties of an estimator (such as its variance) by measuring those properties when sampling from an approximating distribution.
n
Alternative spelling of call graph [(computing) A directed graph that represents relationships between called and calling subroutines in a computer program, used in code analysis.]
n
(science fiction) A chain of events in which someone or something time travels to the past as a means to fulfill their role in the history exactly as it already happened, thus implying impossibility to change the past.
n
Alternative form of /dev/null [(computing) A device file, present in Unix and Unix-like operating systems, that discards all data written to it and yields no output.]
n
(computer science) The subtree of a tree structure that is determined by an attribute of a parent node.
n
A mechanism in a system that monitors performance inputs rather than outputs, and reacts so as to maintain a specified state, thus preventing or minimising problems before they occur.
v
(transitive) To carry out hypercomputation.
n
(computing) A heuristic search method that automates the selection of other heuristics.
adj
(programming) Of or relating to a means of serializing a concurrent program so that it can be debugged as though it were sequential, before converting it back to concurrent form.
n
(programming) Any recursion that continues without end.
n
(computing, programming) An instance of in-line expansion.
v
(computing) to perform or repeat an action on each item in a set
n
(programming) In functional programming, a composable abstraction for incrementally processing sequentially-presented chunks of data in a purely functional fashion.
n
(computing) The use of repetition in a computer program, especially in the form of a loop.
adj
Of a procedure that involves repetition of steps (iteration) to achieve the desired outcome; in computing this may involve a mechanism such as a loop.
n
(programming) A method capable of performing the same action on every item in a collection.
n
(computing) Any of a variety of computing techniques that delay the computation of expressions until (and unless) the results are needed.
n
Alternative form of Linus' Law [(software engineering) A claim about software development that states that “given enough eyeballs, all bugs are shallow”.]
n
(computing) A structure consisting of nested structures, such as nested loops or nested subroutine calls.
adj
(computing) (of an application) Programmed using a no-code development environment.
n
(computing theory) A technique for program optimization by specialization, so as to produce new programs which run faster than the originals while guaranteed to behave in the same way.
n
(computing) Instantiation into multiple independent instances.
n
(computing) The part of a COBOL program containing all the instructions that the computer is to execute
n
(computing, rare) An extension, enrichment or continuation of a declaration of a function.
n
(programming) The invocation of a procedure from within itself.
adj
(computing, not comparable) of a program or function that calls itself
n
(computing) Any function that uses recursion and can call itself until a certain condition is met.
adj
(programming) That may be executed more than once at a time either by different threads, or because of recursion.
n
(statistics) Any technique or instance of generating a new sample from an existing dataset.
n
A pattern-matching algorithm for implementing production rule systems, used to determine which of the system's rules should fire based on its data store.
n
(computing theory) The situation where a logic circuit uses multiple full adders to add n-bit numbers, with each full adder taking the output of the previous one as an input.
n
(computing) A simple data compression scheme in which sequences of the same item are replaced by one such item and a count (so for example the text BBBBB is stored as a single B with count of 5).
adj
(programming) Executed as a sequence of instructions, without concurrency or parallelism.
n
(programming) An array in which most of the values are zero.
n
A situation where, by moving only upwards or downwards through a hierarchical system, one finds oneself back where one started. These loops often involve self-reference and paradox.
n
A loop making up part of another loop.
n
(computing) A form of peephole optimization that typically uses an exhaustive brute-force search across all possible sequences of machine instructions.
n
A combinatorial search technique used to solve optimization problems by tracking and guiding the search.
adj
(programming) Employing tail recursion.
n
(programming, informal) A temporary storage location.
n
(computing, functional programming) A delayed computation.
n
(computing theory) A technique for optimizing loops by partitioning the iteration space into smaller chunks or blocks that will more easily fit in a cache.
n
(chiefly science fiction) A hypothetical or fictional instance of characters living through a set period of time repeatedly until the loop can be broken.
v
(transitive, computing) To change a memory location or range to values of zero; to set a variable in a computer program to zero.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 10 letters and means "Practical approaches prioritizing results, efficiency." Can you find it?