word

en-noun

word (countable and uncountable, plural words)

desc

Chinese Pidgin English: word, 𭉉 (Chinese spelling)

From Middle English word, from Old English word, from Proto-West Germanic *word, from Proto-Germanic *wurdą, from Proto-Indo-European *wr̥dʰh₁om. Doublet of verb and verve; further related to vrata.

you get more with a kind word and a gun than you do with a kind word alone

(computer science) A finite string that is not a command or operator.

sana

computer science: finite string which is not a command or operator


denotation

en-noun

denotation (countable and uncountable, plural denotations)

From Late Latin dēnotātiō, from Latin dēnotāre (“to denote, mark out”) + -tiō (suffix forming nouns of action), from dē- (“completely”) + notāre (“to mark”); equivalent to denote + -ation.

denotational semantics
denotational semantics

(computer science) Any mathematical object which describes the meanings of expressions from the languages, formalized in the theory of denotational semantics


semantics

semantics (countable and uncountable, plural semantics)

From French sémantique, displacing earlier semasiology. From Ancient Greek σημαντικός (sēmantikós). By surface analysis, semantic + -ics.

file sharing and locking semantics

(computer science) The meaning of computer language constructs, in contrast to their form or syntax.


alphabet

From Middle English alphabete, borrowed from Late Latin alphabētum, from Ancient Greek ἀλφάβητος (alphábētos), from ἄλφα (álpha) and βῆτα (bêta), the names of the first two letters of the Greek alphabet, Α (A) and Β (B), lowercase forms α and β. The Greek names derived from aleph, the name of the Phoenician letter 𐤀 (ʾ, “ox”) and beth, the name of the letter 𐤁 (b, “house”), so called because they were pictograms of those objects, having developed from the Egyptian hieroglyphs F1 (𓃾) and pr (𓉐).
 Doublet of alfabeto.

Let L be a regular language over the alphabet #92;Sigma.

(computer science) A typically finite set of distinguishable symbols.


RAM

Coordinate term: PRAM

(computer science) Acronym of random-access machine.


add

From Middle English adden, from Latin addō (“add, give unto”), from ad (“to”) + dō (“give”).

List the number of adds and multiplies for each of the forms (6) , (7), and (8).

2004, C. K. Birdsall, A. B. Langdon, Plasma Physics via Computer Simulation, page 75:

(computer science) An act or instance of adding.


data structure

(computer science) Any form of storing and organizing data in a computer so that it can be accessed efficiently.


banana

banana (countable and uncountable, plural bananas)

Borrowed from Portuguese banana or Spanish banana, derived from a Niger-Congo language spoken in the Guinea region. Specific derivation is unclear. Possible ancestor or cognate languages include Wolof banaana, Eastern Maninkakan banana, and Vai ꕒꘌꕯ (ɓaana) or ꕒꕌꕯ (ɓaana). However, Ay Baati Wolof (Munro & Gaye, 1997) posits that Wolof banaana is itself derived from Portuguese banana.
The racial slur derives from the notion that they are "Yellow (East-Asian) on the outside, White (Westernized) on the inside".

banánový (corresponding to English attributive use)

(corresponding to English attributive use) banánový

(computer science, colloquial) A catamorphism (from the use of banana brackets in the notation).


ontology

ontology (countable and uncountable, plural ontologies)

Learned borrowing from New Latin ontologia (1606, Ogdoas Scholastica, by Jacob Lorhard (Lorhardus), from Ancient Greek ὤν, ὄντος (ṓn, óntos, “being”), present participle of εἰμί (eimí, “being, existing, essence”) + λόγος (lógos, “account”).
First known English use 1663: Archelogia philosophica nova; or, New principles of Philosophy. Containing Philosophy in general, Metaphysicks or Ontology, Dynamilogy or a Discourse of Power, Religio Philosophi or Natural Theology, Physicks or Natural philosophy, by Gideon Harvey (1636–1702), London, Thomson, 1663.
Popularized as a philosophical term by German philosopher Christian Wolff (1679–1754).

der

(countable, computer science, information science) A structure of concepts or entities within a domain, organized by relationships; a system model.


boom

en-verb

boom (third-person singular simple present booms, present participle booming, simple past and past participle boomed)

booms (present singular third-person)
booming (participle present)
boomed (participle past)
boomed (past)

Onomatopoeic, perhaps borrowed; compare German bummen, Dutch bommen (“to hum, buzz”). The sense "a period of economic growth" is generally taken to derive from the sense "a rapid expansion", although other origins have also been suggested.

It can get fast enough that it's hard to see what flashed on your screen though, so it would be nice if chess engines had a feature of persistently showing you what move they planned to play before they boomed, even if it took less than a second for them to figure it out.

2021 January 23, Bram Cohen, “You're doing computer chess game commentary wrong”, in Medium, archived from the original on 2022-12-06:

In its White game Stockfish had various moments of booming during these long thinks, but these long thinks always ended disappointingly in a slightly lower evaluation than it started with.

2022 April 22, Matthew Sadler, “TCEC Season 22 SuperFinal: Komodo Dragon vs Stockfish”, in TCEC, archived from the original on 2022-12-13:

(computer chess, slang) To rapidly adjust the evaluation of a position away from zero, indicating a likely win or loss.


boom

→ German: Boom

Indonesian: bum

→ Japanese: ブーム (būmu)

→ Polish: boom

→ Russian: бум (bum)

Some chess commentators know to excitedly point out when booms happen but they almost universally are missing out on the next step of explaining what the boom meant.

The evaluation boom and moob continued as Stockfish headed for a queen-rook-knight vs queen-rook-knight position that looked pretty nasty to me!

(computer chess, slang) An instance of booming.


OR

en:lexical symbol to implement inclusive or

(computer science) A lexical symbol to implement inclusive or in a computer language.


arity

en-noun

arity (countable and uncountable, plural arities)

From -ary (taken from unary/binary/ternary [function/operator]) + -ity. Compare adicity and adinity.

(logic, mathematics, computer science) The number of arguments or operands a function or operation takes. For a relation, the number of domains in the corresponding Cartesian product.

(mathematics, computer science) The maximum number of child nodes that any node in a given tree (data structure) may have.


prune

en-verb

prune (third-person singular simple present prunes, present participle pruning, simple past and past participle pruned)

prunes (present singular third-person)
pruning (participle present)
pruned (participle past)
pruned (past)

From Middle English prunen, prounen, proinen, from Old French proignier (“to trim the feathers with the beak”), earlier prooignier, ultimately from Latin pro- ("front") + rotundus (“round”) 'to round-off the front'.

der

(transitive, computer science) To remove unnecessary branches from a tree data structure.


artificial intelligence

en-noun

artificial intelligence (countable and uncountable, plural artificial intelligences)

Coined by American computer scientist and cognitive scientist John McCarthy in 1955, and popularized at the Dartmouth Summer Research Project on Artificial Intelligence, 1956.

kunsmatige intelligensie

intelligence exhibited by an artificial entity

ሠው ሰራሽ ዕውቀት

śäw säraš ʿəwḳät

artificially intelligent → artificially intelligently

Research in the modern science of Artificial Intelligence started only in the 1950's, stimulated by the invention of modern computers. This inspired a flood of new ideas about how machines could do what only minds had done previously.

1988, Marvin Minsky, The Society of Mind:

Intelligence exhibited by an artificial (non-natural, man-made) entity.

(computer science) The branch of computer science dealing with the reproduction or mimicking of human-level intelligence, self-awareness, knowledge, conscience, thought in computer programs.


SO

second-order logic
second-order logic#English

(logic, computer science) Initialism of second-order logic.


switch

→ Gulf Arabic: سويچ (swīč)

→ German: Switch

Perhaps from Middle Dutch swijch (“twig”), first attested in c. 1592. The mechanical device for altering the direction of something sense is first attested in c. 1797, pertaining to pivoted rails on minecart railways, which were once wooden.

камута́тар

system allowing the interconnection of telephone lines

Use the /b switch to specify black-and-white printing.

(computer science) A command line notation allowing specification of optional behavior.


LLC

(computer networking) Initialism of Logical Link Control. (one of the two functions of a NIC.)


scalar

Borrowed from Latin scālāris, adjectival form from scāla (“a flight of steps, stairs, staircase, ladder, scale”), for *scadla, from scandere (“to climb”); compare scale. The mathematics sense was coined by Irish mathematician and astronomer William Rowan Hamilton in 1846.

(computer science) Consisting of a single value (e.g. integer or string) rather than multiple values (e.g. array).


flag

en-noun

flag (countable and uncountable, plural flags)

From Middle English flag, flagge (“flag”), further etymology uncertain. Perhaps from or related to early Middle English flage (name for a baby's garment) and Old English flagg, flacg (“cataplasm, poultice, plaster”). Or, perhaps ultimately imitative, or otherwise drawn from Proto-Germanic *flaką (“something flat”), from Proto-Indo-European *pleh₂- (“flat, broad, plain”), referring to the shape.
Germanic cognates include Saterland Frisian Flaage (“flag”), West Frisian flagge (“flag”), Dutch vlag (“flag”), German Flagge (“flag”), Swedish flagga (“flag”), Danish flag (“flag, ship's flag”). Compare also Middle English flacken (“to flutter, palpitate”), Swedish dialectal flage (“to flutter in the wind”), Old Norse flögra (“to flap about”). Akin to Old High German flogarōn (“to flutter”), Old High German flogezen (“to flutter, flicker”), Middle English flakeren (“to move quickly to and fro”), Old English flacor (“fluttering, flying”). More at flack, flacker.

onomatopoeic

imitative

cog

(computer science) A variable or memory location that stores a Boolean true-or-false, yes-or-no value, typically either recording the fact that a certain event has occurred or requesting that a certain optional action take place.

This will be used as a help message if the user passes in the --help flag, like so: […]

2021, Angel Sola Orbaiceta, Hardcore Programming for Mechanical Engineers, pages 19–2:

(computer science) In a command line interface, a command parameter requesting optional behavior or otherwise modifying the action of the command being invoked.

о́пция

computer science: notation for optional behaviour


log

From logbook, itself from log (above) + book, from a wooden float (chip log, or simply log) used to measure speed.

(computer science) Specifically, an append-only sequence of records written to file.

日誌 /日志

(computer) an append-only sequence of records written to disk


rope

en-noun

rope (countable and uncountable, plural ropes)

→ Irish: rópa

Tok Pisin: rop

From Middle English rop, rope, from Old English rāp (“rope, cord, cable”), from Proto-West Germanic *raip, from Proto-Germanic *raipaz, *raipą (“rope, cord, band, ringlet”), from Proto-Indo-European *h₁roypnós (“strap, band, rope”), from *h₁reyp- (“to peel off, tear; border, edge, strip”).
Cognates
Cognate with Scots rape, raip (“rope”), Saterland Frisian Roop (“rope”), West Frisian reap (“rope, cord”), Dutch roop, reep (“rope, cord, ring, strip, bar”), German Low German Reep (“rope”), Swedish rep (“rope”), Danish reb (“rope”), Icelandic reipi (“rope”), Albanian rrip (“belt, rope”).

der

give him enough rope and he'll hang himself

you'd complain if you were hung with a new rope

(computer science) A data structure resembling a string, using a concatenation tree in which each leaf represents a character.


thesis

Georg Wilhelm Friedrich Hegel
Johann Gottlieb Fichte

From Late Middle English thesis (“lowering of the voice”) and also borrowed directly from its etymon Latin thesis (“proposition, thesis; lowering of the voice”), from Ancient Greek θέσῐς (thésĭs, “arrangement, placement, setting; conclusion, position, thesis; lowering of the voice”), from τῐ́θημῐ (tĭ́thēmĭ, “to place, put, set; to put down in writing; to consider as, regard”) (ultimately from Proto-Indo-European *dʰeh₁- (“to do; to place, put”)) + -σῐς (-sĭs, suffix forming abstract nouns or nouns of action, process, or result). The English word is a doublet of deed.
Sense 1.1 (“proposition or statement supported by arguments”) is adopted from antithesis. Sense 1.4 (“initial stage of reasoning”) was first used by the German philosopher Johann Gottlieb Fichte (1762–1814), and later applied to the dialectical method of his countryman, the philosopher Georg Wilhelm Friedrich Hegel (1770–1831).
The plural form theses is borrowed from Latin thesēs, from Ancient Greek θέσεις (théseis).

der

Senses relating to logic, rhetoric, etc.

(mathematics, computer science) A conjecture, especially one too vague to be formally stated or verified but useful as a working convention.


natural numbers

en-noun

natural numbers pl (normally plural, singular natural number)

LL-Q1860 (eng)-Flame, not lame-natural numbers.wav

(mathematics, computer science) The set of non-negative integers, {0, 1, 2, 3, ...}.


binary

en-adj

binary (comparative more binary, superlative most binary)

more binary (comparative)
most binary (superlative)

From Late Latin bīnārius (“consisting of two”), from Latin bīnī (“two-by-two, pair”). By surface analysis, bin- + -ary.

двайко́вы

being in a state of one of two mutually exclusive conditions such as on or off

Division of reals is a binary operation.

(mathematics, programming, computer engineering) Of an operation, function, procedure, or logic gate, taking exactly two operands, arguments, parameters, or inputs; having domain of dimension 2.


reduce

en-verb

reduce (third-person singular simple present reduces, present participle reducing, simple past and past participle reduced)

reduces (present singular third-person)
reducing (participle present)
reduced (participle past)
reduced (past)

From Middle English reducen, from Old French reduire, from Latin redūcō (“reduce”); from re- (“back”) + dūcō (“lead”). See duke, and compare with redoubt.

(transitive, computer science) To express the solution of a problem in terms of another (known) algorithm.


case dependent

(computer science) Synonym of case sensitive


case sensitive

(computer science) Distinguishing upper- and lower-case letters. Often used in computer science to indicate a distinction is made in comparison or equality of letters based on case. For example, a case-sensitive password will not recognize "Password" and "password" as the same, but a case insensitive comparison would.

závisející na velikosti písmen

distinguishing upper- and lower-case letters

but see unterscheidet/beachtet Groß- und Kleinschreibung

(periphrasis) kis- és nagybetűk különböznek/eltérnek benne


case insensitive

(computer science) Treating or interpreting upper- and lowercase letters as being the same.

hoofdletterongevoelig

treating upper- and lowercase letters as being the same

but see unterscheidet/beachtet Groß- und Kleinschreibung nicht


PRC

Palm Resource Code
Palm Resource Code#English

(computer science) Initialism of Palm Resource Code (the file format for Palm OS applications.)


confluence

From late Middle English confluence, from Late Latin cōnfluentia (“a flowing together, conflux”), from cōnfluēns (present participle of cōnfluō (“to flow or run together”)) + -ia (nominal suffix).

af

present participle of <i class="Latn mention" lang="la">cōnfluō</i> (“to flow or run together”)

(computer science, in rewriting systems) A property describing which terms can be rewritten with other, equivalent terms.


level

en-noun

level (countable and uncountable, plural levels)

→ German: Level

→ Irish: leibhéal

desctree

→ Japanese: レベル (reberu)
→ Korean: 레벨 (rebel)

→ Welsh: lefel

From Middle English level, from Old French livel, liveau m, later nivel, niveau, from Latin libella f (“a balance, a level”), diminutive of libra f (“a balance, a level”); see libra, librate. Doublet of libella and niveau.
The verb is from Middle English levelen, from the noun.

(computer science) Distance from the root node of a tree structure.

taso

computer science: distance from the root node of a tree structure


immediate

en-adj

immediate (comparative more immediate, superlative most immediate)

more immediate (comparative)
most immediate (superlative)

From Old French immediat, from Late Latin immediātus (“without anything between”), from Latin in + mediātus, past participle of mediō (“to halve, to be in the middle”), from medius (“middle”). Equivalent to im- + mediate.

der

(computer science, of an instruction operand) Embedded as part of the instruction itself, rather than stored elsewhere (such as a register or memory location).


unary

LL-Q1860 (eng)-Flame, not lame-unary.wav

From Latin ūnus (“one”) + -ary, on the pattern of binary, ternary, etc.

Negation is a unary operation.

Zadeh’s claim is that if the meaning of an expression (X) can be modeling by a fuzzy membership function variable, then the meaning of an expression such as “very X” is simply a membership function over the same variable determined by applying a unary operator to the membership function for X.

1990, Dominic A. Clark, “Verbal uncertainty expressions: A critical review of two decades of research”, in Current Psychology, volume 9, number 3, →DOI, page 229:

On the other hand, blank spaces should not be used for unary operators such as unary minus (−), address of (&), indirection (*), member access (.), increment (++), and decrement (−−).

2011, Robert Green, Henry Ledgard, “Coding Guidelines: Finding the Art in the Science”, in Communications of the ACM, volume 54, number 12, →DOI:

(mathematics, programming, computer engineering) Of an operation, function, procedure, or logic gate, taking exactly one operand, argument, parameter, or input; having domain of dimension 1.

unární

mathematics, programming: of a function, to take one argument


bifurcation

en-noun

bifurcation (countable and uncountable, plural bifurcations)

(computer science) A command that executes one block or other of commands depending on the result of a condition.


reap

en-verb

reap (third-person singular simple present reaps, present participle reaping, simple past and past participle reaped or (obsolete) reapt)

reaps (present singular third-person)
reaping (participle present)
reaped (participle past)
reaped (past)
reapt (obsolete participle past)
reapt (obsolete past)

From Middle English repen, from Old English rēopan, rēpan, variants of Old English rīpan (“to reap”), from Proto-West Germanic *rīpan, from Proto-Germanic *rīpaną (compare West Frisian repe, Norwegian ripa (“to score, scratch”)), from Proto-Indo-European *h₁reyb- (“to snatch”).

der

Until a child process is reaped, it may be listed in the process table as a zombie or defunct process.

(transitive, computer science) To terminate a child process that has previously exited, thereby removing it from the process table.


tractable

en-adj

tractable (comparative more tractable, superlative most tractable)

more tractable (comparative)
most tractable (superlative)

From Middle English tractable, tractabel, from Latin tractābilis (“that may be touched, handled, or managed”), from tractō (“take in hand, handle, manage”), frequentative of trahō (“draw”).

der

(computer science, of a decision problem) Algorithmically solvable fast enough to be practically relevant, typically in polynomial time.


greedy

en-adj

greedy (comparative greedier, superlative greediest)

greedier (comparative)
greediest (superlative)

Sranan Tongo: gridi

From Middle English gredy, from Anglian Old English grēdiġ (“greedy, hungry, eager”) (cognate West Saxon form grǣdiġ), from Proto-Germanic *grēdagaz (“hungry”), from Proto-Germanic *grēdaz, *grēduz, *grēdô (“hunger”), from Proto-Indo-European *gʰer-. Equivalent to greed + -y.
Cognate with Old Saxon grādag (“greedy”), Dutch graag (“gladly, willingly”), Old High German grātag (“greedy”), Danish grådig (“greedy”), Norwegian Bokmål grådig (“greedy”) (from Old Norse gráðigr (“greedy”), gráði (“greed, hunger”)), Gothic 𐌲𐍂𐌴𐌳𐌰𐌲𐍃 (grēdags, “hungry”). Sanskrit गृद्धि (gṛddhi, “greed”) is a false cognate.

inh

(computer science, of an algorithm) That tries to find the global optimum by finding the local optimum at each stage.


schedule

→ Bengali: শিডিউল (śiḍiul)

→ Cebuano: eskedyul

→ Indonesian: skedul

→ Japanese: スケジュール

→ Korean: 스케줄 (seukejul)

→ Tagalog: iskedyul

Inherited from Middle English cedule, from Middle French cedule (whence French cédule), from Old French cedule, from Late Latin schedula (“papyrus strip”), diminutive of Latin scheda, from Ancient Greek σχέδη (skhédē, “papyrus leaf”), from Proto-Hellenic *skʰíďďō, from Proto-Indo-European *skid-yé-ti, from *skeyd- (“to divide, split”). Doublet of cedula and cedule.
This word was historically pronounced /ˈsɛdjuːl/, /ˈsɛdʒuːl/; the pronunciations with /ʃ/ and /sk/ are due to the spelling (the latter may have been reinforced by learned influence); compare schism.

atodlen

a table of information forming appendix to a statute, other regulatory instrument or legal contract

menetrend

especially one with times of arrivals and departures

(computer science) An allocation or ordering of a set of tasks on one or several resources.

програ́ма

(computing) an ordering or allocating of a set of tasks


norm

From Latin norma (“a carpenter's square, a rule, a pattern, a precept”). Doublet of norma.

norm

math: function that maps vectors to non-negative reals

(philosophy, computer science) A sentence with non-descriptive meaning, such as a command, permission, or prohibition.


stable

en-adj

stable (comparative stabler or more stable, superlative stablest or most stable)

stabler (comparative)
more stable (comparative)
stablest (superlative)
most stable (superlative)

From Middle English stable, from Anglo-Norman stable, stabel, from Latin stabilis (“firm, steadfast”) (itself from stare (“stand”) + -abilis (“able”)). Displaced native Old English staþolfæst.

(computer science, of a sorting algorithm) That maintains the relative order of items that compare as equal.


starvation

en-noun

starvation (countable and uncountable, plural starvations)

Whenever multiple threads compete for a scarce resource, there is the danger of starvation, a situation in which the thread never gets the resource.

2004, Scott Oaks, Henry Wong, Java Threads, O'Reilly Media, →ISBN, page 138:

(computer science) A state where a process is perpetually denied necessary resources to process its work.


horizon

Inherited from Middle English orisonte, orisoun, from Middle French horizon, horizonte, from Old French orisonte, orison, via Latin horizōn, from Ancient Greek ὁρίζων (horízōn), from ὅρος (hóros, “boundary”).

(computer chess) The point at which a computer chess algorithm stops searching for further moves.


sentinel

1570s, from Middle French sentinelle, from Old Italian sentinella (perhaps via a notion of "perceive, watch", compare Italian sentire (“to feel, hear, smell”)), from Latin sentiō (“feel, perceive by the senses”). See sense, sentient.

uder

The <xmp> tag is a sentinel that suspends web-page processing and displays the subsequent text literally

[…] a sentinel value that indicates a missing entry.

2016, Jake VanderPlas, Python Data Science Handbook, page 120:

(computer science) A unique value recognised by a computer program for processing in a special way, or marking the end of a set of data.


multiply

From Old French multiplier, from Latin multiplicō, from multi (“many”) + plicō (“I fold”).
The noun presumably derives from the verb.

The extended instruction set may double the speed again if a lot of multiplies and divides are done.

List the number of adds and multiplies for each of the forms (6) , (7), and (8).

(computer science) An act or instance of multiplying.


break down

en-verb

break down (third-person singular simple present breaks down, present participle breaking down, simple past broke down, past participle broken down or (informal) broke down)

breaks down (present singular third-person)
breaking down (participle present)
broke down (past)
broken down (participle past)
broke down (informal participle past)

LL-Q1860 (eng)-Flame, not lame-break down.wav

I am afraid my computer will break down if I try to run it at too high a speed.

(intransitive, of a machine, computer, vehicle, etc.) To stop functioning.


partial

en-adj

partial (comparative more partial, superlative most partial)

more partial (comparative)
most partial (superlative)

From Middle English partiall, parcial, from Old French parcial (“biased or particular”), from Late Latin partiālis (“of or pertaining to a part”), from Latin pars (“part”).

der

It's easy to prove partial correctness, but it's not obvious that it is also totally correct.

(computer science) describing a property that holds only when an algorithm terminates


one-way

From one + way. First attested in 1906 in reference to one-way tickets; 1914 in reference to one-way streets; 1940 in reference to one-way mirrors.

(computer science) Of a function: easy to compute for every input, but hard to invert given the image of a random input.


SUT

software engineering
software engineering

(computer science, software engineering, software testing) Initialism of system under test.


IR

en-noun

IR (countable and uncountable, plural IRs)

information retrieval
information retrieval#English

(computer science) Initialism of information retrieval.


bioinformatics

/ˌbaɪəʊˌɪnfəˈmætɪks/

information technology
information technology

(biology, computer science) A field of science in which biology, computer science, and information technology merge into a single discipline to analyse biological information using computers and statistical techniques.

生命情報科学

せいめいじょうほうかがく

情報生命科学

じょうほうせいめいかがく


debug

en-verb

debug (third-person singular simple present debugs, present participle debugging, simple past and past participle debugged)

debugs (present singular third-person)
debugging (participle present)
debugged (participle past)
debugged (past)

It ranged from the pre-design development of essential components, through the stage of type test and flight test and "debugging" right through to later development of the engine to higher powers and efficiency.

1945, The Journal of the Royal Aeronautical Society, volume 49, page 183:

It debugs all program errors, including those that are hardware initiated.

1970, Behavior Research Methods and Instrumentation, volume 2, page 36:

Additionally, it's up to you to remember to remove this cron entry when you've debugged the firewall.

2015, Steve Suehring, Linux Firewalls: Enhancing Security with nftables and Beyond, page 140:

(computer science) To search for and eliminate malfunctioning elements or errors in something, especially a computer program or machinery.


gadget

Unknown. First used in print by Robert Brown in 1886 (see quote in definition section). Might come from French gâchette or gagée, or from the French family name Gaget, an industrialist who produced promotional gadgets in collaboration with the project to build the statue of Liberty.

We reduce an instance of 3-SAT to an instance of bird-flock-optimization, using a gadget that converts each conjunctive Boolean clause to a group of birds.

(computer science) A technique for converting a part of one problem to an equivalent part of another problem, used in constructing reductions.


PH

en-noun

PH (countable and uncountable, plural PHs)

polynomial hierarchy
polynomial hierarchy#English

(computer science) Initialism of polynomial hierarchy.


amortize

en-verb

amortize (third-person singular simple present amortizes, present participle amortizing, simple past and past participle amortized)

amortizes (present singular third-person)
amortizing (participle present)
amortized (participle past)
amortized (past)

From Middle English amortisen, from Old French amortir (via the stem amortiss-), from Vulgar Latin *admortīre, derived from Latin mortuus (“dead”).

(transitive, computer science) To even out the costs of running an algorithm over many iterations, so that high-cost iterations are much less frequent than low-cost iterations, which lowers the average running time.


FSA

finite-state automaton
finite-state automaton#English

(computer science) Initialism of finite-state automaton.


upstream

en-adj

upstream (comparative farther or further upstream, superlative farthest or furthest upstream)

farther (comparative)
further upstream (comparative)
farthest (superlative)
furthest upstream (superlative)

en:figuratively, in general
en:figuratively, of computer networks

(figurative) Occurring earlier than something else; (also, usually, especially) being an influence on something else; causing a consequence for something else.

(computer networking) In the direction from the client to the server.


IMS

en-noun

IMS (countable and uncountable, plural IMSes)

Information Management System
w:Information Management System

(computer science) Initialism of Information Management System.


DP

DP (countable and uncountable, plural DPs)

dynamic programming
dynamic programming#English

(computer science) Initialism of dynamic programming.


STA

(computer networking) Abbreviation of station (in IEEE 802.11 (Wi-Fi) terminology)

(computer networking) Initialism of simultaneous thermal analysis.

(computer networking) Initialism of single-threaded apartment (in the Component Object Model)


firebrick

LL-Q1860 (eng)-Flame, not lame-firebrick.wav

firebrick:

(computer science) The X11 color name of RGB hexadecimal value #B22222.


pathological

en-adj

pathological (comparative more pathological, superlative most pathological)

more pathological (comparative)
most pathological (superlative)

LL-Q1860 (eng)-Flame, not lame-pathological.wav

(computer science) Having properties that cause unusually bad behaviour, especially regarding correctness or performance.


KB

(computer science) Initialism of knowledge base.


isomorphism

en-noun

isomorphism (countable and uncountable, plural isomorphisms)

Isomorphism on Encyclopedia of Mathematics

Natural Isomorphism on Wolfram MathWorld

(computer science) a one-to-one correspondence between all the elements of two sets, e.g. the instances of two classes, or the records in two datasets.


time scale

(computer science) 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 physical system under study.


TST

TST (countable and uncountable, plural TSTs)

ternary search tree
w:ternary search tree

(computer science) Initialism of ternary search tree: a type of trie.


least significant byte

least significant byte (plural least significant bytes)

(computer science) The byte of a multibyte number with the least importance: that is, the byte stored last on a big-endian system or first on a little-endian system.


TDR

(computer networking) Initialism of Time Domain Reflectometer: a type of cable tester which can find where a break is located.


signed

It wasn't until they tried to subtract 3 from 1 that the elementary school students realized they needed signed numbers.

(mathematics, computer science) Having both positive and negative varieties.

有符號 /有符号

(mathematics, computer science) having both positive and negative varieties


persistence

persistence (countable and uncountable, plural persistences)

Once written to a disk file, the data has persistence: it will still be there tomorrow when we run the next program.

(computer science) Of data, the property of continuing to exist after the termination of the program.


unification

unification (countable and uncountable, plural unifications)

Either from unify + -ification or from French unification

5.7.T ( Unification theorem ) For any two terms or formulas
 without quantifiers X and Y, the following holds.
(i) The unification algorithm UNIF₁, applied to X, Y,
 terminates after a finite number of steps.
(ii) {X, Y} is unifiable iff UNIF₁ so indicates upon ter-
 mination. Moreover, the substitution σ then available as out-
 put is a most general unifier of {X, Y}.

1982, Wolfgang Bibel, Automated Theorem Proving, Braunschweig: Friedr. Vieweg & Sohn, →ISBN, page 94:

specialisation order
specialisation order

(mathematical logic, computer science) Given two terms, their join with respect to a specialisation order.

合一

in mathematical logic or computer science


daisy chain

LL-Q1860 (eng)-Flame, not lame-daisy chain.wav

(computer engineering) A bus wiring scheme in which a series of devices are connected in sequence: A to B, B to C, C to D, etc.


stateless

無狀態 /无状态

(computer science) without remembering state

A stateless server treats each request independently.

(computer science) Of a system or protocol, such that it does not keep a persistent state between transactions.


interactive

en-adj

interactive (comparative more interactive, superlative most interactive)

more interactive (comparative)
most interactive (superlative)

LL-Q1860 (eng)-I learned some phrases-interactive.wav

an interactive digital map with zoom and pan features

(computer science) Offering or involving interaction with the user.


downstream

downstream (comparative farther or further downstream, superlative farthest or furthest downstream)

farther (comparative)
further downstream (comparative)
farthest (superlative)
furthest downstream (superlative)

(figurative) Occurring later than something else; (also, usually, especially) influenced by something else; being a consequence of something else.

(computer networking) In the direction from the server to the client.


UTM

en-noun

UTM (countable and uncountable, plural UTMs)

Universal Turing machine
w:Universal Turing machine

(computer science) Initialism of Universal Turing machine.


complexity theory

The professor of complexity theory says that the problem can be solved in polynomial time.

(computer science) The study and classification of decision problems by the computational resources—such as time and space—needed by the programs that solve the problems.

kompleksisuusteoria

the study and classification of decision problems by the computational resources


binary tree

LL-Q1860 (eng)-Flame, not lame-binary tree.wav

(mathematics, computer science) A data structure in which each node has at most two children, each node but the root has one parent, and there are no cycles.


brute force

LL-Q1860 (eng)-Flame, not lame-brute force.wav

(computer science) A method of computation wherein the computer is let to try all permutations of a problem until one is found that provides a solution, in contrast to the implementation of a more intelligent algorithm.


rewriting

rewriting (countable and uncountable, plural rewritings)

(logic, computer science) Any of wide range of potentially non-deterministic methods of replacing subterms of a formula with other terms.


amortized

(computer science) Of an algorithm, in which the costs of running it is evened out over many iterations.


subroutine

LL-Q1860 (eng)-Flame, not lame-subroutine.wav

Holonyms: routine, program, app, application

(computer science) A section of code, called by the main body of a program, that implements a task.


most significant byte

most significant byte (plural most significant bytes)

(computer science) 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 little-endian system.


pruning

pruning (countable and uncountable, plural prunings)

LL-Q1860 (eng)-Flame, not lame-pruning.wav

(computer science) A method of enumeration that allows the cutting out of parts of a decision tree.


white space

white space (countable and uncountable, plural white spaces)

LL-Q1860 (eng)-Flame, not lame-white space.wav

* (free time): Suggesting unfilled spaces on a calendar or schedule.

bílý znak

single character or series of characters

(computer science, uncountable) A contiguous collection of one or more characters that each represents horizontal or vertical space in typography.


plycount

Take note that if the side to move first wins, the plycount must be an odd number, since that side makes the last move.

2004. Jaap van den Herik, Hiroyuki Iida, Ernst A. Heinz. Advances in Computer Games: Many Games, Many Challenges... Springer 2004, p. 216 http://books.google.com/books?id=b1tMzog4M-MC&pg=PA216&dq=plycount&sig=mT8CESvj8h9T-6Z45eQfcuItbQY

(computer chess) The total number of moves in a game, counting each player's move as 1.


decider

(computer science) A Turing machine that halts regardless of its input.


moob

en-verb

moob (third-person singular simple present moobs, present participle moobing, simple past and past participle moobed)

moobs (present singular third-person)
moobing (participle present)
moobed (participle past)
moobed (past)

Inversion of boom (“to rapidly adjust the evaluation of a position away from zero, indicating a likely win or loss”).

from

Stockfish was slightly moobing until Leela played Qf5. An innocuous looking move that immediately sent alarm bells ringing and Stockfishes^([sic]) evaluation just kept rising.

2020 September 20, u/FMExperiment, “Stockfish beats Leela to inflict her first defeat in TCEC season 19 and remains the last undefeated engine!”, in Reddit, r/chess, archived from the original on 2022-10-22:

The time taken for an engine to boom / moob can be quite a while because that time taken is completely dependent on the hardware you're running the program on.

2020 November 27, Allure, “Big changes in engine's evaluation after considerable time”, in Stack Exchange, archived from the original on 2024-05-22:

The reverse was also won uneventfully by LEELA although the fish emotes were numerous in the chat as STOCKFISH 'moobed' to a mere 0.40 evaluation after its 25th move!

2021 May 26, Matthew Sadler, “The TCEC20 Computer Chess Superfinal: a Perspective”, in ICGA Journal, volume 43, number 1, →DOI, pages 74–87:

(intransitive, computer chess, slang) To rapidly adjust the evaluation of a position towards zero, indicating a likely draw.


moob

The latest Stockfish on my laptop finds mate in 22 in less than a minute. Do you have any examples where a boom (or moob) occurs after 2-3 minutes of evaluation?

2020 November 27, the_fox, “Big changes in engine's evaluation after considerable time”, in Stack Exchange, archived from the original on 2024-05-22:

One notable exception to the missing lines being interesting: Sometimes on a moob the sudden insight is 'I'm going to hit the 50 move rule before realizing my advantage'.

2021 January 23, Bram Cohen, “You're doing computer chess game commentary wrong”, in Medium, archived from the original on 2022-12-06:

The evaluation boom and moob continued as Stockfish headed for a queen-rook-knight vs queen-rook-knight position that looked pretty nasty to me!

2022 April 22, Matthew Sadler, “TCEC Season 22 SuperFinal: Komodo Dragon vs Stockfish”, in TCEC, archived from the original on 2022-12-13:

(computer chess, slang) An instance of moobing.


solvable

Galois theory
Solution in radicals
solvable
Évariste Galois

From solve + -able. Piecewise doublet of soluble.
The mathematical senses derive from Galois theory: Galois discovered that one could determine whether a given polynomial could be solved by radicals by studying the properties of a particular group attached to a particular field extension deriving from the polynomial in question; if the group satisfies some conditions then polynomial can be solved by radicals. Any group meeting these conditions — whether or not it arises from this process — is thus called solvable, as is any field extension giving rise to such a group. The Lie-theoretic sense is by analogy, the study of Lie algebras deriving much of its terminology from group theory. In regular use by the late 19th century.

recursively enumerable
recursively enumerable

(computer science, of a decision problem) Such that the set of inputs for which the answer is yes is recursively enumerable.


halting problem

en-noun

halting problem (plural halting problems)

(computer science) The problem of deciding in finite time whether a given program will finish running in finite time, when given a certain finite input.


computability theory

(computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models.


PEG

PEG (countable and uncountable, plural PEGs)

This is a form of grammar called a Parsing Expression Grammar (PEG). PEGs use a different form of grammar which can handle most context-free situations and some context-sensitive ones.

2010, Martin Fowler, Domain-Specific Languages, Pearson Education, →ISBN:

parsing expression grammar
w:parsing expression grammar

(computer science, countable) Initialism of parsing expression grammar.


time complexity

time complexity (usually uncountable, plural time complexities)

(computer science) 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 and multiplication by constant terms.


declarer

LL-Q1860 (eng)-Flame, not lame-declarer.wav

From Middle English declarer, equivalent to declare + -er.

(computer science) A statement that declares the properties of a variable or contributes to doing so.


decompiler

LL-Q1860 (eng)-Flame, not lame-decompiler.wav

(computer science) A computer program performing the reverse operation to that of a compiler.


decompile

en-verb

decompile (third-person singular simple present decompiles, present participle decompiling, simple past and past participle decompiled)

decompiles (present singular third-person)
decompiling (participle present)
decompiled (participle past)
decompiled (past)

LL-Q1860 (eng)-Flame, not lame-decompile.wav

(computer science) To recreate the original source code from a compiled executable.


machine code

en-noun

machine code (countable and uncountable, plural machine codes)

central processing unit
central processing unit

(computer science) A system of instructions and data directly understandable by a computer's central processing unit.

(computer science) Machine language instructions that can be executed directly by a computer's central processing unit.


A*

(computer science) A best-first graph search algorithm for finding a lowest-cost path to a goal.


backtracking

backtracking (countable and uncountable, plural backtrackings)

backtracking algorithm

Backtracking is used to solve problems in which a sequence of objects is chosen from a specific set so that the sequence satisfies some criterion. The classic example of the use of backtracking is the n-Queens problem.

2004, Richard E. Neapolitan, Kumarss Naimipour, Foundations of Algorithms Using C++ Pseudocode, 3rd edition, Jones & Bartlett Learning, →ISBN, page 188:

This grammar only uses tokens and rules, so there is no backtracking involved, and the grammar is a predictive parser. This is fairly typical. Many grammars work fine without backtracking, or with backtracking in just a few places.

2017, Moritz Lenz, Parsing with Perl 6 Regexes and Grammars, Apress, →ISBN, page 112:

(computer science) The act of building all possible solutions to a problem incrementally, abandoning any candidate solution if it cannot lead to a valid solution.

malavanco

computer science: building all solutions and abandoning any if it cannot lead to a valid one


concurrency

concurrency (countable and uncountable, plural concurrencies)

(computer science, by extension) A property of systems where several processes execute at the same time.

kunrulo

computer science: having several processes executing at the same time


prestate

LL-Q1860 (eng)-Flame, not lame-prestate.wav

(computer science) The state that exists before an operation.


ASR

speech recognition
speech recognition#English

(computer science) Initialism of automatic/automated speech recognition.


adicity

From -adic (taken from monadic/dyadic/triadic [function/operator]) + -ity, or alternatively from -ad (taken from monad/duad/triad) + -icity. Compare Latinate equivalent arity, based on -ary.

1997, Robert W. Burch, 13: Peirce's Reduction Thesis, Nathan Houser, Don D. Roberts, James Van Evra (editor), Studies in the Logic of Charles Sanders Peirce, Indiana University Press, page 233,
Equivalently, it says that all relations of adicity greater than 3 may be reduced to relations of adicities 1, 2, and/or 3. The negative component of the Thesis says, first, that relations of adicity 2 may not in general be constructed from (reduced to) relations exclusively of adicity 1; and, second, that relations of adicity 3 and greater may not in general be constructed from (equivalently: reduced to) relations exclusively of adicities 1 and/or 2.

What can be predicted is that the adicity of any syntactic predicate is the same: since its adicity is a grammatical and not a thematic fact, semantic differences between predicates cannot affect their grammatical structure.

2004, Susan Rothstein, Predicates and Their Subjects, Springer, page 47:

2007, Helier J. Robinson, Relation Philosophy of Mathematics, Science, and Mind, Sharebooks Publishing, 2nd Edition, page 68,
We have seen that every relation, without exception, necessarily has a term set, and the necessary properties of simplicity and an adicity: relations without these are impossible, merely nominal.

(logic, mathematics, computer science) The number of arguments or operands a function or operation takes. For a relation, the number of domains in the corresponding Cartesian product.


decidable

en-adj

decidable (comparative more decidable, superlative most decidable)

more decidable (comparative)
most decidable (superlative)

It is easy to show that the set of even numbers is decidable by creating the relevant Turing machine.

(computer science) describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time.


DAG

en-noun

DAG (countable and uncountable, plural DAGs)

directed acyclic graph
directed acyclic graph#English

(computer science, mathematics) Acronym of directed acyclic graph.


regularization

regularization (countable and uncountable, plural regularizations)

LL-Q1860 (eng)-Flame, not lame-regularization.wav

A large regularization parameter may over-smoothen the solution, while a small regularization parameter may lose the ability to stabilize the solution.

2020 March 30, Ratinan Boonklurb, Ampol Duangpan, Phansphitcha Gugaew, “Numerical Solution of Direct and Inverse Problems for Time-Dependent Volterra Integro-Differential Equation Using Finite Integration Method with Shifted Chebyshev Polynomials”, in Symmetry, volume 12, number 4, →DOI:

(mathematics, computer science, finance) a process that simplifies results, often used to obtain results for ill-posed problems or to prevent overfitting.


divide and conquer

LL-Q1860 (eng)-Flame, not lame-divide and conquer.wav

The quicksort algorithm is an example of divide and conquer.

(computer science) An algorithm design technique that solves a problem by splitting it recursively into smaller problems until all of the remaining problems are trivial.


codebook

LL-Q1860 (eng)-Flame, not lame-codebook.wav

We assume that DWT coefficients belong to a codeblock that is divided by its quantization step size in advance and the two codebooks, C⁰ and C¹, for the two quantizers can be defined as […]

2013, Kazuhiro Kondo, Multimedia Information Hiding Technologies and Methodologies for Controlling Data, Hershey, P.A.: Information Science Reference, →ISBN, page 226, column 2:

The change, which has so far been approved by each committee that has considered it, is under review for the next edition of the W.H.O. codebook, which classifies diseases and influences the treatment of patients worldwide.

2016 July 26, Pam Belluck, “W.H.O. Weighs Dropping Transgender Identity From List of Mental Disorders”, in The New York Times:


combinatory logic

(computer science) Model of computation based on combinators.


higher-order function

higher-order function (plural higher-order functions)

A higher-order function is a function that operates on other functions instead of on data values. Some of these take data arguments and manufacture functions to order; others, like the imap() function of Chapter 4, transform one function into another one.

2005, Mark Jason Dominus, Higher-Order Perl: Transforming Programs with Programs, Elsevier, →ISBN, page 325:

(computer science) A function that takes one or more functions as an input, and returns a function as a result.


combinator

M is a closed λ-term (or combinator) if FV(M) = ∅. The set of closed λ-terms is denoted by Λ⁰.

1991 December 20, Henk P. Barendregt, “Lambda Calculi With Types”, in ftp.cs.ru.nl^([ftp://ftp.cs.ru.nl/pub/CompMath.Found/HBK.ps]), retrieved 2012-07-15:

(computer science) A lambda expression which has no free variables in it.

kombinator

lambda expression with no free variables


formal grammar

(computer science) A precise mathematical description of a formal language, consisting of terminal symbols, nonterminal symbols, a nonterminal symbol serving as start symbol, and a set of production rules that control the expansion of nonterminal symbols into strings consisting of both terminal and nonterminal symbols.


nondeterminism

nondeterminism (countable and uncountable, plural nondeterminisms)

Projection of an automaton almost always results in nondeterminism.

(computer science) The property of being nondeterministic, involving arbitrary choices; necessitating the choice between various indistinguishable possibilities.


nondeterministic

Nondeterministic bottom-up tree automaton recognize the class of regular tree languages.

The aim of this book is to compare deterministic, nondeterministic, and strongly nondeterministic decision trees. Conventional (deterministic) decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms.

2020, Mikhail Moshkov, Comparative Analysis of Deterministic and Nondeterministic Decision Trees, Springer Nature, →ISBN, page 1:

(computer science) Exhibiting nondeterminism; involving choices between indistinguishable possibilities.


string distance

string distance (plural string distances)

The string distance between 'here' and 'there' is 1 (insertion of a t).

(computer science) Any of several metrics that represent the degree of similarity between two strings of characters, based on the smallest number of transformations that can change one into the other.


Levenshtein distance

Levenshtein distance (countable and uncountable, plural Levenshtein distances)

From Levenshtein + distance, after the Russian mathematician Vladimir Levenshtein.

(computer science) The number of edits (replacements, deletions and insertions) required to change one string into another.

Levenshteinova vzdálenost

(computer science) the number of edits required to change one string into another


memoization

(computer science) A technique in which partial results are recorded (forming a memo) and then can be re-used later without having to recompute them.


positioning time

(computer science) 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 under the disk head (rotational latency).


hold hostage

en-verb

hold hostage (third-person singular simple present holds hostage, present participle holding hostage, simple past and past participle held hostage)

holds hostage (present singular third-person)
holding hostage (participle present)
held hostage (participle past)
held hostage (past)

LL-Q1860 (eng)-Flame, not lame-hold hostage.wav

Before Frank could turn in his final exam, Jigsaw held his computer hostage.

(computer science, of a hacker or malware) To sabotage (a computer) with intent to blackmail the owner.


synchronization domain

en-noun

synchronization domain (plural synchronization domains)

(computer science) In the context of thread synchronization, a collection of contexts and objects that share a single lock.


trie

(computer science) An ordered tree data structure that is used to store an associative array where the keys are usually strings.


loose coupling

(computer science) A low-level interdependent coupling between program modules.

couplage

computer science: low-level interdependent coupling between modules


primitive type

programming language
programming language

(computer science) A data type provided by a programming language as a basic building block, such as integer, character or Boolean.


composite type

(computer science) A data type that can be constructed in a programming language out of that language's primitive types and other composite types; exemplified by array, structure, and class.


built-in type

first class function
first class function

(computer science) A data type provided by a programming language as a basic building block, such as integer, character or Boolean, but in some languages also list, hash table or first class function.


computational linguistics

Coined by American linguist and computer scientist David Hays in the 1960s.

coinage

Prolog has been used for many purposes, but its inventor, Alain Colmerauer, was interested in computational linguistics, and this remains a classic application for the language. Moreover, Prolog offers a number of tools which make life easier for computational linguists, and we are now going to start learning about one of the most useful of these: definite clause grammars, or DCGs as they are usually called.

2006, Patrick Blackburn · Johan Bos · Kristina Striegnitz, Learn Prolog Now!, §7.1

(linguistics, computer science) An interdisciplinary field dealing with the statistical and/or rule-based modeling of natural language from a computational perspective. This modeling is not limited to any particular field of linguistics.


denotational semantics

(computer science) An approach to formalizing the meanings of programming languages by constructing mathematical objects called denotations which describe the meanings of expressions from the languages.

stærðfræðileg merkingarfræði

an approach to formalizing the meanings of programming languages


RFI

en-noun

RFI (countable and uncountable, plural RFIs)

(uncountable, computer science) Initialism of remote file inclusion.


kernelization

kernelization (countable and uncountable, plural kernelizations)

(computer science) A technique for creating algorithms for fixed-parameter tractable problems, involving a preprocessing stage in which inputs to the algorithm are replaced by a smaller input, called a kernel.


semiautomaton

(mathematics, computer science) a multiplicative operation of a monoid on a set


scheduler

LL-Q1860 (eng)-Flame, not lame-scheduler.wav

(computer science) An operating system component responsible for allocating several resources, most commonly the use of processors by different concurrent processes or threads.


mathematical semantics

denotational semantics
denotational semantics

(computer science) A study of formal semantics of computer languages, such as denotational semantics.


decidability

decidability (countable and uncountable, plural decidabilities)

(logic, computer science) The state or condition of being decidable.


formal semantics

(computer science) the rigorous mathematical study of the meaning of programming languages


determinize

en-verb

determinize (third-person singular simple present determinizes, present participle determinizing, simple past and past participle determinized)

determinizes (present singular third-person)
determinizing (participle present)
determinized (participle past)
determinized (past)

LL-Q1860 (eng)-Flame, not lame-determinize.wav

(computer science) To remove non-determinism in an automaton; to convert a non-deterministic automaton to a deterministic one.


bursty

en-adj

bursty (comparative burstier, superlative burstiest)

burstier (comparative)
burstiest (superlative)

The router needs to handle bursty traffic.

(computer science) Occurring in abrupt bursts, especially of information


subtree

LL-Q1860 (eng)-Flame, not lame-subtree.wav

(mathematics, computer science, graph theory) A tree wholly contained in another.

podstrom

mathematics, computer science: a tree wholly contained in another


space complexity

en-noun

space complexity (usually uncountable, plural space complexities)

(computer science) 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 amount of scratch paper needed while working out a problem with pen and paper.


subsequence

LL-Q1860 (eng)-Flame, not lame-subsequence.wav

(computer science) A subset of an array with the same ordering.


computation tree logic

(computer science) A particular modal logic of branching time with operators "next", "globally", "finally" or "eventually", "until", and "weak until".


computable function

computable function (plural computable functions)

(computer science) A mathematical function that can be computed using an abstract computation machine such as Turing machine.


submachine

LL-Q1860 (eng)-Flame, not lame-submachine.wav

In the same computation, the computer may be decomposed repeatedly and the partitioning may vary from one split to the other. The submachines can further recursively decompose […]

1999, Martin Beran, “Decomposable Bulk Synchronous Parallel Computers”, in SOFSEM '99: Theory and Practice of Informatics, →ISBN, page 351:

A machine forming part of a larger machine.

(computer science) A part of a real or virtual machine which acts as a machine in its own right.


deconflict

en-verb

deconflict (third-person singular simple present deconflicts, present participle deconflicting, simple past and past participle deconflicted)

deconflicts (present singular third-person)
deconflicting (participle present)
deconflicted (participle past)
deconflicted (past)

LL-Q1860 (eng)-Flame, not lame-deconflict.wav

(computer science) To resolve contradictory conclusions or responses to queries in a rule-based or deductive reasoning system.


linked list

(computer science) A simple linear data structure, each of whose nodes includes a pointer to the next (and sometimes previous) node in the list, enabling traversal of the structure in at least one direction from any starting point.


Turing degree

(computer science, logic) A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number.


ANN

(computer science) Initialism of approximate nearest neighbor.


HLL

(computer science) Initialism of HyperLogLog.


pure name

A MAC address can be considered a pure name, as it gives no indication of where on a network the device can be found.

(computer science) A name that reveals no usable information about the entity it identifies.


impure name

The absolute path to a file is an impure name: it contains a clear hierarchical structure.

(computer science) A name that contains useful information about the entity it identifies.


cycle time

Order cycle time can now be minutes from when the customer starts entering an order to when it is visible to the warehouse.

Production cycle time is not as important as the time spent in transit.

Design cycle time for an all-new state-of-the-art compressor is still years from go-ahead to readiness for manufacture.

(computing, software, computer science) The total elapsed time to complete an operation or set of operations.


maximax

LL-Q1860 (eng)-Flame, not lame-maximax.wav

The first criterion is the Hurwicz criterion, often referred to the maximax criterion. […] the decision-maker is always optimistic and attempts to maximize profits by a go-for-broke strategy.

2009, Harold Kerzner, Project Management: A Systems Approach to Planning, Scheduling, and Controlling, Tenth Edition, John Wiley and Sons, →ISBN, page 749:

(economics, computer science, decision theory) A strategy or algorithm that seeks to maximize the maximum possible result (that is, that prefers the alternative with the chance of the best possible outcome, even if its expected outcome and its worst possible outcome are worse than other alternatives); often used attributively, as "maximax strategy", "maximax approach", and so on.


HMM

hidden Markov model
hidden Markov model#English

(computer science) Initialism of hidden Markov model.


CRF

conditional random field
w:conditional random field

(computer science) Initialism of conditional random field.


bisimilar

LL-Q1860 (eng)-Flame, not lame-bisimilar.wav

(computer science) Of two state transition systems, such that a bisimulation exists between the two.


minimin

(economics, computer science, decision theory) A strategy or algorithm that seeks to minimize the minimum possible result.


pageable

(computer science, of computer memory) Able to be paged in and paged out.


semicomputable

(mathematics, computer science) partially computable

(mathematics, computer science) Semidecidable (for decision problems), can be approximated from either above or below by a computable function (for optimization and numerical problems).


FO

first-order logic
first-order logic#English

(logic, computer science) Initialism of first-order logic.


linearithmic

/ˌlɪni.əˈɹɪðmɪk/

LL-Q1860 (eng)-Flame, not lame-linearthimic.wav

(computer science, of a procedure) Taking up to time proportional to n log(n) to run on inputs of size n.


lexical analysis

en-noun

lexical analysis (countable and uncountable, plural lexical analyses)

While it's often not difficult to identify tokens while parsing, having a separate stage for lexical analysis simplifies the structure of your compiler.

(computer science) The conversion of a stream of characters to a stream of meaningful tokens; normally to simplify parsing.


beta reduce

en-verb

beta reduce (third-person singular simple present beta reduces, present participle beta reducing, simple past and past participle beta reduced)

beta reduces (present singular third-person)
beta reducing (participle present)
beta reduced (participle past)
beta reduced (past)

The term (#92;lambdax.#92;,x)#92;,y can beta reduce to y#92;#33;.

(computer science, transitive or intransitive) To syntactically replace a function call by the result of calling that function.


computation history

en-noun

computation history (plural computation histories)

(computer science) a sequence of steps taken by an abstract machine in the process of computing its result.


subprocedure

LL-Q1860 (eng)-Flame, not lame-subprocedure.wav

(computer science) A procedure that can be called by higher-level procedures as part of their operation.


VSS

(computer networking) virtual switching system


relative address

relative address (plural relative addresses)

(computer science) The location of something in computer memory expressed as an offset from the value of a register.


bucket list

From bucket + list.
Sense 1 (“list of tasks arising during a meeting”) may allude to a notional bucket in which tasks to be dealt with later are placed. Sense 2 (“list of things to accomplish before one’s death”) refers to kick the bucket (“to die”), bucket in this sense possibly referring to a beam to which a pig is hung by its heels after it has been slaughtered (possibly from Old French buquet (“balance; trebuchet”)). It was coined by the American and British screenwriter Justin Zackham in 1999 when he drew up “Justin’s List of Things to Do before I Kick the Bucket” which he shortened to “Justin’s Bucket List”. The first item on his list was to have a screenplay produced at a major Hollywood studio. After a few years, it occurred to him that the notion of a “bucket list” could be the basis for a film, so he wrote a screenplay about two dying men racing to complete their own bucket lists with the time they had left, which became the film The Bucket List (2007). The term was then popularized by the film.

平生夢想單 /平生梦想单

a list of things to accomplish before one’s death

lista rzeczy do zrobienia przed śmiercią

lista de cosas por / para hacer antes de morir

Using a bucket list structure[…], the program sorts each incoming word serially, constructing a list within each of 256 buckets for good words of a given alphabetic range […]

1960 July 25, J. C. Olney, Feat, an Inventory Program for Information Retrieval (FN-4018), Santa Monica, Calif.: System Development Corporation; quoted in Mary Elizabeth Stevens, “Operational Considerations”, in Automatic Indexing: A State-of-the-Art Report (National Bureau of Standards Monograph; 91), Washington, D.C.: National Bureau of Standards, United States Department of Commerce, 30 March 1965, reissued February 1970, →OCLC, page 170:

In place of direct storage in the block we might substitute pointers to linked bucket lists of the elements having the same hash addresses. After hashing B#95;x and retrieving the pointer to the appropriate bucket list, we search the list for B#95;x, and if not found, add it to the end of the list.

1975, Terrence W. Pratt, “Data”, in Programming Languages: Design and Implementation, Englewood Cliffs, N.J.: Prentice-Hall, →ISBN, page 83:

(computer science) A data structure containing buckets used in a hashing algorithm.


LQTM

quantum Turing machine
w:quantum Turing machine

(computer science, quantum mechanics) Initialism of linear quantum Turing machine.


subhistory

LL-Q1860 (eng)-Flame, not lame-subhistory.wav

(computer science) A history (sequence of events or actions) making up part of a larger history.


MWE

(computer science) Initialism of minimal working example.


OCP

Open Closed Principle
open/closed principle#English

(computer science, programming) Initialism of Open Closed Principle.


pumping lemma

en-noun

pumping lemma (plural pumping lemmas or pumping lemmata)

pumping lemmas (plural)
pumping lemmata (plural)

There is a pumping lemma for CFLs similar to the one for regular sets. It can be used in the same way to show that certain sets are not context-free.

1997, Dexter Kozen, Automata and computability, page 148:

In the literature one finds many pumping lemmas which describe the ability to repeat (pump) certain words repeatedly in some languages, under different circumstances.

2002, Alejandro Maass, Servet Martínez, Jaime San Martín, Dynamics and randomness, page 174:

String-language hierarchies are usually proven using formalism-specific pumping lemmata.

2010, Marco Kuhlmann, Dependency Structures and Lexicalized Grammars: An Algebraic Approach, page 107:

(computer science) 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 that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular).

dælusetning

lemma stating that a section of a string can be removed or repeated with the resulting string remaining in the language


loop invariant

(computer science) an invariant that should be true on entry into a loop and is guaranteed to remain true on every iteration of the loop

lykkjuóbreyta

invariant guaranteed to remain true on every iteration of a loop


pattern matching

(computer science) the act of checking some sequence of tokens for the presence of the constituents of a pattern

hahmonsovitus

computer science: act of checking tokens for patterns


enaction

enaction (usually uncountable, plural enactions)

An appreciation of the power of enaction in our understandings of the mind will throw into relief the question of motivations and goals.

2005, Ralph D. Ellis, Natika Newton, Consciousness & Emotion: Agency, conscious choice, and selective perception:

The processes that underlie the organization and honing of these skills operate over a wide range of timescales, which include the enaction of a particular perceptual act at one end and the lifetime development of perception-action capabilities at the other.

2017, Ezequiel A. Di Paolo, Thomas Buhrmann, Xabier E. Barandiaran, Sensorimotor Life: An Enactive Proposal, page 76:

The first mention of enaction as a history of couplings that bring forth a world referred to the activity of "sensorimotor networks". (Varela et al. 1991)

2018, Ezequiel A. Di Paolo, Elena Clare Cuffari, Hanne De Jaegher, Linguistic Bodies: The Continuity between Life and Language:

Third, drawing on enaction and embodiment gives us the means for considering actions taken in response to musical sounds as sufficient for cognition, and thus constitutive of listeners' musical understanding.

2019, Mariusz Kozak, Enacting Musical Time: The Bodily Experience of New Music, page 54:

(philosophy, cognitive science, computer science) The interpretation of consciousness or understanding as a process of meaningfully engaging and interacting with the world in a hierarchy of actions that produce reactions.


CFG

control-flow graph
control-flow graph#English

(computer science) Initialism of control-flow graph.


item set

(computer science, parsers) A set of production rules which have an identical sequence of symbols between the right arrow (→) and the dot (•).


ad-hoc polymorphism

ad-hoc polymorphism (usually uncountable, plural ad-hoc polymorphisms)

(computer science) A kind of polymorphism where polymorphic functions can be applied to arguments of different types, as they can denote a number of distinct and potentially heterogeneous implementations depending on the types of argument to which they are applied.


inclusion polymorphism

inclusion polymorphism (plural inclusion polymorphisms)

subtype polymorphism
subtype polymorphism#English

(computer science) Synonym of subtype polymorphism


case-dependent

(computer science) Alternative spelling of case dependent


cuckoo hashing

Referring to the behaviour of some cuckoo chicks, which push other eggs or young out of the nest.

(computer science) A scheme for resolving hash collisions, using two hash functions instead of one, and allowing a newly inserted key to "kick out" any existing key at the same index.


SDLC

(computer science) Initialism of software development lifecycle.


centipawn

(computer chess) One hundredth of the value of a pawn, especially for calculation purposes in computer chess.


insertion sort

insertion sort (countable and uncountable, plural insertion sorts)

(computer science) A sorting algorithm that performs its task by inserting new items into a pre-existing sorted data structure.


supercombinator

LL-Q1860 (eng)-Flame, not lame-supercombinator.wav

Supercombinators are used in the implementation of functional languages.

(computer science) A mathematical expression which is fully bound and self-contained. It may be either a constant or a combinator where all the subexpressions are supercombinators.


memoizable

(computer science) Suitable for memoization.


Merkle tree

Named after American computer scientist Ralph Merkle (1952–), who patented it in 1979.

named-after

2001, Josep Domingo-Ferrer, Mobile Agent Route Protection through Hash-Based Mechanisms, C. Pandu Rangan, Cunsheng Ding (editors), Progress in Cryptology - INDOCRYPT 2001: 2nd International Conference, Proceedings, Volume 2, Springer, LNCS 2247, page 17,
The second solution uses Merkle trees and minimizes the cost of route protection by the agent owner, so that a single digital signature suffices to protect the whole route; for hosts along the route, the verification cost is similar to the cost of previous schemes in the literature, namely one digital signature verification per route step.

2004, Michael Szydlo, Merkle Tree Traversal in Log Space and Time, Christian Cachin, Jan Camenisch (editors), Advances in Cryptology - EUROCRYPT 2004: International Conference, Proceedings, Springer, LNCS 3027, page 541,
Merkle trees have found many uses in theoretical cryptographic constructions, having been specifically designed so that a leaf value can be verified with respect to a publicly known root value and the authentication data of the leaf.

In order to support dynamic data operations, the Merkle Tree is made dynamic by making use of relative index.

2015, Puonam M. Pardeshi, Bharat Tidke, “Improvement of Data Integrity and Data Dynamics for Data Storage Security in Cloud Computing”, in J. K. Mandal, Suresh Chandra Satapathy, Manas Kumar Sanyal, Partha Pratim Sarkar, Anirban Mukhopadhyay, editors, Information Systems Design and Intelligent Applications, Proceedings of 2nd International Conference, Volume 1, Springer, page 279:

(computer science, cryptography) A binary hash tree.


convex function

en-noun

convex function (plural convex functions)

(computer science) A mathematical function where the line segment between any two points on the graph of the function lies above the graph in a vector space of at least two dimensions.


concave function

concave function (plural concave functions)

(computer science) The negative of the convex function.


set function

(computer science) 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 output is usually a number.


burstiness

burstiness (countable and uncountable, plural burstinesses)

LL-Q1860 (eng)-Flame, not lame-burstiness.wav

In each case, the process presents complex dynamic patterns including temporal correlations, burstiness, and all other types of nonstationarity.

2015 July 11, “Local Variation of Hashtag Spike Trains and Popularity in Twitter”, in PLOS ONE, →DOI:

(computer science) The degree to which something occurs in abrupt bursts


treap

LL-Q1860 (eng)-Flame, not lame-treap.wav

(computer science) A type of randomized binary search tree where nodes are labelled with randomly chosen priority values and which is simultaneously a heap on those priorities


downtrace

LL-Q1860 (eng)-Flame, not lame-downtrace.wav

B2 processing occurs when the subtree is in the downtrace of an attribute in X.

1971, Jack Minker, Proceedingsof the Symposium on Information Storage and Retrieval, page 141:

The query algorithm mainly includes uptrace and downtrace methods.

2003, J Wu, Q Ding, “ATRAM-An Analysis Tool of Requirement and Architecture Management”, in Systems, Man and Cybernetics:

ΞA and ΞB are two downtraces […] from the two graphs. (Ξ_A ∩ Ξ_B) is the intersection between the two downtraces.

2010, Dirk Ifenthaler, Pablo Pirnay-Dummer, Norbert M. Seel, Computer-Based Diagnostics and Systematic Analysis of Knowledge, →ISBN:

For every single trace there is a downtrace with each individual degree being between 2 < |fif| < |v|, such that all possible combinations beneath the previously entailed degrees are generated by the function Ξ.

2010, Pablo Pirnay-Dummer, “Complete structure comparison”, in Computer-based diagnostics and systematic analysis of knowledge:

(computer science) The subtree of a tree structure that is determined by an attribute of a parent node.


ulp

Abbreviation of unit in the last place or unit of least precision, coined in 1960 by Canadian mathematician and computer scientist William Kahan (born 1933).

The basic concept of two vectors "agreeing to k ulps" (units in the last place) of each entry or of the largest entry allows us to express relationships among computed values and solutions at perturbed data.

1980, Webb Miller, Celia Wrathall, “Software for Roundoff Analysis”, in Software for Roundoff Analysis of Matrix Algorithms, New York, N.Y., London: Academic Press, →ISBN, section 4.2 (Rounding and Perturbations of the Computational Problem), page 86:

Floating point operations are correct to within half an ulp, and the calculation of uvw by two floating point multiplications will be correct within about one ulp (ignoring second-order terms).

1981, Donald E[rvin] Knuth, “Arithmetic”, in The Art of Computer Programming (Addison-Wesley Series in Computer Science and Information Processing), 2nd edition, volume 2 (Seminumerical Algorithms), Reading, Mass.: Addison-Wesley, →ISBN, page 217; 3rd edition, Reading, Mass.: Addison-Wesley, 1997, →ISBN, section 4.2.2 (Accuracy of Floating Point Arithmetic):

The difference between two consecutive machine numbers is called an ulp (unit in the last place, i.e., one digit in the least significant place). The size of an ulp varies depending on where you are in the set of machine numbers. [...] Ideally no function should ever return a result with error exceeding half of an ulp since the distance from the true result to the nearest machine number is always less than half of an ulp, the worst case being when it is exactly halfway between two machine numbers.

1996, “Numerical Mathematics”, in Victor Adamchik et al., edited by Emily Martin, Mathematica 3.0 Standard Add-on Packages, Champaign, Ill.: Wolfram Media; Cambridge, Cambridgeshire: Cambridge University Press, →ISBN, page 369:

If, instead of considering ulps of the "exact" value x, we consider ulps of the floating-point value X, we have a property that is very similar to Property 2, with the interesting difference that it now holds for any value of the radix.

2010, Jean-Michel Muller et al., “Definitions and Basic Notions”, in Handbook of Floating-Point Arithmetic, Boston, Mass., Basel: Birkhäuser, →DOI, →ISBN, section 2.6.1 (The Ulp Function), page 34:

floating-point number
floating-point number

(computer science, mathematics) The value that the least significant digit of a floating-point number represents, used as a measure of accuracy in numeric calculations.


crayon license

Crayon licenses show a lack of understanding of copyright law, license structure, and most important: what would happen if the license were to be interpreted in court.

(computer science, derogatory) A copyright public license written by nonprofessionals.


chunklet

(statistics, computer science) A group of data points belonging to the same constraint cluster.


constraint cluster

constraint cluster (plural constraint clusters)

(statistics, computer science) a cluster of data points in a set conforming to the must-link and cannot-link constraints specified for each pair of data points


must-link

(statistics, computer science) Of data points: having the property that they must be clustered into the same chunklet.


cannot-link

(statistics, computer science) the property of data points that must not be clustered into the same chunklet


nonconcurrency

LL-Q1860 (eng)-Flame, not lame-nonconcurrency.wav

From non- + concurrency or nonconcurrent + -cy.

(computer science, by extension) A property of systems where several processes execute sequentially, not at the same time.


micro-optimization

(programming, computer architecture) Optimization at the level of individual instructions and operations.


monomorphisation

monomorphisation (countable and uncountable, plural monomorphisations)

We describe the formal verification stages of the compiler, which include automated formal refinement calculi, a switch from imperative update semantics to functional value semantics formally justified by the linear type system, and a number of standard compiler phases such as type checking and monomorphisation.

2016, Liam O'Connor, Christine Rizkallah, Zilin Chen, Sidney Amani, Japheth Lim, Yutaka Nagashima, Thomas Sewell, Alex Hixon, Gabriele Keller, Toby Murray, Gerwin Klein, “COGENT: Certified Compilation for a Functional Systems Language”, in arXiv:

Rust accomplishes this by performing monomorphization of the code that is using generics at compile time. Monomorphization is the process of turning generic code into specific code by filling in the concrete types that are used when compiled.

2019, Steve Klabnik, Carol Nichols, The Rust Programming Language, No Starch Press, →ISBN, page 181:

(computer science) In a compiler, the process of converting a polymorphic function to a monomorphic function, by the creation of a specialised function for each different data type it is called with.


Chomsky hierarchy

Chomsky hierarchy (plural Chomsky hierarchies)

(computer science, linguistics) A containment hierarchy of classes of formal grammars. From least to most specialized, the classes are: recursively enumerable, context-sensitive, context-free, and regular.

hierarquia de Chomsky

a containment hierarchy of classes of formal grammars


partial function application

partial function application (plural partial function applications)

partial application
partial application#English

(computer science) Alternative form of partial application


partial application

partial application (countable and uncountable, plural partial applications)

(computer science) The process of fixing a number of arguments to a function, producing another function of smaller arity.


startword

LL-Q1860 (eng)-Flame, not lame-startword.wav

In fact, a set of metarules and a set of hyperrules is given whose power exceeds by far this example and only the choice of a specific hyperrule for the startword restricts it to this example.

1981, Mathematisch Centrum (Amsterdam, Netherlands) Afdeling Informatica, Report IW - Issues 181-190:

A variation on this type of normalization consists of using a combination of startword lists and exclusion classes, e.g. remove all comparative adjectives except those in a domain list.

1992, Anne Morris -, The Application of Expert Systems in Libraries and Information Centres, →ISBN:

Suppose that the colony starts its work from startword AA and let its terminal set be {a,b,c}

1999, Andras Kornai, Extended Finite State Models of Language - Volume 1, →ISBN, page 222:

(computer science) A string of letters that identifies the beginning of a valid sequence in a specified language.


CPP

(computer science, rare, nonstandard) The C++ programming language.


running time

running time (countable and uncountable, plural running times)

(computer science) Of an algorithm, the length of time required for it to run as a function, depending on the number of operations executed.


Floyd-Warshall algorithm

the Floyd-Warshall algorithm (canonical)

Named after Robert W. Floyd and Stephen Warshall.

(computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).


nodelist

bulletin board system
bulletin board system

(computer networking) A list of bulletin board systems and their connection details.


SLAM

SLAM (countable and uncountable, plural SLAMs)

simultaneous localization and mapping#English

(computer science, uncountable) Initialism of simultaneous localization and mapping.


SSDL

2007, Oh & Won: Designing an architecture for social semantic digital libraries (SSDL), title:

2010, Alotaibi: Semantic web technologies for digital libraries: from libraries to social semantic digital libraries (SSDL), over semantic digital libraries (SDL), title:

Oh and Won (2007) defined the Social Semantic Digital Library (SSDL) as consisting of an ontology system and supporting user participation and collaboration

2017, Noh: A study on next-generation digital library using context-awareness technology, page 1:

social semantic digital library
social semantic digital library#English

(computer science) Initialism of social semantic digital library.


ESOP

European Symposium on Programming
w:European Symposium on Programming

(computer science) Initialism of European Symposium on Programming.


AVL tree

Named after Georgy Adelson-Velsky and Evgenii Landis, the inventors of this data structure.

(computer science) A self-balancing binary search tree, where, for each node, the heights of the two child subtrees differ only by at most one.


Kleene closure

Named in honor of Stephen Cole Kleene (1909–1994), an American mathematician. The “closure” part comes from the fact that a Kleene closure is closed with respect to concatenation; cf. free monoid.

(mathematics, computer science) The set of all strings of finite length made up of elements of a given set. (Then the Kleene closure is said to be of that given set. For a given set S, its Kleene closure may be denoted as S^*. The Kleene closure includes a string of zero length. Strings are equivalent to ordered tuples but written without the parentheses and commas.)


subtrie

(computer science) A trie data structure making up part of a larger trie.


iterative deepening search

iterative deepening search (countable and uncountable, plural iterative deepening searches)

breadth-first search
breadth-first search

(computer science, graph theory) A type of depth-first search in which each row of the tree is searched incrementally, simulating a breadth-first search with less memory usage.


disjoint set

(computer science) A data structure used to store such sets and perform operations on them efficiently.


directed acyclic graph

directed acyclic graph (plural directed acyclic graphs)

1995, Volker Turan, Weimin Chen, GLB-closures in Directed Acyclic Graphs and Their Applications, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (editors), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, Proceedings, Springer, LNCS 903, page 121,
A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. […] Directed acyclic graphs are widely used in different areas of computer science.

In studying these properties, a distinction is made between directed acyclic graphs with directed edges and simple acyclic graphs with undirected edges.[…]A directed acyclic graph G#61;(V#59;R) is asymmetric and does not contain cycles.

2001, Peter J. Pahl, Rudolf Damrath, Mathematical Foundations of Computational Engineering: A Handbook, Springer, page 574:

2011, Michael Donders, Sara Miner More, Pavel Naumov, Information Flow on Directed Acyclic Graphs, Lev D. Beklemishev, Ruy de Queiroz (editors), Logic, Language, Information, and Computation: 18th International Workshop, Proceedings, Springer, LNAI 6642, page 95,
A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable.

(graph theory, computer science) A finite directed graph that contains no directed cycles.


acyclic digraph

acyclic digraph (plural acyclic digraphs)

1993, Suh-Ryung-Kim, The Competition Number and Its Variants, J. Gimbel, J.W. Kennedy, L.V. Quintas (editors), Quo Vadis, Graph Theory?: A Source Book for Challenges and Directions, Elsevier (North-Holland), page 313,
In the study of the competition graph of an acyclic digraph, there are two fundamental questions which were proposed by Roberts in 1978: One is to characterize the acyclic digraphs that have interval competition graphs and the other is to characterize the graphs which are competition graphs of acyclic digraphs.

2009, Tamara Mchedlidze, Antonios Symvonis, Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs, Hung Q. Ngo (editor), Computing and Combinatorics: 15th Annual International Conference, Proceedings, Springer, LNCS 5609, page 76,
Determining whether a graph has a hamiltonian path or circuit is NP-complete [3]. The problem remains NP-complete for cubic planar graphs [3], for maximal planar graphs [9], and for planar digraphs [3]. It can be trivially solved in polynomial time for planar acyclic digraphs.

2018, Gregory Gutin, 3. Acyclic Digraphs, Jørgen Bang-Jensen, Gregory Gutin, Classes of Directed Graphs, Springer, page 125,
Acyclic digraphs form a well-studied family of digraphs of great interest in graph theory, algorithms and applications.

directed acyclic graph
directed acyclic graph

(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles.


distributed hash table

distributed hash table (plural distributed hash tables)

1992, Nobuyuki Ichiyoshi, Konighi Komura, Asymptotic Load Balance of Distributed Hash Tables, Institute for New Generation Computer Technology staff (editors), FGCS '92: Fifth Generation Computer Systems 1992, Volume 2, IOS Press, page 869,
The distributed hash table is a parallelization of the hash table obtained by dividing the table into subtables of equal size and allocating them to the processors. […] We also discuss communication overheads, and find that, in the case of mesh multicomputers, unless the network channel bandwidth grows sufficiently as p grows, the network will eventually become a performance bottleneck for distributed hash tables.

2006, Theoni Pitoura, Nikos Ntarmos, Peter Triantafillou, Replication, Load Balancing and Efficient Range Query Processing in DHTs, Yannis Ioannidis, Marc H. Scholl, et al. (editors), Advances in Database Technology - EDBT 2006: 10th International Conference, Proceedings, Springer, LNCS 3896, page 131,
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash Tables (DHTs).

2008, Zoi Kaoudi, Iris Miliarski, Manolis Koubarakis, RDFS Reasoning and Query Answering on Top of DHTs, Amit Sheth, Steffen Staab, Mike Dean, Massimo Paolucci, Diana Maynard, Timothy Finin, Krishnaprasad Thirunarayan (editors), The Semantic Web - ISWC 2008: 7th International Semantic Web Conference, Proceedings, Springer, LNCS 5318, page 499,
We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. […] Our goal in this paper is to compare and evaluate two well-known approaches to RFDS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness.

(computer science) A decentralised distributed system that performs the functions of a hash table.


greedy property

It has the greedy property (difficult to prove in time-critical contest environment!). If we make a choice that seems like the best at the moment and proceed to solve the remaining subproblem, we reach the optimal solution. We will never have to reconsider our previous choices.

2013, Steven Halim, Felix Halim, Competitive Programming 3: The New Lower Bound of Programming Contests., page 89:

Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure, making techniques like dynamic programming inapplicable.

2012, Betsy George, Sangho Kim, Spatio-temporal Networks: Modeling and Algorithms (SpringerBriefs in Computer Science), Springer Science & Business Media, →ISBN, page 25:

(computer science) The property of being globally solvable optimally by making optimal decisions locally.


dynamic programming

Coined by American mathematician Richard E. Bellman in the 1940s.

coinage

The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.

1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, →ISBN, page 73:

Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.

2000, Rein Luus, “Preface”, in Iterative Dynamic Programming, CRC Press, →ISBN:

optimal substructure
optimal substructure

(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.


WHP

(mathematics, computer science) Initialism of with high probability.


regular language

en-noun

regular language (plural regular languages)

There is an interesting way to get the negation (complement) of a regular language L defined by a FS automaton, provided the automaton is ε-free.

2007, Dick Grune, Ceriel J.H. Jacobs, Parsing Techniques: A Practical Guide, Springer Science & Business Media, →ISBN, page 152:

A regular language is one that can be generated by a regular grammar or finite-state automaton, the lowest level of the Chomsky hierarchy. It is well known that these grammars are inadequate to represent natural language syntax.

2014, Brian MacWhinney, William O'Grady, The Handbook of Language Emergence, John Wiley & Sons, →ISBN, page 393:

finite-state machine
finite-state machine

(computer science) A formal language that can be expressed using a regular expression or finite-state machine.


clockable

LL-Q1860 (eng)-Flame, not lame-clockable.wav

Then if I completes its computational task in exactly α steps we say that the ordinal α is clockable. By the previous definition, any natural number is clockable. In addition, there are many other ordinals that are clockable.

2008, Apostolos Syropoulos, Hypercomputation: Computing Beyond the Church-Turing Barrier, →ISBN:

(computer science) Of an ordinal such that an infinite-time Turing machine can complete in so many steps of computation.


link/cut tree

Invented by Daniel Dominic Sleator and Robert Endre Tarjan in 1982.

(computer science) A data structure that represents a forest (a set of rooted trees) and allows dynamic updates on the tree in logarithmic time.

Daniel Dominic Sleator
Robert Endre Tarjan


Fenwick tree

Named for Peter Fenwick who described the concept in 1994.

(computer science) A data structure that maintains prefix sums over a list of numbers while allowing dynamic updates and queries in logarithmic time.


binary indexed tree

binary indexed tree (plural binary indexed trees)

(computer science) Synonym of Fenwick tree


sparse table

(computer science) A data structure that can answer range maximum or range minimum queries on an immutable list of values in constant time, and other range queries in logarithmic time.


square root decomposition

square root decomposition (plural square root decompositions)

(computer science) 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 √ chunks and performing operations on whole chunks when possible.


segment tree

(computer science) A data structure that is used to store information about intervals (segments) and perform range queries, or queries on a set of intervals, in logarithmic time.


topological sort

topological sort (plural topological sorts)

(graph theory, computer science) 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.


archaeoinformatics

(archaeology, computer science) The application of informatics to archaeology


value restriction

A typical example is an expression returning always the empty list. It should be given the polymorphic type α list, but this is not possible under the value restriction if the expression has to be evaluated.

2004, Jacques Garrigue, Relaxing the Value Restriction:

It has been found empirically that eta expansion usually suffices for dealing with the value restriction.

2007, Geoffrey Smith, Notes on SML97's Value Restriction:

(computer science, type theory) In a functional language, inference of a polymorphic type only for syntactic values (values that can be evaluated at compile time) to ensure that a program is type-safe.


one-hot

(electronics, computer science) A set of bits with only a single high (1) bit, with the remaining bits low (0).


activation function

activation function (plural activation functions)

(computer science) A function that defines the output of a particular node in an artificial neural network on the basis of its inputs.


computational geometry

1991, Herbert Edelsbrunner, Lines in Space—A Collection of Results, Jacob E. Goodman, Richard D. Pollack, William L. Steiger (editors), Discrete and Computational Geometry: Papers from the DIMACS Special Year, American Mathematical Society, Association for Computing Machinery, page 77,
In computational geometry it is a truism that problems in three-dimensional space, ℝ³, are significantly more difficult and complex than the corresponding problems in the two-dimensional plane, ℝ².

2003, Ren-Hong Wang, Multivariate Spline and Geometry, Ren-Hong Wang (editor), Computational Geometry, American Mathematical Society, International Press, page 195,
In this survey, we will be concerned with the relationship between multivariate splines and geometries including computational geometry, differential geometry, and algebraic geometry.

Computational geometry processing is about practical algorithms that operate on geometric data sets, and these data sets tend to be rather large if they are to be useful.

2012, J. Andreas Bærentzen, Jens Gravesen, François Anton, Henrik Aanæs, Guide to Computational Geometry Processing, Springer, page 1:

(computer science, geometry) A field of study, within computer science, devoted to algorithms that solve problems formulated in geometric terms.


state diagram

(computer science) A diagram showing the states of a system and their interactions.


QTM

QTM (countable and uncountable, plural QTMs)

quantum Turing machine
quantum Turing machine#English

(computer science, quantum mechanics) Abbreviation of quantum Turing machine.


compatibilize

en-verb

compatibilize (third-person singular simple present compatibilizes, present participle compatibilizing, simple past and past participle compatibilized)

compatibilizes (present singular third-person)
compatibilizing (participle present)
compatibilized (participle past)
compatibilized (past)

LL-Q1860 (eng)-Flame, not lame-compatibilize.wav

(transitive, US, informal, computer science) To make compatible.


compatibilise

compatibilise (third-person singular simple present compatibilises, present participle compatibilising, simple past and past participle compatibilised)

compatibilises (present singular third-person)
compatibilising (participle present)
compatibilised (participle past)
compatibilised (past)

(transitive, British spelling, informal computer science) To make compatible.


DOAC

(computer science) Acronym of description of a career. (an RDF format describing a person's professional background)


mouse slip

(computer chess) An unintentional mouseclick due to jittery or imprecise movement of a mouse.


mouse slip

mouse slip (third-person singular simple present mouse slips, present participle mouse slipping, simple past and past participle mouse slipped)

mouse slips (present singular third-person)
mouse slipping (participle present)
mouse slipped (participle past)
mouse slipped (past)