fa

head

fa (countable and uncountable, plural fák)

fák (plural)
fa (nominative singular)
fák (nominative plural)
fát (accusative singular)
fákat (accusative plural)
fának (dative singular)
fáknak (dative plural)
fával (instrumental singular)
fákkal (instrumental plural)
fáért (causal-final singular)
fákért (causal-final plural)
fává (singular translative)
fákká (plural translative)
fáig (singular terminative)
fákig (plural terminative)
faként (essive-formal singular)
fákként (essive-formal plural)
fában (inessive singular)
fákban (inessive plural)
fán (singular superessive)
fákon (plural superessive)
fánál (adessive singular)
fáknál (adessive plural)
fába (illative singular)
fákba (illative plural)
fára (singular sublative)
fákra (plural sublative)
fához (allative singular)
fákhoz (allative plural)
fából (elative singular)
fákból (elative plural)
fáról (delative singular)
fákról (delative plural)
fától (ablative singular)
fáktól (ablative plural)
fáé (singular)
fáké (plural)
fáéi (singular)
fákéi (plural)
fám (first-person possessed-single possessive singular)
fáim (first-person possessed-many possessive singular)
fád (possessed-single possessive second-person singular)
fáid (possessed-many possessive second-person singular)
fája (possessed-single possessive singular third-person)
fái (possessed-many possessive singular third-person)
fánk (first-person plural possessed-single possessive)
fáink (first-person plural possessed-many possessive)
fátok (plural possessed-single possessive second-person)
fáitok (plural possessed-many possessive second-person)
fájuk (plural possessed-single possessive third-person)
fáik (plural possessed-many possessive third-person)

From Proto-Uralic *puwe. Cognates include Finnish puu.

(computing theory) tree (recursive data structure)


acceptor

acceptors (plural)
acceptour (alternative obsolete rare)

From Middle English acceptour, from Latin acceptor, with the meanings from accept.

finite-state machine
finite-state machine

(computing theory) A kind of finite-state machine whose binary output indicates whether or not a received input was accepted.


tree

Jamaican Creole: chrii

[t̠͡ɹ̠̊˔ʷiː]

Etymology tree
Proto-Indo-European *drew-
Proto-Indo-European *-om
Proto-Germanic *trewą
Proto-West Germanic *treu
Old English trēow
Middle English tre
English tree
 PIE word
 *dóru
From Middle English tre, tree, treo, treou, trew, trow, from Old English trēo, trēow (“tree, wood, timber, beam, log, stake, stick, grove, cross, rood”), from Proto-West Germanic *treu, from Proto-Germanic *trewą (“tree, wood”), from pre-Germanic *dréwom, thematic e-grade derivative of Proto-Indo-European *dóru (“tree”). Eclipsed alternative terms for tree in Middle English: Middle English beem, from Old English bēam (see beam) and Middle English arbre, from Old French arbre.
Cognates
From the same Proto-Indo-European: Scots tree (“wood, rod, stick”), North Frisian tre, trä (“tree”)Danish træ (“tree”), Swedish trä (“wood”), träd (“tree”), Norwegian tre (“tree”), Icelandic tré (“tree”), Gothic 𐍄𐍂𐌹𐌿 (triu, “tree, wood, piece of wood”), Sanskrit दारु (dāru, “tree, wood”), Albanian dru (“tree, wood”), Welsh dâr (“oaks”), Ancient Greek δόρυ (dóru, “wood, spear”), Russian де́рево (dérevo) or дре́во (drévo), Tocharian A or. Related to tar, true.

cog

fall out of the ugly tree and hit every branch

the apple does not fall far from the tree

the apple doesn't fall far from the tree

(computing theory) A recursive data structure in which each node has zero or more nodes as children.

ծառ

(computing theory) recursive data structure


imperative

en-adj

imperative (comparative more imperative, superlative most imperative)

more imperative (comparative)
most imperative (superlative)
imp. (alternative abbreviation)
imper. (alternative abbreviation)

[ɪmˈpɛɹ.ə.ɾɪv]

(computing theory) Having semantics that incorporates mutable variables.

imperatiivinen

computing: having semantics that incorporates mutable variables


sibling

First use appears c. 1903, a modern revival of Old English sibling (“relative, a relation, kinsman”), equivalent to sib + -ling. Compare Middle English siblynges pl, sib, sibbe (“relative; kinsman”), German Sippe. The term apparently meant merely kin or relative until the 20th century when it was applied in a way that aided the study of genetics, which led to its specialized use. For example, the OED has a citation in 1902 in which sibling must be defined for those who do not know the intended meaning.

lbor

(computing theory) A node in a data structure that shares its parent with another node.


sister

en-noun

sister (plural sisters or (archaic in most senses) sistren)

sisters (plural)
sistren (archaic plural)

desc

→ Gulf Arabic: سِسْتَر (sistar, “female nurse”)

→ Japanese: シスター (shisutā)

→ Korean: 시스터 (siseuteo)

PIE word
 *swésōr
From Middle English sister, suster, from Old English swustor, sweoster, sweostor (“sister, nun”); from Proto-Germanic *swestēr (“sister”), from Proto-Indo-European *swésōr (“sister”).
Cognate with Scots sister, syster (“sister”), West Frisian sus, suster (“sister”), Dutch zuster (“sister”), German Schwester (“sister”), Norwegian Bokmål søster (“sister”), Norwegian Nynorsk and Swedish syster (“sister”), Icelandic systir (“sister”), Gothic 𐍃𐍅𐌹𐍃𐍄𐌰𐍂 (swistar, “sister”), Latin soror (“sister”), Russian сестра́ (sestrá, “sister”), Lithuanian sesuo (“sister”), Albanian vajzë (“girl, maiden”), Sanskrit स्वसृ (svásṛ, “sister”), Persian خواهر (xâhar, “sister”).
In standard English, the form with i is due to contamination with Old Norse systir (“sister”).
The plural sistren is from Middle English sistren, a variant plural of sister, suster (“sister”); compare brethren.

妹妹

mui⁶⁻⁴ mui⁶⁻²

ເອື້ອຍ

ē ʼư̄ ʼa nya


finger

Sranan Tongo: finga

PIE word
 *pénkʷe
From Middle English fynger, finger, from Old English finger (“finger”), from Proto-West Germanic *fingr, from Proto-Germanic *fingraz (“finger”), from Proto-Indo-European *penkʷrós, from *pénkʷe (“five”). Compare West Frisian finger, Low German/German Finger, Dutch vinger, Danish, Norwegian, and Swedish finger; also Old Armenian հինգեր-որդ (hinger-ord, “fifth”). More at five.

sormi

something similar in function to a finger

Something similarly extending, (especially) from a larger body, particularly:

(computing theory) A leaf in a finger tree data structure.


complete

en-adj

complete (comparative more complete or completer, superlative most complete or completest)

more complete (comparative)
completer (comparative)
most complete (superlative)
completest (superlative)
compleat (alternative archaic)

From Middle English compleet (“full, complete”), borrowed from Old French complet or Latin completus, past participle of compleō (“I fill up, I complete”) (whence also complement, compliment), from com- + pleō (“I fill, I fulfill”) (whence also deplete, replete, plenty), ultimately from Proto-Indo-European *pleh₁- (“to fill”) (English full).

пълен

of a proof system: such that any semantically valid formula is also provable

complete androgen insensitivity syndrome

QMA arises naturally in the study of quantum computation, and it also has a complete problem, Local Hamiltonian, which is a generalization of k-SAT.

2007, Yi-Kai Liu, The Complexity of the Consistency and N-representability Problems for Quantum States, page 17:

BPP behaves differently in some ways from other classes we have seen. For example, we know of no complete languages for BPP.

2009, Sanjeev Arora, Boaz Barak, Computational Complexity: A Modern Approach, page 137:

(computing theory, of a problem) That is in a given complexity class and is such that every other problem in the class can be reduced to it (usually in polynomial time or logarithmic space).


turtle

Modification of Middle English tortou, tortu, from Old French tortüe (under the influence of Middle English turtel, turtur (“turtledove”), see Etymology 2 below), from Medieval Latin tortuca (compare Spanish tortuga), the same source of tortoise (see there for more). Displaced native Old English byrdling.

(computing theory) A small element towards the end of a list of items to be bubble sorted, and thus tending to take a long time to be swapped into its correct position. Compare rabbit.


NC

(computing theory) Nick's Class, the complexity class of decision problems solvable in polylogarithmic time using a polynomial number of processors.


hoist

en-verb

hoist (third-person singular simple present hoists, present participle hoisting, simple past and past participle hoisted or hoist)

hoists (present singular third-person)
hoisting (participle present)
hoisted (participle past)
hoisted (past)
hoist (participle past)
hoist (past)

Alteration of earlier hoise (“to hoist”), apparently based on the past tense forms, from Middle Dutch hisen (“to hoist”). Compare modern Dutch hijsen (“to hoist”), German hissen (“to hoist”), Danish hejse (“to hoist”). Compare also French hisser (“to hoist”), Galician isar (“to hoist”), Spanish izar (“to hoist”), Catalan hissar (“to hoist”), Italian issare (“to hoist”), Sicilian jisari (“to hoist”), all borrowed from a Germanic source.

(transitive, computing theory) To extract (code) from a loop construct as part of optimization.


grammar

en-noun

grammar (countable and uncountable, plural grammars)

grammars (plural)
grammary (alternative archaic)
grammer (alternative obsolete)

/ˈɡɹæm.ə(ɹ)/

From Middle English gramere, from Old French gramaire (“classical learning”), from unattested Vulgar Latin *grammāria, an alteration of Latin grammatica, from Ancient Greek γραμματική (grammatikḗ, “skilled in writing”), from γράμμα (grámma, “line of writing”), from γράφω (gráphō, “write”), from Proto-Indo-European *gerbʰ- (“to carve, scratch”). Displaced native Old English stæfcræft; a doublet of glamour, glamoury, gramarye, and grimoire. Piecewise doublet of grammatic.

grammatika

rules for speaking and writing a language

قَوَاعِد

in computing: formal system specifying the syntax of a language

Because real lexicons are big and complex, from a software engineering perspective it is best to write simple grammars that have a simple, well-defined way, of pulling out the information they need from vast lexicons. That is, grammars should be thought of as separate entities which can access the information contained in lexicons. We can then use specialised mechanisms for efficiently storing the lexicon and retrieving data from it.

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

(computing theory) A formal system specifying the syntax of a language.

(computing theory) A formal system defining a formal language.


sentence

Borrowed from Middle French sentence, from Latin sententia (“way of thinking, opinion, sentiment”), from sentiēns, present participle of sentiō (“to feel, think”), ultimately from Proto-Indo-European *sent- (“to feel”).

der

(computing theory) Any of the set of strings that can be generated by a given formal grammar.

lause

computing: string that can be generated by a given formal grammar


ring

→ French: ring
→ Romanian: ring

→ Hungarian: ring

→ Italian: ring

→ Japanese: リング

→ Polish: ring

→ Serbo-Croatian: ring

→ Spanish: ring

→ Turkish: ring

From Middle English ryng, from Old English hring (“ring, circle”), from Proto-West Germanic *hring, from Proto-Germanic *hringaz (“ring”), from Proto-Indo-European *(s)krengʰ-, extended nasalized form of *(s)ker- (“to turn, bend”). Doublet of rank and rink, as well as indirectly range.
Cognates
* West Frisian ring
* Low German Ring
* Dutch ring
* German Ring
* Swedish ring
* Finnish rengas
More distantly cognate with Proto-Slavic *krǫgъ (whence Bulgarian кръг (krǎg), Polish krąg, Russian круг (krug)).

Kernel Mode processes run in ring 0, and User Mode processes run in ring 3.

2007, Steve Anson, Steve Bunting, Mastering Windows Network Forensics and Investigation, page 70:

(computing theory) A hierarchical level of privilege in a computer system, usually at hardware level, used to protect data and functionality (also protection ring).


rabbit

en-noun

rabbit (countable and uncountable, plural rabbits)

From Middle English rabet, rabette, from Anglo-Latin rabettus, from dialectal Old French rabotte, probably a diminutive of Middle Dutch or West Flemish robbe (“rabbit, seal”), of uncertain origin; possibly some imitative verb, maybe robben, rubben (“to rub”) is used here to allude to a characteristic of the animal. See rub.
Related forms include Middle French rabouillet (“baby rabbit”) and in French rabot (“plane”)), coming via Walloon Old French (reflected nowadays as Walloon robète (“rabbit”)), from Middle Dutch robbe ("rabbit; seal"; whence Modern Dutch rob (“rabbit", also "seal”)); also Middle Low German robbe, rubbe (“rabbit”), and the later German Low German Rubbe, Robb (“seal”), West Frisian robbe (“seal”), Saterland Frisian Rubbe (“seal”), North Frisian rob (“seal”), borrowed into German Robbe (“seal”).
Meant "young rabbit" until the 19th c., when it came to replace the original general term cony, owing to the latter's resemblance to and use as a euphemism for cunny, "vulva" (compare ass and donkey).

onomatopoeic

imitative

gl

"rabbit; seal"; whence Modern Dutch <i class="Latn mention" lang="nl">rob</i> (“rabbit", also "seal”)

(computing theory) A large element at the beginning of a list of items to be bubble sorted, and thus tending to be quickly swapped into its correct position. Compare turtle.


terminal

→ Bulgarian: термина́л (terminál)

→ Japanese: ターミナル (tāminaru)

→ Korean: 터미널 (teomineol)

desctree

→ Russian: термина́л (terminál)
→ Kazakh: терминал (terminal)

Borrowed from Late Latin terminalis (“pertaining to a boundary or to the end, terminal, final”), from Latin terminus (“a bound, boundary, limit, end”). See term, terminus.

термина́л

computing - the end of a line of signals

(computing theory) A terminal symbol in a formal grammar.


tile

en-verb

tile (third-person singular simple present tiles, present participle tiling, simple past and past participle tiled)

tiles (present singular third-person)
tiling (participle present)
tiled (participle past)
tiled (past)

From Middle English tile, tyle, tigel, tiȝel, teȝele, from Old English tieġle, tiġle, tiġele (“tile; brick”), from Proto-West Germanic *tigulā, from Proto-Germanic *tigulǭ (“tile”), from Latin tēgula. Doublet of tegula.
Cognates
Cognate with Saterland Frisian Tichel (“tile”), West Frisian teil, tegel, tichel (“tile”), Dutch tichel, tegel (“tile”), German Ziegel (“brick; tile”), Danish tegl (“brick”), Swedish tegel (“brick; tile”), Icelandic tigl (“tile; brick”).

(computing theory) To optimize (a loop in program code) by means of the tiling technique.


type

→ Japanese: タイプ

→ Korean: 타입 (taip)

From Middle English type (“symbol, figure, emblem”), from Latin typus, from Ancient Greek τύπος (túpos, “mark, impression, type”), from τύπτω (túptō, “I strike, beat”).

tyyppiyksilö

biology: individual representative of its taxonomic group

(computing theory) A tag attached to variables and values used in determining which kinds of value can be used in which situations; a data type.

tipu

computing theory: tag indicating data type


recursive

en-adj

recursive (comparative more recursive, superlative most recursive)

more recursive (comparative)
most recursive (superlative)

/ɹɪˈkɜː(ɹ)sɪv/

Learned borrowing from New Latin recursīvus. Equivalent to recurse + -ive

lbor

filtered-popping recursive transition network

(computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time

recursief

computing: of a function which can be computed in a finite amount of time

(computing theory, not comparable, of a set) whose characteristic function is recursive (4)

recursief

computing: of a set whose characteristic function is recursive

recursively enumerable

of a set, whose characteristic function is recursive


functional

en-adj

functional (comparative more functional, superlative most functional)

more functional (comparative)
most functional (superlative)

/ˈfʌŋkt͡ʃənəl/

(computing theory) Having semantics defined purely in terms of mathematical functions, without side-effects.

функционален

having semantics defined purely in terms of mathematical functions, without side-effects


application

en-noun

application (countable and uncountable, plural applications)

/ˌæplɪˈkeɪʃən/

/ˌæpləˈkeɪʃən/

From Late Middle English applicacioun, borrowed from Old French aplicacion (French application), from Latin applicātiōnem, accusative singular of applicātiō (“attachment; application, inclination”), from applicō (“join to, attach; apply”).

(computing theory) The substitution of a specific value for the parameter in the abstraction, in lambda calculus.


puu

puu (nominative singular)
puut (nominative plural)
puu (accusative nominative singular)
puut (accusative nominative plural)
puun (accusative genitive singular)
puut (accusative genitive plural)
puun (genitive singular)
puiden (genitive plural)
puitten (genitive plural)
puuta (partitive singular)
puita (partitive plural)
puussa (inessive singular)
puissa (inessive plural)
puusta (elative singular)
puista (elative plural)
puuhun (illative singular)
puihin (illative plural)
puulla (adessive singular)
puilla (adessive plural)
puulta (ablative singular)
puilta (ablative plural)
puulle (allative singular)
puille (allative plural)
puuna (essive singular)
puina (essive plural)
puuksi (singular translative)
puiksi (plural translative)
puutta (abessive singular)
puitta (abessive plural)
puin (instructive plural)
See the possessive forms below. (comitative)
puuni (nominative singular)
puuni (nominative plural)
puuni (accusative nominative singular)
puuni (accusative nominative plural)
puuni (accusative genitive singular)
puuni (accusative genitive plural)
puuni (genitive singular)
puideni (genitive plural)
puitteni (genitive plural)
puutani (partitive singular)
puitani (partitive plural)
puussani (inessive singular)
puissani (inessive plural)
puustani (elative singular)
puistani (elative plural)
puuhuni (illative singular)
puihini (illative plural)
puullani (adessive singular)
puillani (adessive plural)
puultani (ablative singular)
puiltani (ablative plural)
puulleni (allative singular)
puilleni (allative plural)
puunani (essive singular)
puinani (essive plural)
puukseni (singular translative)
puikseni (plural translative)
puuttani (abessive singular)
puittani (abessive plural)
puineni (comitative plural)
puusi (nominative singular)
puusi (nominative plural)
puusi (accusative nominative singular)
puusi (accusative nominative plural)
puusi (accusative genitive singular)
puusi (accusative genitive plural)
puusi (genitive singular)
puidesi (genitive plural)
puittesi (genitive plural)
puutasi (partitive singular)
puitasi (partitive plural)
puussasi (inessive singular)
puissasi (inessive plural)
puustasi (elative singular)
puistasi (elative plural)
puuhusi (illative singular)
puihisi (illative plural)
puullasi (adessive singular)
puillasi (adessive plural)
puultasi (ablative singular)
puiltasi (ablative plural)
puullesi (allative singular)
puillesi (allative plural)
puunasi (essive singular)
puinasi (essive plural)
puuksesi (singular translative)
puiksesi (plural translative)
puuttasi (abessive singular)
puittasi (abessive plural)
puinesi (comitative plural)
puumme (nominative singular)
puumme (nominative plural)
puumme (accusative nominative singular)
puumme (accusative nominative plural)
puumme (accusative genitive singular)
puumme (accusative genitive plural)
puumme (genitive singular)
puidemme (genitive plural)
puittemme (genitive plural)
puutamme (partitive singular)
puitamme (partitive plural)
puussamme (inessive singular)
puissamme (inessive plural)
puustamme (elative singular)
puistamme (elative plural)
puuhumme (illative singular)
puihimme (illative plural)
puullamme (adessive singular)
puillamme (adessive plural)
puultamme (ablative singular)
puiltamme (ablative plural)
puullemme (allative singular)
puillemme (allative plural)
puunamme (essive singular)
puinamme (essive plural)
puuksemme (singular translative)
puiksemme (plural translative)
puuttamme (abessive singular)
puittamme (abessive plural)
puinemme (comitative plural)
puunne (nominative singular)
puunne (nominative plural)
puunne (accusative nominative singular)
puunne (accusative nominative plural)
puunne (accusative genitive singular)
puunne (accusative genitive plural)
puunne (genitive singular)
puidenne (genitive plural)
puittenne (genitive plural)
puutanne (partitive singular)
puitanne (partitive plural)
puussanne (inessive singular)
puissanne (inessive plural)
puustanne (elative singular)
puistanne (elative plural)
puuhunne (illative singular)
puihinne (illative plural)
puullanne (adessive singular)
puillanne (adessive plural)
puultanne (ablative singular)
puiltanne (ablative plural)
puullenne (allative singular)
puillenne (allative plural)
puunanne (essive singular)
puinanne (essive plural)
puuksenne (singular translative)
puiksenne (plural translative)
puuttanne (abessive singular)
puittanne (abessive plural)
puinenne (comitative plural)
puunsa (nominative singular)
puunsa (nominative plural)
puunsa (accusative nominative singular)
puunsa (accusative nominative plural)
puunsa (accusative genitive singular)
puunsa (accusative genitive plural)
puunsa (genitive singular)
puidensa (genitive plural)
puittensa (genitive plural)
puutaan (partitive singular)
puutansa (partitive singular)
puitaan (partitive plural)
puitansa (partitive plural)
puussaan (inessive singular)
puussansa (inessive singular)
puissaan (inessive plural)
puissansa (inessive plural)
puustaan (elative singular)
puustansa (elative singular)
puistaan (elative plural)
puistansa (elative plural)
puuhunsa (illative singular)
puihinsa (illative plural)
puullaan (adessive singular)
puullansa (adessive singular)
puillaan (adessive plural)
puillansa (adessive plural)
puultaan (ablative singular)
puultansa (ablative singular)
puiltaan (ablative plural)
puiltansa (ablative plural)
puulleen (allative singular)
puullensa (allative singular)
puilleen (allative plural)
puillensa (allative plural)
puunaan (essive singular)
puunansa (essive singular)
puinaan (essive plural)
puinansa (essive plural)
puukseen (singular translative)
puuksensa (singular translative)
puikseen (plural translative)
puiksensa (plural translative)
puuttaan (abessive singular)
puuttansa (abessive singular)
puittaan (abessive plural)
puittansa (abessive plural)
puineen (comitative plural)
puinensa (comitative plural)

From Proto-Finnic *puu, from Proto-Uralic *puwe / *pawe. Cognates include Estonian puu, Karelian puu, Eastern Mari пу (pu), Udmurt пу (pu) and Hungarian fa.

(graph theory, computing theory) tree (data structure, connected acyclic graph)


NP

NP (countable and uncountable, plural NPs)

Another class, P, is a subset of NP, and includes all decision problems that can be solved by a (deterministic) Turing machine in polynomial time.

2017, Arlindo Oliveira, The Digital Mind: How Science Is Redefining Humanity, MIT Press, →ISBN, page 81:

(computing theory) Abbreviation of nondeterministic polynomial, the complexity class of computational problems that a nondeterministic Turing machine can solve in polynomial time.


fuzzy

en-adj

fuzzy (comparative fuzzier, superlative fuzziest)

fuzzier (comparative)
fuzziest (superlative)

Uncertain. Apparently from fuzz + -y, though some sources suggest that fuzz derives from fuzzy. Compare fozy, or Low German fussig (“loose; spongy”).

(computing theory) Employing or relating to fuzzy logic.


tagger

To include part-of-speech (POS) information, the corpus was tagged using the CLAWS tagger.

2018, Clarence Green, James Lambert, “Advancing disciplinary literacy through English for academic purposes: Discipline-specific wordlists, collocations and word families for eight secondary subjects”, in Journal of English for Academic Purposes, volume 35, →DOI, page 109:

(computing theory) A program or algorithm that adds tags for purposes of categorization, e.g. grammatical information to words in a document, or genres to songs in a music collection.


lazy

lazy (comparative lazier, superlative laziest)

lazier (comparative)
laziest (superlative)

Attested since 1540, origin uncertain. Probably from Low German and Middle Low German lasich (“slack, feeble, lazy”), from las, from Old Saxon lask, from Proto-Germanic *lasiwaz, *laskaz (“feeble, weak”), from Proto-Indo-European *las- (“weak”).
Akin to Dutch leuzig (“lazy”), Old Norse lasinn (“limpy, tired, weak”), Old English lesu, lysu (“false, evil, base”). More at lush.
An alternate etymology traces lazy to Early Modern English laysy, a derivative of lay (plural lays + -y) in the same way that tipsy is derived from tip. See lay.

der

the quick brown fox jumps over the lazy dog

a lazy algorithm

(computing theory) Employing lazy evaluation; not calculating results until they are immediately required.


crisp

en-adj

crisp (comparative crisper, superlative crispest)

crisper (comparative)
crispest (superlative)

The adjective is derived partly from the following:
* Sense 1: Middle English crisp (“curly; having curly hair or wool; of fabric: crinkly, wrinkled; of water: rippled”), from Old English crisp (“curly”), from Latin crispus (“of hair: crimped, curly”), possibly ultimately from Proto-Indo-European *kris-, from *(s)ker- (“to bend; to turn”).
* Sense 2: from the above, and probably also onomatopoeic, representing a crinkling or crunching sound.
Doublet of crape and crepe.
Adjective sense 2.2.3 (“of air, weather, etc.: cool and dry”) is transferred from a description of frost or snow as “crisp”, that is, crunchy.
The noun is derived partly from the following:
* Middle English crisp (“light, crinkled fabric; kind of pastry; crinkliness or roughness of skin”), from crisp (adjective) (see above).
* Modern English crisp (adjective) (“having a consistency which is hard yet brittle”).

inh

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-crisp.wav

(computing theory) Not using fuzzy logic; based on a binary distinction between true and false.


eager

en-adj

eager (comparative more eager, superlative most eager)

more eager (comparative)
most eager (superlative)
aigre (alternative)
eagre (alternative)

From Middle English egre, eger, from Old French aigre, egre (modern French aigre), from Latin ācrus, variant of ācer (“sharp, keen”); see acid, acerb, etc. Compare vinegar, alegar.

an eager algorithm

(computing theory) Not employing lazy evaluation; calculating results immediately, rather than deferring calculation until they are required.


splay

en-verb

splay (third-person singular simple present splays, present participle splaying, simple past and past participle splayed)

splays (present singular third-person)
splaying (participle present)
splayed (participle past)
splayed (past)

PIE word
 *dwís
The verb is derived from Middle English splaien, splayen (“to display; to spread out, unfurl (a flag, etc.); (cooking) to cut open (a fish) lengthwise and lay it open; (figurative) to appear; to spread”), an aphetic form of Middle English displaien, displayen (“to display”): see display.
The adjective and adverb are derived from the verb, or from splayfoot (noun) or splayfooted (adjective). The noun is derived from the verb.

harottaa

to spread out awkwardly — see also sprawl

(computing theory) To rearrange (a splay tree) so that a desired element is placed at the root.

siirtää splay-puun juureksi

to rearrange (a splay tree) so that a desired element is placed at the root


lambda calculus

en-noun

lambda calculus (countable and uncountable, plural lambda calculi)

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-lambda calculus.wav

Coined by Alonzo Church after the use of the Greek letter lambda (λ) as the basic abstraction operator in the calculus.

In the 1930s, while Turing was developing what are now called ‘Turing machines’ as a model for computation, Church and his student Kleene were developing a different model, called the ‘lambda calculus’ [29, 63]. While a Turing machine can be seen as an idealized, simplified model of computer hardware, the lambda calculus is more like a simple model of software.

2009 February 3, John C. Baez with Mike Stay, “Physics, Topology, Logic and Computation: A Rosetta Stone”, in (Please provide the book title or journal name), page 50:

functionally complete
functionally complete

(computing theory) Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions.


quantum

→ French: quantum

→ Portuguese: quantum

[ˈkʰwɑ̃ntʰə̃m]

[ˈkʰwɑ̃ɾ̃ə̃m]

From Late Latin quantum, noun use of neuter form of Latin quantus (“how much”).

(physics) Involving quanta, quantum mechanics or other aspects of quantum physics.

(computing theory) Relating to a quantum computer.


state machine

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-state machine.wav

This algorithm will produce a state machine for parsing a given context-free grammar.

finite-state machine
finite-state machine#English

(computing theory) Ellipsis of finite-state machine.


transition function

transition function (plural transition functions)

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-transition function.wav

(computing theory) A function from (state, input symbol) to state describing what state to move to on receiving a given input in a given state.


DFA

finite-state automaton
finite-state machine#English

(computing theory) Initialism of deterministic finite-state automaton.


mem

(computing theory) A memory access as part of processing.


angelic non-determinism

With angelic non-determinism, any problem in NP would be solvable in polynomial time.

(computing theory) A notional ability always to choose the most favorable option, in constant time.


cone

From Middle English cone (“corner, angle”) and conoun (“cone”), from Medieval Latin cōnus, cōnon (“cone, wedge, peak”), from Ancient Greek κῶνος (kônos, “cone, spinning top, pine cone”). Reinforced by Middle French cone, from the same Graeco-Latin source.

der

recursively enumerable
recursively enumerable

(computing theory) A set of formal languages with certain desirable closure properties, in particular those of the regular languages, the context-free languages and the recursively enumerable languages.


decide

en-verb

decide (third-person singular simple present decides, present participle deciding, simple past and past participle decided)

decides (present singular third-person)
deciding (participle present)
decided (participle past)
decided (past)

From Middle English deciden, from Old French decider, from Latin dēcīdere, infinitive of dēcīdō (“cut off, decide”), from dē (“down from”) + caedō (“cut”).

No Turing Machine can decide the halting problem.

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

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

(computing theory) Of a Turing machine: to return a correct answer (for some yes-or-no problem) on every possible input.


SAT

Abbreviation of Boolean satisfiability problem.

abbrev

(computing theory) The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem.


nugget

en-noun

nugget (countable and uncountable, plural nuggets)

→ Portuguese: nugget

Uncertain, first attested in reference to animals & people in Scotland and in reference to ore chunks in Australia. Possibly from southern English nug (“lump, block”) or Scottish knudge/nudge (“short, sturdy person or animal”) + -et (“forming diminutives”) or from rebracketed alteration of an ingot as a ni(n)got.

affix

We have previously said that the heuristic algorithms produce good nuggets for most classes and most λ values […]

2002, Data Mining: A Heuristic Approach, (Please provide the book title or journal name), page 93:

(computing theory) A partial description gleaned from data mining.


reduction

en-noun

reduction (countable and uncountable, plural reductions)

From Middle English reduccion, a borrowing from Old French reducion, from Latin reductiō, reductiōnem.

polynomial-time reduction
polynomial-time reduction

(computing theory) A transformation of one problem into another problem, such as mapping reduction or polynomial-time reduction.

réduction

computability theory: a transformation of one problem into another problem


Turing machine

Named after English mathematician, logician, and cryptographer Alan Turing (1912–1954), who introduced the concept in 1936 to give a mathematically precise definition of computability.

named-after

(computing theory) An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state.


oracle

From Middle English oracle, from Old French oracle m, from Latin ōrāculum n.

Thus, an oracle machine (which enacts an oracle algorithm) would be like an ordinary Turing machine, except that adjoined to its ordinary computational operations would be another operation: ‘Call in the oracle and ask it whether C_q(n) stops; […]

1994, Roger Penrose, “Quantum theory and the brain”, in Shadows of the Mind, Oxford University Press, →ISBN, page 380:

(computing theory) A theoretical entity capable of answering some collection of questions.


certificate

→ Punjabi: ਸਰਟੀਫਿਕੇਟ (sarṭīphikeṭ)

→ Welsh: stifficet

General Certificate of Secondary Education

(computing theory) The information needed in order to verify a positive answer to a problem.

todiste

computing theory: information needed to verify a positive answer to a problem


AFL

abstract family of languages
w:abstract family of languages

(computing theory) Initialism of abstract family of languages.


functionally complete

(computing theory) Capable of computing any recursive function.


Turing complete

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-Turing complete.wav

All languages that are equivalent to Turing's specification are said to be Turing complete. Turing completeness is a surprisingly low bar. Many hand calculators can understand a Turing complete language. PDF (Portable Document Format), in which many documents on the Internet are available, is itself a Turing complete language.

2005, Ben Klemens, Math You Can't Use: Patents, Copyright, and Software, Brookings Institution Press, →ISBN, page 35:

universal Turing machine
universal Turing machine

(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.


universal Turing machine

en-noun

universal Turing machine (plural universal Turing machines)

From Alan Turing, English mathematician, logician, and cryptographer.

(computing theory) A Turing machine capable of simulating the behavior of any Turing machine.

universaali Turingin kone

Turing machine capable of simulating all the other Turing machines


computability

computability (countable and uncountable, plural computabilities)

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

(computing theory) The property of being computable by purely mechanical means.


computable

(computing theory) Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable.


PDA

PDA (countable and uncountable, plural PDAs)

pushdown automaton
pushdown automaton#English

(computing theory) Initialism of pushdown automaton.

携帯情報端末

けいたいじょうほうたんまつ


transducer

1924, Latin trānsdūcō + -er. By surface analysis, transduce + -er.

(computing theory) A state machine that generates output based on a given input.


deforestation

deforestation (countable and uncountable, plural deforestations)

/dɪˌfɒɹɪsˈteɪʃən/

/ˌdiːfɒɹɪsˈteɪʃən/

From deforest + -ation. First attested in 1870.

(computing theory) A transformation to eliminate intermediate data structures within a program.


family tree

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

(computing, computing theory) A data structure that organizes resources or machines in a distributed system, consisting of nodes connected by edges, in which each node may also contain a subnode.


CAP

CAP (countable and uncountable, plural CAPs)

(computing theory) Initialism of consistency, availability, partition-tolerance, three irreconcilable guarantees in distributed systems, a result known as Brewer's theorem.


P

(computing theory) The set of all problems that are solvable in polynomial time by a deterministic Turing machine


RE

RE (countable and uncountable, plural REs)

recursively enumerable
recursively enumerable#English

(computing theory, computational complexity theory) Abbreviation of recursively enumerable; the class of decision problems for which a 'yes' answer can be verified by a Turing machine in a finite amount of time.


STM

STM (countable and uncountable, plural STMs)

software transactional memory
w:software transactional memory

(computing theory) Initialism of software transactional memory.


buddy system

buddy memory allocation
buddy memory allocation

(computing theory) The use of buddy memory allocation.


trellis

From Middle English trelis, from Anglo-Norman treslis, from Old French treille (“arbor”), from Latin trichila (“arbor", "summer house”). However, see OED which claims another Old French form referring to sackcloth, from Vulgar Latin.

der

communication theory
communication theory

(computing theory, telecommunications) A kind of graph, used in communication theory and encryption, whose nodes are ordered into vertical slices by time, with each node at each time connected to at least one node at an earlier and at least one node at a later time.


collisionless

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-collisionless.wav

A token ring network is collisionless, but an Ethernet network is not.

(computing theory) Without the possibility of data packets colliding on the network.

a collisionless hash

(computing theory) Without the possibility of items having the same value, which would prevent reliable lookup.


In the modern sense as the equal sign, first attested in The Whetstone of Witte (1557) by Welsh mathematician Robert Recorde, in which the two parallel lines expressed equality, because, as Recorde wrote, "bicauſe noe .2. thynges, can be moare equalle" ("because no two things can be more equal").

abbr

The whetstone of witte, whiche is the seconde parte of Arithmetike: containyng thextraction of Rootes: The Coßike practise, with the rule of Equation: and the woorkes of Surde Nombers

(depending on context)

The statement f(x)=O(log²x) means that as x gets arbitrarily large, f(x) will never grow faster than some constant multiple of log²x.

(mathematics) The equal sign. It asserts that two quantities or expressions have the same value.

(mathematics, computing theory, abuse of notation, with big O notation) Is. Used to state the relation that the growth rate of the expression on the left side of the sign is bounded or limited by that of the expression on the right.


busy beaver

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-busy beaver.wav

(computing theory) A Turing machine that attains the maximum number of steps performed, or number of non-blank symbols finally on the tape, among all Turing machines in a certain class.


träd

träd (indefinite nominative singular)
träds (genitive indefinite singular)
trädet (definite nominative singular)
trädets (definite genitive singular)
träd (indefinite nominative plural)
träds (genitive indefinite plural)
träden (definite nominative plural)
trädens (definite genitive plural)

From Old Swedish trǣet, trǣt, later trǣdh, originally the definite form of trǣ (“tree, wood”), from Old Norse tré, from Proto-Germanic *trewą (“tree, wood”), from pre-Germanic *dréwom, thematic e-grade derivative of Proto-Indo-European *dóru (“tree”). Doublet of trä. The form trædh, trädh was used still as the definite form in Old Swedish and in the Gustav Vasa Bible (1541), but by the early 18th century, it had split into the indefinite form meaning ”tree”, separate from trä (“wood”). Hence, the modern definite form is trädet, with the definite ending -et on top of the now fossilized remnant of definite form -d.


liść

listek (diminutive)
liść (nominative singular)
liście (nominative plural)
liścia (genitive singular)
liści (genitive plural)
liściowi (dative singular)
liściom (dative plural)
liść (accusative singular)
liście (accusative plural)
liściem (instrumental singular)
liśćmi (instrumental plural)
liściu (locative singular)
liściach (locative plural)
liściu (singular vocative)
liście (plural vocative)

Back-formation from liście, from Proto-Slavic *listьje (“foliage”), from *listъ (“leaf”), whence list (“letter”).


regular expression

en-noun

regular expression (plural regular expressions)

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

(computing theory) A concise description of a regular formal language with notations for concatenation, alternation, and iteration (repetition) of subexpressions.

正則表達式 /正则表达式

computing: a concise description of a pattern to be matched


HM

Hindley-Milner
Hindley-Milner type system#English

(computing theory) Initialism of Hindley-Milner.


synchronizer

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-synchronizer.wav

(computing theory) An algorithm that can be applied to a synchronous distributed algorithm to produce a version that operates in asynchronous networks.


probabilistically checkable proof

probabilistically checkable proof (plural probabilistically checkable proofs)

probabilistically checkable proofs (plural)
PCP (abbreviation)

randomized algorithm
randomized algorithm

(computing theory) A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm.


subnormal

en-adj

subnormal (comparative more subnormal, superlative most subnormal)

more subnormal (comparative)
most subnormal (superlative)

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

Subnormal numbers cannot be normalized because this would result in an exponent that does not fit into the exponent field.

2007, Ward Cheney, David Kincaid, Numerical mathematics and computing, page 704:


pseudostate

pseudostates (plural)
pseudo-state (alternative)

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

Every exit pseudostate that does not have an incoming transition becomes a priority relevant exit pseudostate, the other exit pseudostates become non-priority relevant exit pseudostates.

2007, Lubos Brim, Boudewijn Haverkort, Martin Leucker, Formal Methods: Applications and Technology: 11th International Workshop, page 256:

(computing theory) An entity that resembles, but is not in fact, a state in a state machine or similar.


undecidable

The first-order procedure SP differs from the proposi-
 tional procedure CP°₁ in an essential feature. Namely, CP°₁
 always terminates while SP may run forever as we have seen with
 the example immediately after (3.7). This is not a specific
 defect of SP. Rather it is known that first-order logic is an
 undecidable theory while propositional logic is a decidable
 theory. This means that for the latter there are decision pro-
 cedures which for any formula decide whether it is valid or
 not — and CP°₁ in fact is such a decision procedure — while
 for the former such decision procedures do not exist in princi-
 ple. Thus SP, according to these results for which the reader
 is referred to any logic texts such as [End], [DrG] or [Lew],
 is of the kind which we may expect, it is a semi-decision
 procedure which confirms if a formula is valid but may run
 forever for invalid formulas. Therefore, termination by running
 out of time or space after any finite number of steps will
 leave the question for the validity of a formula unsettled. [...]

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

(mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included.

nerozhodnutelný

incapable of being algorithmically decided


recursively enumerable

(computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others.

rekurzivně spočetný

computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others


cellular automaton

en-noun

cellular automaton (plural cellular automata or cellular automatons)

cellular automata (plural)
cellular automatons (plural)

Or maybe just taking some precautions when setting up the division scheme for a particular cellular automaton might be good enough in other cases, depending on how dynamic and non-homogeneous the behavior over the grid will be.

1989 March 21, Dave Hiebeler, “Fast LIFE (was: Re: summing 9-cell neighborhoods)”, in comp.theory.cell-automata (Usenet):

For fixed n this is, of course, a cellular automaton. You can allow any positive integer states for each of the n cells. The transition rule is such that if a cell has state x >=2 then the state never exceeds x and if it has state x < 2 then it either stays the same or increase by 1 or 2.

2003 October 8, Edwin Clark, “a puzzle related to artinian group”, in comp.theory.cell-automata (Usenet):

The paper concludes:
The Busy Boxes variant of the SALT family of reversible cellular automata has shown itself to possess an intriguing number of features that are worthy of further study and analysis. Physicist Gerard T'Hooft has written about the possibility that reversible CA's such as this one may help elucidate some aspects of physics in the quantum realm [5]. We believe that the study of emergent, qualitative, and statistically predictable behavior of these kinds of discrete, deterministic systems can indeed shed light on questions in physics, and may also help to clarify the deeper principles of entropy and the origin of complex, self-propagating systems such as those found in our biosphere

2012 July 3, Mike James, “A New Computational Universe - Fredkin's SALT CA”, in www.i-programmer.info, retrieved 2012-10-25:

Hello, I have recently constructed a cellular automaton in Golly, with a starting population of roughly 899 million, that produces Shierpinski's triangles.

2013 June 19, Aaron Ball, “Sierpinski's triangles generated from cellular automaton in Golly”, in comp.theory.cell-automata (Usenet):

(computing theory) An automaton consisting of cells arranged in a regular grid, in one or more dimensions. Each application of an associated rule creates a new generation, where the cells have a new configuration of values.


unlimited register machine

unlimited register machine (plural unlimited register machines)

(computing theory) A particular type of theoretical computer, with infinitely many memory cells, called registers, and formal rules to determine the machine's behavior based on their contents.


pushdown automaton

pushdown automaton (plural pushdown automata or pushdown automatons)

pushdown automata (plural)
pushdown automatons (plural)

(computing theory) An automaton with finitely many states that can also use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA.


formal language

formal language (plural formal languages)

Meronyms: alphabet, symbol, word

(computing theory) A set of finite strings (called words) made of symbols (from a finite set of symbols, called an alphabet).


context-free grammar

context-free grammar (plural context-free grammars)

It remains to explain one final concept, namely what a context free language is. (Don’t get confused: we’ve told you what a context free grammar is, but not what a context free language is.) Quite simply, a context free language is a language that can be generated by a context free grammar. Some languages are context free, and some are not. For example, it seems plausible that English is a context free language. That is, it is probably possible to write a context free grammar that generates all (and only) the sentences that native speakers find acceptable. On the other hand, some dialects of Swiss-German are not context free. It can be proved mathematically that no context free grammar can generate all (and only) the sentences that native speakers of Swiss-German find acceptable.¹ So if you wanted to write a grammar for such dialects, you would have to employ additional grammatical mechanisms, not merely context free rules.

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

(computing theory) A formal grammar in which every production rule is such that the left-hand side is exactly one non-terminal symbol and the right-hand side is zero or more terminal symbols and/or nonterminal symbols.


monotype

monotype (countable and uncountable, plural monotypes)

General American, Canada, biological sense

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-monotype.wav

From mono- + type or mono- + -type. The printing technique is so called because it allows only one impression to be taken.

(computing theory) In the Hindley–Milner type system, a single specific data type.


queuing

queuing (countable and uncountable, plural queuings)

queuings (plural)
queueing (alternative)

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-queuing.wav

(chiefly computing theory) The act of placing something in a queue.


tiling

tiling (countable and uncountable, plural tilings)

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

(computing theory) A technique for optimizing loops by partitioning the iteration space into smaller chunks or blocks that will more easily fit in a cache.


preorder

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-preorder.wav

Now, the preorder traversal of a tree can be constructed from the preorder traversals of the subtrees rooted at the children of the root of the tree.

2002, Gabriel Valiente, Algorithms on Trees and Graphs, Springer, page 115:

In the program given above, tree is constructed and is traversed in inorder, preorder and postorder traversal.

2006, ISRD Group, Data Structures Using C, Tata McGraw-Hill Education, page 254:

2011, Ananda Rao Akepogu, Radhika Raju Palagiri, Data Structures and Algorithms Using C++, Pearson Education India, page 9.16,
The preorder traversal visits a node first after which it traverses its left subtree and then traverses its right subtree.

(computing theory, of a traversal of a tree) Such that, recursively, the root is visited before the left and right subtrees.


Turingův stroj

Turingův stroj (nominative singular)
Turingovy stroje (nominative plural)
Turingova stroje (genitive singular)
Turingových strojů (genitive plural)
Turingovu stroji (dative singular)
Turingovým strojům (dative plural)
Turingův stroj (accusative singular)
Turingovy stroje (accusative plural)
Turingův stroji (singular vocative)
Turingovy stroje (plural vocative)
Turingově stroji (locative singular)
Turingovu stroji (locative singular)
Turingových strojích (locative plural)
Turingovým strojem (instrumental singular)
Turingovými stroji (instrumental plural)


keko

keko (nominative singular)
keot (nominative plural)
keko (accusative nominative singular)
keot (accusative nominative plural)
keon (accusative genitive singular)
keot (accusative genitive plural)
keon (genitive singular)
kekojen (genitive plural)
kekoa (partitive singular)
kekoja (partitive plural)
keossa (inessive singular)
keoissa (inessive plural)
keosta (elative singular)
keoista (elative plural)
kekoon (illative singular)
kekoihin (illative plural)
keolla (adessive singular)
keoilla (adessive plural)
keolta (ablative singular)
keoilta (ablative plural)
keolle (allative singular)
keoille (allative plural)
kekona (essive singular)
kekoina (essive plural)
keoksi (singular translative)
keoiksi (plural translative)
keotta (abessive singular)
keoitta (abessive plural)
keoin (instructive plural)
See the possessive forms below. (comitative)
kekoni (nominative singular)
kekoni (nominative plural)
kekoni (accusative nominative singular)
kekoni (accusative nominative plural)
kekoni (accusative genitive singular)
kekoni (accusative genitive plural)
kekoni (genitive singular)
kekojeni (genitive plural)
kekoani (partitive singular)
kekojani (partitive plural)
keossani (inessive singular)
keoissani (inessive plural)
keostani (elative singular)
keoistani (elative plural)
kekooni (illative singular)
kekoihini (illative plural)
keollani (adessive singular)
keoillani (adessive plural)
keoltani (ablative singular)
keoiltani (ablative plural)
keolleni (allative singular)
keoilleni (allative plural)
kekonani (essive singular)
kekoinani (essive plural)
keokseni (singular translative)
keoikseni (plural translative)
keottani (abessive singular)
keoittani (abessive plural)
kekoineni (comitative plural)
kekosi (nominative singular)
kekosi (nominative plural)
kekosi (accusative nominative singular)
kekosi (accusative nominative plural)
kekosi (accusative genitive singular)
kekosi (accusative genitive plural)
kekosi (genitive singular)
kekojesi (genitive plural)
kekoasi (partitive singular)
kekojasi (partitive plural)
keossasi (inessive singular)
keoissasi (inessive plural)
keostasi (elative singular)
keoistasi (elative plural)
kekoosi (illative singular)
kekoihisi (illative plural)
keollasi (adessive singular)
keoillasi (adessive plural)
keoltasi (ablative singular)
keoiltasi (ablative plural)
keollesi (allative singular)
keoillesi (allative plural)
kekonasi (essive singular)
kekoinasi (essive plural)
keoksesi (singular translative)
keoiksesi (plural translative)
keottasi (abessive singular)
keoittasi (abessive plural)
kekoinesi (comitative plural)
kekomme (nominative singular)
kekomme (nominative plural)
kekomme (accusative nominative singular)
kekomme (accusative nominative plural)
kekomme (accusative genitive singular)
kekomme (accusative genitive plural)
kekomme (genitive singular)
kekojemme (genitive plural)
kekoamme (partitive singular)
kekojamme (partitive plural)
keossamme (inessive singular)
keoissamme (inessive plural)
keostamme (elative singular)
keoistamme (elative plural)
kekoomme (illative singular)
kekoihimme (illative plural)
keollamme (adessive singular)
keoillamme (adessive plural)
keoltamme (ablative singular)
keoiltamme (ablative plural)
keollemme (allative singular)
keoillemme (allative plural)
kekonamme (essive singular)
kekoinamme (essive plural)
keoksemme (singular translative)
keoiksemme (plural translative)
keottamme (abessive singular)
keoittamme (abessive plural)
kekoinemme (comitative plural)
kekonne (nominative singular)
kekonne (nominative plural)
kekonne (accusative nominative singular)
kekonne (accusative nominative plural)
kekonne (accusative genitive singular)
kekonne (accusative genitive plural)
kekonne (genitive singular)
kekojenne (genitive plural)
kekoanne (partitive singular)
kekojanne (partitive plural)
keossanne (inessive singular)
keoissanne (inessive plural)
keostanne (elative singular)
keoistanne (elative plural)
kekoonne (illative singular)
kekoihinne (illative plural)
keollanne (adessive singular)
keoillanne (adessive plural)
keoltanne (ablative singular)
keoiltanne (ablative plural)
keollenne (allative singular)
keoillenne (allative plural)
kekonanne (essive singular)
kekoinanne (essive plural)
keoksenne (singular translative)
keoiksenne (plural translative)
keottanne (abessive singular)
keoittanne (abessive plural)
kekoinenne (comitative plural)
kekonsa (nominative singular)
kekonsa (nominative plural)
kekonsa (accusative nominative singular)
kekonsa (accusative nominative plural)
kekonsa (accusative genitive singular)
kekonsa (accusative genitive plural)
kekonsa (genitive singular)
kekojensa (genitive plural)
kekoaan (partitive singular)
kekoansa (partitive singular)
kekojaan (partitive plural)
kekojansa (partitive plural)
keossaan (inessive singular)
keossansa (inessive singular)
keoissaan (inessive plural)
keoissansa (inessive plural)
keostaan (elative singular)
keostansa (elative singular)
keoistaan (elative plural)
keoistansa (elative plural)
kekoonsa (illative singular)
kekoihinsa (illative plural)
keollaan (adessive singular)
keollansa (adessive singular)
keoillaan (adessive plural)
keoillansa (adessive plural)
keoltaan (ablative singular)
keoltansa (ablative singular)
keoiltaan (ablative plural)
keoiltansa (ablative plural)
keolleen (allative singular)
keollensa (allative singular)
keoilleen (allative plural)
keoillensa (allative plural)
kekonaan (essive singular)
kekonansa (essive singular)
kekoinaan (essive plural)
kekoinansa (essive plural)
keokseen (singular translative)
keoksensa (singular translative)
keoikseen (plural translative)
keoiksensa (plural translative)
keottaan (abessive singular)
keottansa (abessive singular)
keoittaan (abessive plural)
keoittansa (abessive plural)
kekoineen (comitative plural)
kekoinensa (comitative plural)

From Proto-Finnic *këko. Related to Karelian keko, Ludian keko and Veps kego.

(computing theory) heap (data structure)


Kolmogorovova složitost

Kolmogorovova složitost (nominative singular)
Kolmogorovovy složitosti (nominative plural)
Kolmogorovovy složitosti (genitive singular)
Kolmogorovových složitostí (genitive plural)
Kolmogorovově složitosti (dative singular)
Kolmogorovovým složitostem (dative plural)
Kolmogorovovu složitost (accusative singular)
Kolmogorovovy složitosti (accusative plural)
Kolmogorovova složitosti (singular vocative)
Kolmogorovovy složitosti (plural vocative)
Kolmogorovově složitosti (locative singular)
Kolmogorovových složitostech (locative plural)
Kolmogorovovou složitostí (instrumental singular)
Kolmogorovovými složitostmi (instrumental plural)

Kolmogorov complexity
Kolmogorov complexity

(computing theory) Kolmogorov complexity


non-terminal

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-non-terminal.wav

(computing theory) A non-terminal symbol in a formal grammar.


non-terminal symbol

non-terminal symbol (plural non-terminal symbols)

(computing theory) A symbol in a formal grammar that cannot appear in sentences of the grammar but may eventually be resolved into a sequence of terminal symbols.


terminal symbol

terminal symbol (plural terminal symbols)

(computing theory) A symbol in a formal grammar that can appear in sentences of the grammar.


NP-complete

Informally, a problem is in the class NPC—and we refer to it as being NP-complete—if it is in NP and is as "hard" as any problem in NP. We shall formally define what it means to be as hard as any problem in NP later in this chapter. In the meantime, we will state without proof that if any NP-complete problem can be solved in polynomial time, then every problem in NP has a polynomial-time algorithm. Most theoretical computer scientists believe that the NP-complete problems are intractable, since given the wide range of NP-complete problems that have been studied to date—without anyone having discovered a polynomial-time solution to any of them—it would be truly astounding if all of them could be solved in polynomial time. Yet, given the effort devoted thus far to proving NP-complete problems intractable—without a conclusive outcome—we cannot rule out the possibility that the NP-complete problems are in fact solvable in polynomial time.

2001, Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein, Introduction To Algorithms, 2nd edition, The MIT Press, page 968:

Every area of math seems to have its own NP complete problems. For example, the question of whether or not a graph contains a Hamiltonian circuit is a quintessential NP complete problem and, since it can be explained with little higher level math, is a popular choice in expository works.

2002, Thomas A. Garrity, All the Mathematics You Missed: But Need to Know for Graduate School, Cambridge University Press, page 317:

A problem Π is said to be NP-complete if each problem in NP is reducible to Π. Hence
(4.13) if some NP-complete problem belongs to P, then P=NP.

2003, A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Volume A, Springer, page 43:

(computing theory, of a decision problem) That is both NP (solvable in polynomial time by a non-deterministic Turing machine) and NP-hard (such that any (other) NP problem can be reduced to it in polynomial time).


alpha-beta pruning

(computing theory) An algorithm for pruning a search tree by eliminating any branch that is demonstrably inferior to a branch previously encountered.

alfa–beeta-karsinta

algorithm for pruning a search tree by eliminating inferior branches


search tree

The red-black tree is a balanced binary search tree that has quite fast insert and delete operations and is always sorted.

(computing theory) A tree (data structure) set up to facilitate searching.


Kolmogorov complexity

Kolmogorov complexity (countable and uncountable, plural Kolmogorov complexities)

(computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object as output.

Kolmogorovova složitost

complexity defined as the length of the shortest program


parameterless

/pəˈɹæmətɚləs/

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-parameterless.wav

(computing theory) Taking no parameters; having zero arity.


inorder

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-inorder.wav

(computing theory) Of a tree traversal, recursively visiting the root in between the left and right subtrees.


postorder

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-postorder.wav

(computing theory) Of a tree traversal, recursively visiting the left and right subtrees before the root.


in-order

(computing theory) Alternative spelling of inorder.


post-order

(computing theory) Alternative spelling of postorder.


co-recursively enumerable

en-adj

co-recursively enumerable (not comparable)

corecursively enumerable (alternative)
co-r.e. (alternative)

Any recursively enumerable set which is also co-recursively enumerable is a decidable set.

(computing theory) Describing a set for which there exists a deterministic algorithm that will list all items not in that set.


r.e.

(computing theory) Abbreviation of recursively enumerable.


semi-decidable

(computing theory) Of a set, such that there is a deterministic algorithm such that (a) if an element is a member of the set, the algorithm halts with the result "positive", and (b) if an element is not a member of the set, (i) the algorithm does not halt, or (ii) if it does, then with the result "negative".


edit distance

We introduce an exact formula for the maximum number of common supersequences shared by sequences at a certain edit distance, yielding an upper bound on the number of distinct traces necessary to guarantee exact reconstruction.

2016, Frederic Sala, Ryan Gabrys, Clayton Schoeny, Lara Dolecek, “Exact Reconstruction from Insertions in Synchronization Codes”, in arXiv:

(computing theory) Synonym of string distance.


midrise

mid-rise (alternative)
mid rise (alternative)

midrise quantization

(computing theory, data compression) Having a zero-valued classification threshold (analogous to a riser of a stairway).


polytype

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-polytype.wav

(computing theory) In the Hindley–Milner type system, a data type containing variables bound by one or more ∀ (for-all) quantifiers.


rekurzivně spočetný

rekurzivně spočetný (masculine nominative singular)
rekurzivně spočetná (feminine nominative singular)
rekurzivně spočetné (neuter nominative singular)
rekurzivně spočetného (genitive masculine singular)
rekurzivně spočetné (feminine genitive singular)
rekurzivně spočetného (genitive neuter singular)
rekurzivně spočetnému (dative masculine singular)
rekurzivně spočetné (dative feminine singular)
rekurzivně spočetnému (dative neuter singular)
rekurzivně spočetného (accusative animate masculine singular)
rekurzivně spočetný (accusative inanimate masculine singular)
rekurzivně spočetnou (accusative feminine singular)
rekurzivně spočetné (accusative neuter singular)
rekurzivně spočetném (locative masculine singular)
rekurzivně spočetné (feminine locative singular)
rekurzivně spočetném (locative neuter singular)
rekurzivně spočetným (instrumental masculine singular)
rekurzivně spočetnou (feminine instrumental singular)
rekurzivně spočetným (instrumental neuter singular)
rekurzivně spočetní (animate masculine nominative plural)
rekurzivně spočetné (feminine nominative)
rekurzivně spočetné (inanimate nominative)
rekurzivně spočetná (neuter nominative plural)
rekurzivně spočetných (genitive plural)
rekurzivně spočetným (dative plural)
rekurzivně spočetné (accusative feminine plural)
rekurzivně spočetná (accusative neuter plural)
rekurzivně spočetných (locative plural)
rekurzivně spočetnými (instrumental plural)

(computing theory) recursively enumerable


star height

From the Kleene star and the idea of nested levels having a "height"; coined in 1963 by Lawrence C Eggan.

(computing theory) A measure of the structural complexity of a regular expression, equal to the maximum nesting depth of stars in the expression.


supertree

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

(computing theory) A tree that contains another tree.


formaali kieli

formaali kieli (nominative singular)
formaalit kielet (nominative plural)
formaali kieli (accusative nominative singular)
formaalit kielet (accusative nominative plural)
formaalin kielen (accusative genitive singular)
formaalit kielet (accusative genitive plural)
formaalin kielen (genitive singular)
formaalien kielten (genitive plural)
formaalien kielien (genitive plural)
formaaleiden kielten (genitive plural)
formaaleiden kielien (genitive plural)
formaaleitten kielten (genitive plural)
formaaleitten kielien (genitive plural rare)
formaalia kieltä (partitive singular)
formaaleita kieliä (partitive plural)
formaaleja kieliä (partitive plural)
formaalissa kielessä (inessive singular)
formaaleissa kielissä (inessive plural)
formaalista kielestä (elative singular)
formaaleista kielistä (elative plural)
formaaliin kieleen (illative singular)
formaaleihin kieliin (illative plural)
formaalilla kielellä (adessive singular)
formaaleilla kielillä (adessive plural)
formaalilta kieleltä (ablative singular)
formaaleilta kieliltä (ablative plural)
formaalille kielelle (allative singular)
formaaleille kielille (allative plural)
formaalina kielenä (essive singular)
formaaleina kielinä (essive plural)
formaaliksi kieleksi (singular translative)
formaaleiksi kieliksi (plural translative)
formaalitta kielettä (abessive singular)
formaaleitta kielittä (abessive plural)
formaalein kielin (instructive plural)
See the possessive forms below. (comitative)
formaali kieleni (nominative singular)
formaalit kieleni (nominative plural)
formaali kieleni (accusative nominative singular)
formaalit kieleni (accusative nominative plural)
formaalin kieleni (accusative genitive singular)
formaalit kieleni (accusative genitive plural)
formaalin kieleni (genitive singular)
formaalien kielteni (genitive plural)
formaalien kielieni (genitive plural)
formaaleiden kielteni (genitive plural)
formaaleiden kielieni (genitive plural)
formaaleitten kielteni (genitive plural rare)
formaaleitten kielieni (genitive plural rare)
formaalia kieltäni (partitive singular)
formaaleita kieliäni (partitive plural)
formaaleja kieliäni (partitive plural)
formaalissa kielessäni (inessive singular)
formaaleissa kielissäni (inessive plural)
formaalista kielestäni (elative singular)
formaaleista kielistäni (elative plural)
formaaliin kieleeni (illative singular)
formaaleihin kieliini (illative plural)
formaalilla kielelläni (adessive singular)
formaaleilla kielilläni (adessive plural)
formaalilta kieleltäni (ablative singular)
formaaleilta kieliltäni (ablative plural)
formaalille kielelleni (allative singular)
formaaleille kielilleni (allative plural)
formaalina kielenäni (essive singular)
formaaleina kielinäni (essive plural)
formaaliksi kielekseni (singular translative)
formaaleiksi kielikseni (plural translative)
formaalitta kielettäni (abessive singular)
formaaleitta kielittäni (abessive plural)
formaaleine kielineni (comitative plural)
formaali kielesi (nominative singular)
formaalit kielesi (nominative plural)
formaali kielesi (accusative nominative singular)
formaalit kielesi (accusative nominative plural)
formaalin kielesi (accusative genitive singular)
formaalit kielesi (accusative genitive plural)
formaalin kielesi (genitive singular)
formaalien kieltesi (genitive plural)
formaalien kieliesi (genitive plural)
formaaleiden kieltesi (genitive plural)
formaaleiden kieliesi (genitive plural)
formaaleitten kieltesi (genitive plural rare)
formaaleitten kieliesi (genitive plural rare)
formaalia kieltäsi (partitive singular)
formaaleita kieliäsi (partitive plural)
formaaleja kieliäsi (partitive plural)
formaalissa kielessäsi (inessive singular)
formaaleissa kielissäsi (inessive plural)
formaalista kielestäsi (elative singular)
formaaleista kielistäsi (elative plural)
formaaliin kieleesi (illative singular)
formaaleihin kieliisi (illative plural)
formaalilla kielelläsi (adessive singular)
formaaleilla kielilläsi (adessive plural)
formaalilta kieleltäsi (ablative singular)
formaaleilta kieliltäsi (ablative plural)
formaalille kielellesi (allative singular)
formaaleille kielillesi (allative plural)
formaalina kielenäsi (essive singular)
formaaleina kielinäsi (essive plural)
formaaliksi kieleksesi (singular translative)
formaaleiksi kieliksesi (plural translative)
formaalitta kielettäsi (abessive singular)
formaaleitta kielittäsi (abessive plural)
formaaleine kielinesi (comitative plural)
formaali kielemme (nominative singular)
formaalit kielemme (nominative plural)
formaali kielemme (accusative nominative singular)
formaalit kielemme (accusative nominative plural)
formaalin kielemme (accusative genitive singular)
formaalit kielemme (accusative genitive plural)
formaalin kielemme (genitive singular)
formaalien kieltemme (genitive plural)
formaalien kieliemme (genitive plural)
formaaleiden kieltemme (genitive plural)
formaaleiden kieliemme (genitive plural)
formaaleitten kieltemme (genitive plural rare)
formaaleitten kieliemme (genitive plural rare)
formaalia kieltämme (partitive singular)
formaaleita kieliämme (partitive plural)
formaaleja kieliämme (partitive plural)
formaalissa kielessämme (inessive singular)
formaaleissa kielissämme (inessive plural)
formaalista kielestämme (elative singular)
formaaleista kielistämme (elative plural)
formaaliin kieleemme (illative singular)
formaaleihin kieliimme (illative plural)
formaalilla kielellämme (adessive singular)
formaaleilla kielillämme (adessive plural)
formaalilta kieleltämme (ablative singular)
formaaleilta kieliltämme (ablative plural)
formaalille kielellemme (allative singular)
formaaleille kielillemme (allative plural)
formaalina kielenämme (essive singular)
formaaleina kielinämme (essive plural)
formaaliksi kieleksemme (singular translative)
formaaleiksi kieliksemme (plural translative)
formaalitta kielettämme (abessive singular)
formaaleitta kielittämme (abessive plural)
formaaleine kielinemme (comitative plural)
formaali kielenne (nominative singular)
formaalit kielenne (nominative plural)
formaali kielenne (accusative nominative singular)
formaalit kielenne (accusative nominative plural)
formaalin kielenne (accusative genitive singular)
formaalit kielenne (accusative genitive plural)
formaalin kielenne (genitive singular)
formaalien kieltenne (genitive plural)
formaalien kielienne (genitive plural)
formaaleiden kieltenne (genitive plural)
formaaleiden kielienne (genitive plural)
formaaleitten kieltenne (genitive plural rare)
formaaleitten kielienne (genitive plural rare)
formaalia kieltänne (partitive singular)
formaaleita kieliänne (partitive plural)
formaaleja kieliänne (partitive plural)
formaalissa kielessänne (inessive singular)
formaaleissa kielissänne (inessive plural)
formaalista kielestänne (elative singular)
formaaleista kielistänne (elative plural)
formaaliin kieleenne (illative singular)
formaaleihin kieliinne (illative plural)
formaalilla kielellänne (adessive singular)
formaaleilla kielillänne (adessive plural)
formaalilta kieleltänne (ablative singular)
formaaleilta kieliltänne (ablative plural)
formaalille kielellenne (allative singular)
formaaleille kielillenne (allative plural)
formaalina kielenänne (essive singular)
formaaleina kielinänne (essive plural)
formaaliksi kieleksenne (singular translative)
formaaleiksi kieliksenne (plural translative)
formaalitta kielettänne (abessive singular)
formaaleitta kielittänne (abessive plural)
formaaleine kielinenne (comitative plural)
formaali kielensä (nominative singular)
formaalit kielensä (nominative plural)
formaali kielensä (accusative nominative singular)
formaalit kielensä (accusative nominative plural)
formaalin kielensä (accusative genitive singular)
formaalit kielensä (accusative genitive plural)
formaalin kielensä (genitive singular)
formaalien kieltensä (genitive plural)
formaalien kieliensä (genitive plural)
formaaleiden kieltensä (genitive plural)
formaaleiden kieliensä (genitive plural)
formaaleitten kieltensä (genitive plural rare)
formaaleitten kieliensä (genitive plural rare)
formaalia kieltään (partitive singular)
formaalia kieltänsä (partitive singular)
formaaleita kieliään (partitive plural)
formaaleita kieliänsä (partitive plural)
formaaleja kieliään (partitive plural)
formaaleja kieliänsä (partitive plural)
formaalissa kielessään (inessive singular)
formaalissa kielessänsä (inessive singular)
formaaleissa kielissään (inessive plural)
formaaleissa kielissänsä (inessive plural)
formaalista kielestään (elative singular)
formaalista kielestänsä (elative singular)
formaaleista kielistään (elative plural)
formaaleista kielistänsä (elative plural)
formaaliin kieleensä (illative singular)
formaaleihin kieliinsä (illative plural)
formaalilla kielellään (adessive singular)
formaalilla kielellänsä (adessive singular)
formaaleilla kielillään (adessive plural)
formaaleilla kielillänsä (adessive plural)
formaalilta kieleltään (ablative singular)
formaalilta kieleltänsä (ablative singular)
formaaleilta kieliltään (ablative plural)
formaaleilta kieliltänsä (ablative plural)
formaalille kielelleen (allative singular)
formaalille kielellensä (allative singular)
formaaleille kielilleen (allative plural)
formaaleille kielillensä (allative plural)
formaalina kielenään (essive singular)
formaalina kielenänsä (essive singular)
formaaleina kielinään (essive plural)
formaaleina kielinänsä (essive plural)
formaaliksi kielekseen (singular translative)
formaaliksi kieleksensä (singular translative)
formaaleiksi kielikseen (plural translative)
formaaleiksi kieliksensä (plural translative)
formaalitta kielettään (abessive singular)
formaalitta kielettänsä (abessive singular)
formaaleitta kielittään (abessive plural)
formaaleitta kielittänsä (abessive plural)
formaaleine kielineen (comitative plural)
formaaleine kielinensä (comitative plural)


formaali kielioppi

formaali kielioppi (nominative singular)
formaalit kieliopit (nominative plural)
formaali kielioppi (accusative nominative singular)
formaalit kieliopit (accusative nominative plural)
formaalin kieliopin (accusative genitive singular)
formaalit kieliopit (accusative genitive plural)
formaalin kieliopin (genitive singular)
formaalien kielioppien (genitive plural)
formaaleiden kielioppien (genitive plural)
formaaleitten kielioppien (genitive plural rare)
formaalia kielioppia (partitive singular)
formaaleita kielioppeja (partitive plural)
formaaleja kielioppeja (partitive plural)
formaalissa kieliopissa (inessive singular)
formaaleissa kieliopeissa (inessive plural)
formaalista kieliopista (elative singular)
formaaleista kieliopeista (elative plural)
formaaliin kielioppiin (illative singular)
formaaleihin kielioppeihin (illative plural)
formaalilla kieliopilla (adessive singular)
formaaleilla kieliopeilla (adessive plural)
formaalilta kieliopilta (ablative singular)
formaaleilta kieliopeilta (ablative plural)
formaalille kieliopille (allative singular)
formaaleille kieliopeille (allative plural)
formaalina kielioppina (essive singular)
formaaleina kielioppeina (essive plural)
formaaliksi kieliopiksi (singular translative)
formaaleiksi kieliopeiksi (plural translative)
formaalitta kieliopitta (abessive singular)
formaaleitta kieliopeitta (abessive plural)
formaalein kieliopein (instructive plural)
See the possessive forms below. (comitative)
formaali kielioppini (nominative singular)
formaalit kielioppini (nominative plural)
formaali kielioppini (accusative nominative singular)
formaalit kielioppini (accusative nominative plural)
formaalin kielioppini (accusative genitive singular)
formaalit kielioppini (accusative genitive plural)
formaalin kielioppini (genitive singular)
formaalien kielioppieni (genitive plural)
formaaleiden kielioppieni (genitive plural)
formaaleitten kielioppieni (genitive plural rare)
formaalia kielioppiani (partitive singular)
formaaleita kielioppejani (partitive plural)
formaaleja kielioppejani (partitive plural)
formaalissa kieliopissani (inessive singular)
formaaleissa kieliopeissani (inessive plural)
formaalista kieliopistani (elative singular)
formaaleista kieliopeistani (elative plural)
formaaliin kielioppiini (illative singular)
formaaleihin kielioppeihini (illative plural)
formaalilla kieliopillani (adessive singular)
formaaleilla kieliopeillani (adessive plural)
formaalilta kieliopiltani (ablative singular)
formaaleilta kieliopeiltani (ablative plural)
formaalille kieliopilleni (allative singular)
formaaleille kieliopeilleni (allative plural)
formaalina kielioppinani (essive singular)
formaaleina kielioppeinani (essive plural)
formaaliksi kieliopikseni (singular translative)
formaaleiksi kieliopeikseni (plural translative)
formaalitta kieliopittani (abessive singular)
formaaleitta kieliopeittani (abessive plural)
formaaleine kielioppeineni (comitative plural)
formaali kielioppisi (nominative singular)
formaalit kielioppisi (nominative plural)
formaali kielioppisi (accusative nominative singular)
formaalit kielioppisi (accusative nominative plural)
formaalin kielioppisi (accusative genitive singular)
formaalit kielioppisi (accusative genitive plural)
formaalin kielioppisi (genitive singular)
formaalien kielioppiesi (genitive plural)
formaaleiden kielioppiesi (genitive plural)
formaaleitten kielioppiesi (genitive plural rare)
formaalia kielioppiasi (partitive singular)
formaaleita kielioppejasi (partitive plural)
formaaleja kielioppejasi (partitive plural)
formaalissa kieliopissasi (inessive singular)
formaaleissa kieliopeissasi (inessive plural)
formaalista kieliopistasi (elative singular)
formaaleista kieliopeistasi (elative plural)
formaaliin kielioppiisi (illative singular)
formaaleihin kielioppeihisi (illative plural)
formaalilla kieliopillasi (adessive singular)
formaaleilla kieliopeillasi (adessive plural)
formaalilta kieliopiltasi (ablative singular)
formaaleilta kieliopeiltasi (ablative plural)
formaalille kieliopillesi (allative singular)
formaaleille kieliopeillesi (allative plural)
formaalina kielioppinasi (essive singular)
formaaleina kielioppeinasi (essive plural)
formaaliksi kieliopiksesi (singular translative)
formaaleiksi kieliopeiksesi (plural translative)
formaalitta kieliopittasi (abessive singular)
formaaleitta kieliopeittasi (abessive plural)
formaaleine kielioppeinesi (comitative plural)
formaali kielioppimme (nominative singular)
formaalit kielioppimme (nominative plural)
formaali kielioppimme (accusative nominative singular)
formaalit kielioppimme (accusative nominative plural)
formaalin kielioppimme (accusative genitive singular)
formaalit kielioppimme (accusative genitive plural)
formaalin kielioppimme (genitive singular)
formaalien kielioppiemme (genitive plural)
formaaleiden kielioppiemme (genitive plural)
formaaleitten kielioppiemme (genitive plural rare)
formaalia kielioppiamme (partitive singular)
formaaleita kielioppejamme (partitive plural)
formaaleja kielioppejamme (partitive plural)
formaalissa kieliopissamme (inessive singular)
formaaleissa kieliopeissamme (inessive plural)
formaalista kieliopistamme (elative singular)
formaaleista kieliopeistamme (elative plural)
formaaliin kielioppiimme (illative singular)
formaaleihin kielioppeihimme (illative plural)
formaalilla kieliopillamme (adessive singular)
formaaleilla kieliopeillamme (adessive plural)
formaalilta kieliopiltamme (ablative singular)
formaaleilta kieliopeiltamme (ablative plural)
formaalille kieliopillemme (allative singular)
formaaleille kieliopeillemme (allative plural)
formaalina kielioppinamme (essive singular)
formaaleina kielioppeinamme (essive plural)
formaaliksi kieliopiksemme (singular translative)
formaaleiksi kieliopeiksemme (plural translative)
formaalitta kieliopittamme (abessive singular)
formaaleitta kieliopeittamme (abessive plural)
formaaleine kielioppeinemme (comitative plural)
formaali kielioppinne (nominative singular)
formaalit kielioppinne (nominative plural)
formaali kielioppinne (accusative nominative singular)
formaalit kielioppinne (accusative nominative plural)
formaalin kielioppinne (accusative genitive singular)
formaalit kielioppinne (accusative genitive plural)
formaalin kielioppinne (genitive singular)
formaalien kielioppienne (genitive plural)
formaaleiden kielioppienne (genitive plural)
formaaleitten kielioppienne (genitive plural rare)
formaalia kielioppianne (partitive singular)
formaaleita kielioppejanne (partitive plural)
formaaleja kielioppejanne (partitive plural)
formaalissa kieliopissanne (inessive singular)
formaaleissa kieliopeissanne (inessive plural)
formaalista kieliopistanne (elative singular)
formaaleista kieliopeistanne (elative plural)
formaaliin kielioppiinne (illative singular)
formaaleihin kielioppeihinne (illative plural)
formaalilla kieliopillanne (adessive singular)
formaaleilla kieliopeillanne (adessive plural)
formaalilta kieliopiltanne (ablative singular)
formaaleilta kieliopeiltanne (ablative plural)
formaalille kieliopillenne (allative singular)
formaaleille kieliopeillenne (allative plural)
formaalina kielioppinanne (essive singular)
formaaleina kielioppeinanne (essive plural)
formaaliksi kieliopiksenne (singular translative)
formaaleiksi kieliopeiksenne (plural translative)
formaalitta kieliopittanne (abessive singular)
formaaleitta kieliopeittanne (abessive plural)
formaaleine kielioppeinenne (comitative plural)
formaali kielioppinsa (nominative singular)
formaalit kielioppinsa (nominative plural)
formaali kielioppinsa (accusative nominative singular)
formaalit kielioppinsa (accusative nominative plural)
formaalin kielioppinsa (accusative genitive singular)
formaalit kielioppinsa (accusative genitive plural)
formaalin kielioppinsa (genitive singular)
formaalien kielioppiensa (genitive plural)
formaaleiden kielioppiensa (genitive plural)
formaaleitten kielioppiensa (genitive plural rare)
formaalia kielioppiaan (partitive singular)
formaalia kielioppiansa (partitive singular)
formaaleita kielioppejaan (partitive plural)
formaaleita kielioppejansa (partitive plural)
formaaleja kielioppejaan (partitive plural)
formaaleja kielioppejansa (partitive plural)
formaalissa kieliopissaan (inessive singular)
formaalissa kieliopissansa (inessive singular)
formaaleissa kieliopeissaan (inessive plural)
formaaleissa kieliopeissansa (inessive plural)
formaalista kieliopistaan (elative singular)
formaalista kieliopistansa (elative singular)
formaaleista kieliopeistaan (elative plural)
formaaleista kieliopeistansa (elative plural)
formaaliin kielioppiinsa (illative singular)
formaaleihin kielioppeihinsa (illative plural)
formaalilla kieliopillaan (adessive singular)
formaalilla kieliopillansa (adessive singular)
formaaleilla kieliopeillaan (adessive plural)
formaaleilla kieliopeillansa (adessive plural)
formaalilta kieliopiltaan (ablative singular)
formaalilta kieliopiltansa (ablative singular)
formaaleilta kieliopeiltaan (ablative plural)
formaaleilta kieliopeiltansa (ablative plural)
formaalille kieliopilleen (allative singular)
formaalille kieliopillensa (allative singular)
formaaleille kieliopeilleen (allative plural)
formaaleille kieliopeillensa (allative plural)
formaalina kielioppinaan (essive singular)
formaalina kielioppinansa (essive singular)
formaaleina kielioppeinaan (essive plural)
formaaleina kielioppeinansa (essive plural)
formaaliksi kieliopikseen (singular translative)
formaaliksi kieliopiksensa (singular translative)
formaaleiksi kieliopeikseen (plural translative)
formaaleiksi kieliopeiksensa (plural translative)
formaalitta kieliopittaan (abessive singular)
formaalitta kieliopittansa (abessive singular)
formaaleitta kieliopeittaan (abessive plural)
formaaleitta kieliopeittansa (abessive plural)
formaaleine kielioppeineen (comitative plural)
formaaleine kielioppeinensa (comitative plural)


soluautomaatti

soluautomaatti (nominative singular)
soluautomaatit (nominative plural)
soluautomaatti (accusative nominative singular)
soluautomaatit (accusative nominative plural)
soluautomaatin (accusative genitive singular)
soluautomaatit (accusative genitive plural)
soluautomaatin (genitive singular)
soluautomaattien (genitive plural)
soluautomaattia (partitive singular)
soluautomaatteja (partitive plural)
soluautomaatissa (inessive singular)
soluautomaateissa (inessive plural)
soluautomaatista (elative singular)
soluautomaateista (elative plural)
soluautomaattiin (illative singular)
soluautomaatteihin (illative plural)
soluautomaatilla (adessive singular)
soluautomaateilla (adessive plural)
soluautomaatilta (ablative singular)
soluautomaateilta (ablative plural)
soluautomaatille (allative singular)
soluautomaateille (allative plural)
soluautomaattina (essive singular)
soluautomaatteina (essive plural)
soluautomaatiksi (singular translative)
soluautomaateiksi (plural translative)
soluautomaatitta (abessive singular)
soluautomaateitta (abessive plural)
soluautomaatein (instructive plural)
See the possessive forms below. (comitative)
soluautomaattini (nominative singular)
soluautomaattini (nominative plural)
soluautomaattini (accusative nominative singular)
soluautomaattini (accusative nominative plural)
soluautomaattini (accusative genitive singular)
soluautomaattini (accusative genitive plural)
soluautomaattini (genitive singular)
soluautomaattieni (genitive plural)
soluautomaattiani (partitive singular)
soluautomaattejani (partitive plural)
soluautomaatissani (inessive singular)
soluautomaateissani (inessive plural)
soluautomaatistani (elative singular)
soluautomaateistani (elative plural)
soluautomaattiini (illative singular)
soluautomaatteihini (illative plural)
soluautomaatillani (adessive singular)
soluautomaateillani (adessive plural)
soluautomaatiltani (ablative singular)
soluautomaateiltani (ablative plural)
soluautomaatilleni (allative singular)
soluautomaateilleni (allative plural)
soluautomaattinani (essive singular)
soluautomaatteinani (essive plural)
soluautomaatikseni (singular translative)
soluautomaateikseni (plural translative)
soluautomaatittani (abessive singular)
soluautomaateittani (abessive plural)
soluautomaatteineni (comitative plural)
soluautomaattisi (nominative singular)
soluautomaattisi (nominative plural)
soluautomaattisi (accusative nominative singular)
soluautomaattisi (accusative nominative plural)
soluautomaattisi (accusative genitive singular)
soluautomaattisi (accusative genitive plural)
soluautomaattisi (genitive singular)
soluautomaattiesi (genitive plural)
soluautomaattiasi (partitive singular)
soluautomaattejasi (partitive plural)
soluautomaatissasi (inessive singular)
soluautomaateissasi (inessive plural)
soluautomaatistasi (elative singular)
soluautomaateistasi (elative plural)
soluautomaattiisi (illative singular)
soluautomaatteihisi (illative plural)
soluautomaatillasi (adessive singular)
soluautomaateillasi (adessive plural)
soluautomaatiltasi (ablative singular)
soluautomaateiltasi (ablative plural)
soluautomaatillesi (allative singular)
soluautomaateillesi (allative plural)
soluautomaattinasi (essive singular)
soluautomaatteinasi (essive plural)
soluautomaatiksesi (singular translative)
soluautomaateiksesi (plural translative)
soluautomaatittasi (abessive singular)
soluautomaateittasi (abessive plural)
soluautomaatteinesi (comitative plural)
soluautomaattimme (nominative singular)
soluautomaattimme (nominative plural)
soluautomaattimme (accusative nominative singular)
soluautomaattimme (accusative nominative plural)
soluautomaattimme (accusative genitive singular)
soluautomaattimme (accusative genitive plural)
soluautomaattimme (genitive singular)
soluautomaattiemme (genitive plural)
soluautomaattiamme (partitive singular)
soluautomaattejamme (partitive plural)
soluautomaatissamme (inessive singular)
soluautomaateissamme (inessive plural)
soluautomaatistamme (elative singular)
soluautomaateistamme (elative plural)
soluautomaattiimme (illative singular)
soluautomaatteihimme (illative plural)
soluautomaatillamme (adessive singular)
soluautomaateillamme (adessive plural)
soluautomaatiltamme (ablative singular)
soluautomaateiltamme (ablative plural)
soluautomaatillemme (allative singular)
soluautomaateillemme (allative plural)
soluautomaattinamme (essive singular)
soluautomaatteinamme (essive plural)
soluautomaatiksemme (singular translative)
soluautomaateiksemme (plural translative)
soluautomaatittamme (abessive singular)
soluautomaateittamme (abessive plural)
soluautomaatteinemme (comitative plural)
soluautomaattinne (nominative singular)
soluautomaattinne (nominative plural)
soluautomaattinne (accusative nominative singular)
soluautomaattinne (accusative nominative plural)
soluautomaattinne (accusative genitive singular)
soluautomaattinne (accusative genitive plural)
soluautomaattinne (genitive singular)
soluautomaattienne (genitive plural)
soluautomaattianne (partitive singular)
soluautomaattejanne (partitive plural)
soluautomaatissanne (inessive singular)
soluautomaateissanne (inessive plural)
soluautomaatistanne (elative singular)
soluautomaateistanne (elative plural)
soluautomaattiinne (illative singular)
soluautomaatteihinne (illative plural)
soluautomaatillanne (adessive singular)
soluautomaateillanne (adessive plural)
soluautomaatiltanne (ablative singular)
soluautomaateiltanne (ablative plural)
soluautomaatillenne (allative singular)
soluautomaateillenne (allative plural)
soluautomaattinanne (essive singular)
soluautomaatteinanne (essive plural)
soluautomaatiksenne (singular translative)
soluautomaateiksenne (plural translative)
soluautomaatittanne (abessive singular)
soluautomaateittanne (abessive plural)
soluautomaatteinenne (comitative plural)
soluautomaattinsa (nominative singular)
soluautomaattinsa (nominative plural)
soluautomaattinsa (accusative nominative singular)
soluautomaattinsa (accusative nominative plural)
soluautomaattinsa (accusative genitive singular)
soluautomaattinsa (accusative genitive plural)
soluautomaattinsa (genitive singular)
soluautomaattiensa (genitive plural)
soluautomaattiaan (partitive singular)
soluautomaattiansa (partitive singular)
soluautomaattejaan (partitive plural)
soluautomaattejansa (partitive plural)
soluautomaatissaan (inessive singular)
soluautomaatissansa (inessive singular)
soluautomaateissaan (inessive plural)
soluautomaateissansa (inessive plural)
soluautomaatistaan (elative singular)
soluautomaatistansa (elative singular)
soluautomaateistaan (elative plural)
soluautomaateistansa (elative plural)
soluautomaattiinsa (illative singular)
soluautomaatteihinsa (illative plural)
soluautomaatillaan (adessive singular)
soluautomaatillansa (adessive singular)
soluautomaateillaan (adessive plural)
soluautomaateillansa (adessive plural)
soluautomaatiltaan (ablative singular)
soluautomaatiltansa (ablative singular)
soluautomaateiltaan (ablative plural)
soluautomaateiltansa (ablative plural)
soluautomaatilleen (allative singular)
soluautomaatillensa (allative singular)
soluautomaateilleen (allative plural)
soluautomaateillensa (allative plural)
soluautomaattinaan (essive singular)
soluautomaattinansa (essive singular)
soluautomaatteinaan (essive plural)
soluautomaatteinansa (essive plural)
soluautomaatikseen (singular translative)
soluautomaatiksensa (singular translative)
soluautomaateikseen (plural translative)
soluautomaateiksensa (plural translative)
soluautomaatittaan (abessive singular)
soluautomaatittansa (abessive singular)
soluautomaateittaan (abessive plural)
soluautomaateittansa (abessive plural)
soluautomaatteineen (comitative plural)
soluautomaatteinensa (comitative plural)

[ˈs̠o̞luˌɑ̝u̯t̪o̞ˌmɑ̝ːt̪ːi]


primitive recursion

en-noun

primitive recursion (countable and uncountable, plural primitive recursions)

(computing theory) Recursion to a fixed depth.

(computing theory) The operator ρ, that creates a new function from two functions g, and h, such that:

The operator ρ, that creates a new function from two functions g, and h, such that:
 ρ(g,h)(0,x_1,…,x_k)=g(x_1,…,x_k)\ρ(g,h)(y+1,x_1,…,x_k)=h(y,ρ(g,h)(y,x_1,…,x_k),x_1,…,x_k),.


subparse

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-subparse.wav

(computing theory) A parse that makes up part of a larger parse.


P-complete

(computing theory) Describing any problem in the complexity class P to which there exists a polynomial time mapping from any other problem in P.

P-täydellinen

describing any problem in P to which there exists a polynomial time mapping from any other problem in P


P-complete

(computing theory) The set of such problems.


subnode

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-subnode.wav

Without subnodes, all instances of a data source type share the configuration parameters.

2008, “Selecting subnode configuration properties”, in publib.boulder.ibm.com:

(computing theory) A node within another node of a network or element in a data structure.


Kleene star

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

(logic, computing theory) The asterisk, *, used as an operator to concatenate zero or more strings from a given set, widely used in regular expressions.


denormalized

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-denormalized.wav

(computing theory, of a number) Denormal.


big O notation

LL-Q1860 (eng)-Flame, not lame-big O notation.wav

From the capital letter O (short for order, originally German Ordnung) used in the notation.

(mathematics, computing theory) A particular notation, useful in the analysis of algorithms, which describes the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions.


grammarless

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-grammarless.wav

A few languages are either virtually grammarless, like Chinese, or have few supplementary morphemes grouped in form-classes, like English or French.

1947, Melville Jacobs, Bernhard Joseph Stern, Outline of anthropology:

2001, F A Grootjen, Relational Indexing Using a Grammarless Parser:

(linguistics, computing theory) Without grammar or a grammar.


liveness

liveness (usually uncountable, plural livenesses)

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-liveness.wav

(computing theory) A set of properties of a concurrent system that require the system to make progress despite the fact that its concurrently executing processes may have to take turns in critical sections.


regulární výraz

regulární výraz (nominative singular)
regulární výrazy (nominative plural)
regulárního výrazu (genitive singular)
regulárních výrazů (genitive plural)
regulárnímu výrazu (dative singular)
regulárním výrazům (dative plural)
regulární výraz (accusative singular)
regulární výrazy (accusative plural)
regulární výraze (singular vocative)
regulární výrazy (plural vocative)
regulárním výraze (locative singular)
regulárním výrazu (locative singular)
regulárních výrazech (locative plural)
regulárním výrazem (instrumental singular)
regulárními výrazy (instrumental plural)


metaspace

metaspace (countable and uncountable, plural metaspaces)

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-metaspace.wav

(computing theory) The conceptual space occupied by metaobjects.


machine de Turing

fr-noun

machine de Turing f (plural machines de Turing)

LL-Q150 (fra)-WikiLucas00-machine de Turing.wav


beta reduction

en-noun

beta reduction (countable and uncountable, plural beta reductions)

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-beta reduction.wav

A natural deduction tree can be put in exact correspondence with typed λ-calculus (that can be considered as just a notation for such deductions), and the cut-elimination in Natural Deduction corresponds exactly to β-reduction in λ-calculus.

1996, Roberto DiCosmo with Vincent Danos, The Linear Logic Primer, Université de Paris VII, retrieved 2016-04-18, page 43:

(computing theory) One of the three rewrite rules of the lambda calculus, which states that the application of a lambda abstraction (λx.t) to a term s yields an expression t[s/x], "t with s instead of x", where all free instances of x in t have been replaced by s.


nonidling

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-nonidling.wav


rematerialization

rematerialization (usually uncountable, plural rematerializations)

rematerializations (plural)
rematerialisation (alternative)

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-rematerialization.wav

(computing theory, uncountable) A compiler optimization that saves time by recomputing a value instead of loading it from memory.


圖靈機

/tʰu³⁵ liŋ³⁵ t͡ɕi⁵⁵/

/tʰou̯²¹ lɪŋ²¹ kei̯⁵⁵/

/tʰu³⁵ liŋ³⁵ t͡ɕi⁵⁵/

/tʰou̯²¹ lɪŋ²¹ kei̯⁵⁵/


nonblocking

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-nonblocking.wav

(computing theory) That does not block; allowing other tasks to proceed immediately rather than having to wait for completion.


denormal

LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-denormal.wav

From de- + normal? or from denormalized?

(computing theory, of a number) Smaller than the smallest normal number but larger than zero, thus serving to fill the underflow gap.


denormal

(computing theory) A number that is denormal.


random access

(computing theory) The ability to access any element of a sequence in real time, without having to seek through preceding elements.

hajasaanti

ability to access any element of a sequence without having to seek


jump list

jump lists (plural)
jumplist (alternative)

(computing theory) A kind of sorted linked list with additional pointers to connect data items that are various distances apart.


Turing jump

computability theory
computability theory

(computing theory) In computability theory, an operation that assigns to each decision problem X a successively harder decision problem X′ with the property that X′ is not decidable by an oracle machine with an oracle for X.