This page gathers the 209 dictionary entries belonging to the domain “Computer”, as labelled by Wiktionary. Each word leads to its full entry: definitions, etymology, pronunciation, examples. Page 2 of 2: from “Liang–Barsky algorithm” to “word”.
- Liang–Barsky algorithm noun A line clipping algorithm that uses the parametric equation of a line and inequalities describing the range of the clipping window to…
- link/cut tree noun A data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time.
- linked list noun A simple linear data structure, each of whose nodes includes a pointer to the next (and sometimes previous) node in the list, enabling…
- log noun Specifically, an append-only sequential record of events written to a file, display, or other data stream.
- loop invariant noun an invariant that should be true on entry into a loop and is guaranteed to remain true on every iteration of the loop
- loose coupling noun A low-level interdependent coupling between program modules.
- machine code noun A system of instructions and data directly understandable by a computer's central processing unit.
- maximax noun A strategy or algorithm that seeks to maximize the maximum possible result (that is, that prefers the alternative with the chance of the…
- megahurt noun megahertz.
- memoization noun A technique in which partial results are recorded (forming a memo) and then can be re-used later without having to recompute them.
- microaddress noun A location or address within the control memory (microcode store) of a microprogrammed control unit, used to fetch or branch to a specific…
- monomorphisation noun In a compiler, the process of converting a polymorphic function to a monomorphic function, by the creation of a specialised function for…
- moob verb To rapidly adjust the evaluation of a position towards zero, indicating a likely draw.
- most significant byte noun The byte of a multibyte number with the greatest importance: that is, the byte stored first on a big-endian system or last on a…
- mouse slip noun An unintentional mouseclick due to jittery or imprecise movement of a mouse.
- multiply noun An act or instance of multiplying.
- natural numbers noun The set of non-negative integers, {0, 1, 2, 3, ...}.
- neededness noun Dependency; the state of one segment of code requiring another segment to complete.
- NEXPTIME noun In computational complexity theory, a complexity class in which the set of decision problems can be solved by a nondeterministic Turing…
- Nicholl–Lee–Nicholl algorithm noun A fast algorithm for line clipping that reduces the chances of clipping a single line segment multiple times.
- NNUE noun A type of neural network able to run on a CPU, trained to evaluate a board game (usually chess or shogi) position.
- nonconcurrency noun A property of systems where several processes execute sequentially, not at the same time.
- nondeterminism noun The property of being nondeterministic, involving arbitrary choices; necessitating the choice between various indistinguishable…
- nondeterministic polynomial time noun A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or…
- nondeterministic Turing machine noun A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the…
- norm noun A sentence with non-descriptive meaning, such as a command, permission, or prohibition.
- NTIME noun In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic…
- one-way adj Of a function: easy to compute for every input, but hard to invert given the image of a random input.
- ontology noun A structure of concepts or entities within a domain, organized by relationships; a system model.
- or conj A lexical symbol to implement inclusive or in a computer language.
- pageable adj Able to be paged in and paged out.
- parselet noun A small modular parsing object or routine (particularly in a Pratt parser) that handles a particular syntactic construct.
- partial adj Describing a property that holds only when an algorithm terminates.
- partial application noun The process of fixing a number of arguments to a function, producing another function of smaller arity.
- pathological adj Having properties that cause unusually bad behaviour, especially regarding correctness or performance.
- persistence noun Of data, the property of continuing to exist after the termination of the program.
- positioning time noun Random-access time: the time required to move the hard disk arm to the desired cylinder (seek time) and for the desired sector to rotate…
- precertificate noun A special type of SSL/TLS certificate used in Certificate Transparency (CT) for logging purposes. It's a precursor to the actual SSL/TLS…
- prestate noun The state that exists before an operation.
- primitive type noun A data type provided by a programming language as a basic building block, such as integer, character or Boolean.
- processing unit noun An electrical component (digital circuit) that performs operations on an external data source, usually memory or some other data stream.
- prune verb To remove unnecessary branches from a tree data structure.
- pruning noun A method of enumeration that allows the cutting out of parts of a decision tree.
- pseudo-polynomial time noun A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input.
- pseudoconsciousness noun A state or condition that is not consciousness but seemingly or nearly approaches it or simulates it.
- pumping lemma noun A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section…
- quadratic time noun A time algorithm in which given an input of size n, the number of steps required to complete a task is the square of n.
- Rabin-Karp algorithm noun A string-searching algorithm that uses hashing to find an exact match of a pattern string in a text.
- randomized polynomial time noun The complexity class of problems for which a probabilistic Turing machine exists with certain properties.
- reap verb To terminate a child process that has previously exited, thereby removing it from the process table.
- reduce verb To express the solution of a problem in terms of another (known) algorithm.
- regularization noun a process that simplifies results, often used to obtain results for ill-posed problems or to prevent overfitting.
- rewriting noun Any of wide range of potentially non-deterministic methods of replacing subterms of a formula with other terms.
- Robin Hood hashing noun A scheme for resolving hash collisions that favors the displacement of the element that is farthest from its home location.
- rope noun A data structure resembling a string, using a concatenation tree in which each leaf represents a character.
- running time noun Of an algorithm, the length of time required for it to run as a function, depending on the number of operations executed.
- scalar adj Consisting of a single value (e.g. integer or string) rather than multiple values (e.g. array).
- schedule noun An allocation or ordering of a set of tasks on one or several resources.
- scheduler noun An operating system component responsible for allocating several resources, most commonly the use of processors by different concurrent…
- segment tree noun A data structure that is used to store information about intervals (segments) and perform range queries, or queries on a set of intervals…
- selection noun The stage of a genetic algorithm in which individual genomes are chosen from a population for later breeding.
- semantics noun The meaning of computer language constructs, in contrast to their form or syntax.
- semicomputable adj partially computable
- sentinel noun A unique value recognised by a computer program for processing in a special way, or marking the end of a set of data.
- set function noun A mathematical function whose input is a set (usually of real numbers or a set of points in the Euclidean or some measure space), and whose…
- signed adj Having both positive and negative varieties.
- solvable adj Such that the set of inputs for which the answer is yes is recursively enumerable.
- space complexity noun A measure of the amount of space, or memory required by an algorithm to solve a given decision problem. An informal analogy would be the…
- space-time trade-off noun A case where an algorithm or program trades increased space usage with decreased time, in which space refers to the data storage consumed…
- sparse table noun A data structure that can answer range maximum or range minimum queries on an immutable list of values in constant time, and other range…
- square root decomposition noun A technique that can reduce the runtime of an algorithm by a factor of √ (where n is the size of the input) by dividing the input into √…
- stable adj That maintains the relative order of items that compare as equal.
- stable marriage problem noun The problem of finding a stable matching between two equal-sized sets of elements, given an ordering of preferences for each element.
- startword noun A string of letters that identifies the beginning of a valid sequence in a specified language.
- starvation noun A state where a process is perpetually denied necessary resources to process its work.
- state space noun A (mathematical) space of all possible states of a system or process.
- stateless adj Of a system or protocol, such that it does not keep a persistent state between transactions.
- string distance noun Any of several metrics that represent the degree of similarity between two strings of characters, based on the smallest number of…
- submachine noun A part of a real or virtual machine which acts as a machine in its own right.
- subprocedure noun A procedure that can be called by higher-level procedures as part of their operation.
- subsequence noun A subset of an array with the same ordering.
- supercombinator noun A mathematical expression which is fully bound and self-contained. It may be either a constant or a combinator where all the subexpressions…
- switch noun A command line notation allowing specification of optional behavior.
- synchronization domain noun In the context of thread synchronization, a collection of contexts and objects that share a single lock.
- syntax error noun An error in the syntax of a sequence of characters or tokens that is intended to be written in a particular programming language.
- text simplification noun An operation used in natural language processing to modify, enhance, classify or otherwise process an existing corpus of human-readable…
- thesis noun A conjecture, especially one too vague to be formally stated or verified but useful as a working convention.
- time algorithm noun An algorithm which specifies the amount of time required to solve a problem as a function of its input size.
- time complexity noun The amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms…
- time hierarchy theorem noun A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they…
- time scale noun The ratio of the duration of time of an event as simulated by an analog computer to the actual duration of time of the event in the…
- time-loop logic noun A hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with…
- time-space complexity noun The combination of the measure of the amount of time and space in which an algorithm requires to run or solve a given decision problem.
- topological sort noun An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering.
- tractable adj Algorithmically solvable fast enough to be practically relevant, typically in polynomial time.
- treap noun A type of randomized binary search tree where nodes are labelled with randomly chosen priority values and which is simultaneously a heap on…
- trie noun An ordered tree data structure that is used to store an associative array where the keys are usually strings.
- Turing degree noun A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given…
- typing noun The assignment of data types for variables.
- ulp noun The value that the least significant digit of a floating-point number represents, used as a measure of accuracy in numeric calculations.
- unary adj Of an operation, function, procedure, or logic gate, taking exactly one operand, argument, parameter, or input; having domain of dimension…
- unification noun An algorithmic process of solving equations between symbolic expressions.
- upstream adj In the direction from the client to the server.
- value restriction noun In a functional language, inference of a polymorphic type only for syntactic values (values that can be evaluated at compile time) to…
- van Emde Boas tree noun A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional…
- VSS noun virtual switching system
- wavelet matrix noun A type of data structure that represents a sequence of or the process of sorting elements while allowing query operations.
- white space noun A contiguous collection of one or more characters that each represents horizontal or vertical space in typography.
- word noun A finite string that is not a command or operator.