decommitment

decommitment (countable and uncountable, plural decommitments)

(computing theory, engineering) Deactivation or decommission.


2-3 tree

(computing theory) A tree data structure whose every node with children (internal node) has either two children and one data element, or three children and two data elements; a B-tree of order 3.


2-3-4 tree

(computing theory) A tree data structure whose every node with children (internal node) has either two, three or four child nodes: a 2-node has one data element, and if internal has two child nodes; a 3-node has two data elements, and if internal has three child nodes; and a 4-node has three data elements, and if internal has four child nodes.


B+ tree

(computing theory) An m-ary tree data structure with a variable but often large number of children per node. It can be viewed as a B-tree in which each node contains only keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves.


order statistic tree

en-noun

order statistic tree (plural order statistic trees)

(computing theory) A variant of the binary search tree (or more generally, a B-tree) that supports, in addition to insertion, lookup and deletion, the operations of Select (find the ith smallest element stored in the tree) and Rank (find the rank of element x in the tree, i.e. its index in the sorted list of elements of the tree).


R-tree

(computing theory) A kind of tree data structure used to group objects by nearness of location, representing them by their minimum bounding rectangles in the next higher level of the tree.


X-tree

(computing theory) A data structure based on the R-tree, used for storing data in many dimensions.


Horspool's algorithm

Boyer-Moore-Horspool algorithm
Boyer-Moore-Horspool algorithm#English

(computing theory) Synonym of Boyer-Moore-Horspool algorithm


Boyer-Moore-Horspool algorithm

the Boyer-Moore-Horspool algorithm (canonical)

It was published by Nigel Horspool in 1980, and based on an earlier (1977) algorithm developed by Robert S. Boyer and J. Strother Moore.

(computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text.


Solomonoff induction

posterior probability
posterior probability

(computing theory) A form of induction, involving Bayes' theorem, that derives the posterior probability of any computable theory, given a sequence of observed data.


turmite

Blend of Turing + termite. Coined by Canadian mathematics writer A. K. Dewdney in 1989.

coinage

(computing theory) A two-dimensional variant of a Turing machine in which the head has an orientation in addition to a position and state.


Hilbert R-tree

(computing theory) A kind of R-tree used for multidimensional objects.


PR-tree

(computing theory) Short for priority R-tree.


R+ tree

(computing theory) A kind of R-tree used for geospatial data.


R* tree

(computing theory) A kind of R-tree used for indexing spatial information.


spaghetti sort

Introduced by A. K. Dewdney in a Scientific American column.

(computing theory) A linear-time algorithm for sorting a sequence of items, analogous to standing a number of strands of spaghetti of different lengths upright on a surface and noting the order in which they are encountered when lowering one's hand from above.


WAM

en-noun

WAM (countable and uncountable, plural WAMs)

Warren Abstract Machine
w:Warren Abstract Machine

(computing theory) Initialism of Warren Abstract Machine.


Kleene plus

After Stephen Cole Kleene (1909-1994), American mathematician.

Coordinate term: Kleene star

(logic, computing theory) The plus symbol, +, used as an operator to concatenate one or more strings from a given set, widely used in regular expressions.


Tarski-Kuratowski algorithm

the Tarski-Kuratowski algorithm (canonical)

Named after Alfred Tarski and Kazimierz Kuratowski.

arithmetical hierarchy
arithmetical hierarchy

analytical hierarchy
analytical hierarchy

(computing theory) A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.


Kleene's theorem

Named after mathematician Stephen Cole Kleene.

finite-state machine
finite-state machine

(computing theory) A theorem stating that regular expressions are equivalent to finite-state machines.


Kleene's recursion theorem

en-prop

Kleene's recursion theorem (plural Kleene's recursion theorems)

(computing theory) Either of are a pair of fundamental results about the application of computable functions to their own descriptions. They can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions.


readers-writers problem

en-noun

readers-writers problem (plural readers-writers problems)

(computing theory) Any of a class of problems in which many concurrent threads of execution try to access the same shared resource at one time, with constraints on which threads may read from and write to the resource.


finite automaton

finite automaton (plural finite automata)

finite-state machine
finite-state machine#English

(computing theory) Synonym of finite-state machine


Turing equivalent

(computing theory, of a computing system) Capable of computing precisely the same set of functions as a Turing machine can compute.


Prim's algorithm

Named after computer scientist Robert C. Prim, who rediscovered and published it in 1957.

minimum spanning tree
minimum spanning tree

(computing theory) A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.


Prim-Jarník algorithm

Prim's algorithm
Prim's algorithm#English

(computing theory) Synonym of Prim's algorithm


Jarník's algorithm

It was developed in 1930 by Czech mathematician Vojtěch Jarník.


DJP algorithm

Short for Dijkstra, Jarník, Prim; see the other names and explanations at Prim's algorithm.


linear congruential generator

linear congruential generator (plural linear congruential generators)

(computing theory) An algorithm that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear equation.


Chaitin's algorithm

(computing theory) A bottom-up graph coloring register allocation algorithm that uses cost/degree as its spill metric.


precedence rule

precedence rule (plural precedence rules)

(computing theory, programming) A set of rules specifying the order in which parts of an expression are parsed, especially when parentheses are not present.


quadkey

(computing theory) A key into a quadtree data structure.


Lamport timestamp

Lamport timestamp (plural Lamport timestamps)

Named after the creator, Leslie Lamport.

(computing theory) A timestamp generated by a certain algorithm used to determine the order of events in a distributed system.


Cook-Levin theorem

Named after Stephen Cook and Leonid Levin.

(computing theory) A theorem stating that the Boolean satisfiability problem is NP-complete.


Cook's theorem

Cook-Levin theorem
Cook-Levin theorem#English

(computing theory) Synonym of Cook-Levin theorem


PSPACE

First, the hierarchy theorems tell us that a Turing machine can decide more languages in EXPSPACE than it can in PSPACE.

1997, Michael Sipser, Introduction to the Theory of Computation, Boston, M.A.: PWS Publishing Company, →ISBN, page 313:

(computing theory) The set of all decision problems that can be solved by a Turing machine using an amount of memory which is a polynomial function of the input size.


EXPSPACE

(computing theory) The set of all decision problems that can be solved by a Turing machine using O(2ᵖ⁽ⁿ⁾) units of memory, where p(n) is a polynomial function of the input size.


reheap

en-verb

reheap (third-person singular simple present reheaps, present participle reheaping, simple past and past participle reheaped)

reheaps (present singular third-person)
reheaping (participle present)
reheaped (participle past)
reheaped (past)

(transitive, computing theory) To restructure (a modified binary tree) as a heap.