MCTS

en-noun

MCTS (countable and uncountable, plural MCTSs)

The agent then executes an MCTS procedure and uses this to select the next action to take. The generated games are then used to update the network’s parameters, enabling the agent to learn.

2023 June 24, Daniel J. Mankowitz, Andrea Michi, Anton Zhernov, Marco Gelmi, Marco Selvi, “Faster sorting algorithms discovered using deep reinforcement learning”, in Nature, volume 618, number 7964, →DOI, →ISSN, pages 257–263:

Monte Carlo tree search
w:Monte Carlo tree search

(computer science) Initialism of Monte Carlo tree search.


PRAM

Coordinate term: RAM

(computer science) Acronym of parallel random-access machine.


ontology engineering

(computer science) A field which studies the methods and methodologies for building ontologies.


text simplification

text simplification (countable and uncountable, plural text simplifications)

natural language processing
natural language processing

(linguistics, computer science) An operation used in natural language processing to modify, enhance, classify or otherwise process an existing corpus of human-readable text.


Dragon Book

The textbooks were published with a dragon on their cover art.

(computer science, slang) Any one of several textbooks about compiler construction written by Alfred Aho and Jeffrey Ullman, especially Compilers: Principles, Techniques, and Tools (1986).


Green Dragon Book

The textbook was originally published with a green dragon on its cover art.

(computer science, slang) Principles of Compiler Design (1977), a notable textbook about compiler construction written by Alfred Aho and Jeffrey Ullman.


Blue Dragon Book

The textbook was originally published with a blue dragon on its cover art.

(computer science, slang) The first edition of Compilers: Principles, Techniques, and Tools (1986), a notable textbook about compiler construction.


Purple Dragon Book

The textbook was originally published with a purple dragon on its cover art.

(computer science, slang) The second edition of Compilers: Principles, Techniques, and Tools (2006), a notable textbook about compiler construction.


Wizard Book

The textbook was published with an image of a wizard as the cover art.

computer programming
computer programming

(computer science, slang) Structure and Interpretation of Computer Programs (1985), a notable computer science textbook that teaches fundamental principles of computer programming, including recursion, abstraction, modularity, and programming language design and implementation.


Red Dragon Book

The textbook was originally published with a red dragon on its cover art.


type theory

type theory (usually uncountable, plural type theories)

Coordinate term: set theory

Although it is not generally regarded as the foundation for classical mathematics, set theory being more customary, type theory still has numerous applications, especially in computer science and the theory of programming languages.

2013, Homotopy Type Theory: Univalent Foundations of Mathematics, Univalent Foundations, page 2:

(mathematics, computer science) A branch of mathematical logic and theoretical computer science concerned with types.


one-cold

One-cold encoding has the same advantages and disadvantages as one-hot. The difference is that the active bit is logic zero rather than logic one. One-cold encoding is most useful for systems that have active-low enable signals.

2015, Ronald W. Mehler, Digital Integrated Circuit Design Using Verilog and Systemverilog, Elsevier, →ISBN, page 410:

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


backtrackable

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

(computer science) Solvable by backtracking.


FNN

artificial intelligence
artificial intelligence

(artificial intelligence, computer science) Abbreviation of Feedforward Neural Network.


syntax error

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

programming language
programming language

(computer science) An error in the syntax of a sequence of characters or tokens that is intended to be written in a particular programming language.


ASG

abstract semantic graph
w:abstract semantic graph

(computer science) Initialism of abstract semantic graph.


Coppersmith-Winograd algorithm

the Coppersmith-Winograd algorithm (canonical)

Published by Don Coppersmith and Shmuel Winograd in 1990.

(computer science) An algorithm for matrix multiplication.


SICP

The only trouble with SICP is that it was written for MIT students, all of whom love science and are quite comfortable with formal mathematics.

1999, Brian Harvey, Matthew Wright, Simply Scheme: Introducing Computer Science, MIT Press, →ISBN, page xxi:

w:Structure and Interpretation of Computer Programs

(computer science) Initialism of Structure and Interpretation of Computer Programs.


arbitrary-precision arithmetic

(computer science) Any calculation that is performed on numbers whose digits of precision are limited only by the available memory of the host system.


Cali or bust

Many more are coming to the same realisation as Fox: "Cali or bust". But this is at the expense of other tech hubs. Boston, for example, was once tipped to be the hub Silicon Valley has become. While it is still a major player, particularly in med tech, for various reasons, California came out on top.

2015 October 12, John Holden, “The networking in Silicon Valley is unparalleled”, in The Irish Times:

University of Waterloo graduates stressed there is a lot of peer pressure to land jobs in Silicon Valley. The saying on campus is: "Cali or bust."

2018 May 3, Terry Pender, “'Cali or bust': Tech sector losing grads to Silicon Valley”, in Waterloo Chronicle:

CALI OR BUST (overline)

2018 May 11, Lila MacLellan, “Alarm bells should be going off in Canada's STEM industry”, in Quartz:

The main reasons for why a student would 'Cali or bust' are: higher internship pay in the US, experience new locations & cultures, work at reputable companies, and the fact that the many of their classmates are also heading to the US.

2018 May 15, Bo Peng, “The Cali or Bust Conundrum”, in bopeng.io:

(university slang, computer science) Expressing a desire to work for a company in Silicon Valley, California (especially a FAANG company).


stable marriage problem

stable marriage problem (plural stable marriage problems)

(mathematics, economics, computer science) The problem of finding a stable matching between two equal-sized sets of elements, given an ordering of preferences for each element.


Rabin-Karp algorithm

Rabin-Karp algorithm (plural Rabin-Karp algorithms)

Created by Richard M. Karp and Michael O. Rabin (1987).

(computer science) A string-searching algorithm that uses hashing to find an exact match of a pattern string in a text.


van Emde Boas tree

van Emde Boas tree (plural van Emde Boas trees)

(computer science) A tree data structure that implements an associative array with keys of up to m bits. It can perform all operations in a time proportional to the log of the size of its largest element, or equivalently with an upper bound equal to the logarithm of 2 multiplied by m.


Zobrist hashing

(computer science) A hash function technique used in representing the state of board games which helps to avoid analyzing the same position more than once.


Cyrus–Beck algorithm

(computer science) A generalized algorithm for line clipping.


Nicholl–Lee–Nicholl algorithm

(computer science) A fast algorithm for line clipping that reduces the chances of clipping a single line segment multiple times.


Liang–Barsky algorithm

(computer science) A line clipping algorithm that uses the parametric equation of a line and inequalities describing the range of the clipping window to determine the intersections between the line and the clip window.


transmoding

(computer science) Conversion of one media form to another, for example text to audio.


TLM

TLM (countable and uncountable, plural TLMs)

transaction-level modeling
w:transaction-level modeling

(computer science) Initialism of transaction-level modeling.


baksmal

en-verb

baksmal (third-person singular simple present baksmals, present participle baksmaling, simple past and past participle baksmaled)

baksmals (present singular third-person)
baksmaling (participle present)
baksmaled (participle past)
baksmaled (past)

(computer science) Converting a Dalvik executable file (.dex file) to smali language (a human-readable representation of the binary Dalvik bytecode)


neededness

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

Such nested calls are a major source of difficulty in designing a fixpoint algorithm based on neededness analysis, because they are the reason for the dynamic nature of the neededness information.

1994, Niels Jørgensen, “Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration”, in Lecture Notes in Computer Science, volume 864, Berlin/Heidelberg, Germany: Springer Science+Business Media, →DOI, →ISSN:

(computer science) Dependency; the state of one segment of code requiring another segment to complete.


code coverage

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

(computer science) A measure of the degree to which the source code of a program is executed when a particular test suite is run.


DAGN

(computer science) Abbreviation of discourse-aware graph network.


NNUE

Coined by Japanese computer scientist Yu Nasu in 2018 as an inversion of "Efficiently Updateable Neural Network" (stylized as ƎUИИ).

coinage

(computer chess) A type of neural network able to run on a CPU, trained to evaluate a board game (usually chess or shogi) position.


Schneier's Law

(computer science) Alternative letter-case form of Schneier's law.


pseudoconsciousness

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

(neuroscience, neurology, psychology, computer science) A state or condition that is not consciousness but seemingly or nearly approaches it or simulates it.


millipawn

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


ADMM

w:alternating direction method of multipliers

(computer science) Initialism of alternating direction method of multipliers.


randomized polynomial time

en-noun

randomized polynomial time (countable and uncountable, plural randomized polynomial times)

(mathematics, computer science) The complexity class of problems for which a probabilistic Turing machine exists with certain properties.


time hierarchy theorem

(mathematics, computer science) A theorem that demonstrates that allowing Turing machines additional computation time strictly increases the class of languages that they can decide.


circulation time

circulation time (countable and uncountable, plural circulation times)

The circulation time of a slot in front of an access window has been chosen as the basic unit of time.

1982, Cees J. van Spronsen, Lutz Richter, Microsystems: Architecture, Integration, and Use, page 24:

The first record for the day gives a base time, while subsequent records for the day each have a circulation time associated with them; the circulation time is thus calculated by subtracting from the current log-on time the log-on time of the previous run by the same user.

2001, Per Brinch Hansen, Classic Operating Systems, page 94:

This mechanism provides latency hiding by decoupling the micro-threaded processor from the token circulation time.

2006, Nabil Hasasneh, Ian Bell, Chris Jesshope, “Scalable and Paritionable Asynchronous Arbiter for Micro-threaded Chip Multiprocessors”, in Werner Grass, Bernhard Sick, Klaus Waldschmidt, editor, Architecture of Computing Systems - ARCS 2006, page 266:

(computing, computer science) The amount of time that elapses in a multiprocess system from the time when a process is loaded for execution until the time when the same process is next loaded for more processing.


hopscotch hashing

(computer science) A scheme for resolving hash collisions, having an insertion algorithm that involves a series of hops.


Robin Hood hashing

An allusion to the folkloric Robin Hood's practice of stealing from the rich to give to the poor.

(computer science) A scheme for resolving hash collisions that favors the displacement of the element that is farthest from its home location.


NEXPTIME

computational complexity theory
computational complexity theory

nondeterministic Turing machine
nondeterministic Turing machine

(computer science) In computational complexity theory, a complexity class in which the set of decision problems can be solved by a nondeterministic Turing machine using time 2^(nᴼ⁽¹⁾).


computational complexity theory

computational complexity theory (countable and uncountable, plural computational complexity theories)

computational complexity theories (plural)

(mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other.


nondeterministic Turing machine

nondeterministic Turing machine (plural nondeterministic Turing machines)

nondeterministic Turing machines (plural)

Coordinate term: deterministic Turing machine

(computer science) A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read.


Church-Rosser property

Church-Rosser property (plural Church-Rosser properties)

Alonzo Church and J. Barkley Rosser proved in 1936 that lambda calculus has this property.

(logic, computer science) The property of a rewriting system for which x stackrel *↔y implies x mathbin ↓y for all objects x, y.


NTIME

(computer science) In computational complexity theory, the complexity class that is the set of decision problems that can be solved by a nondeterministic Turing machine which runs in time O(f(n)), where O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided).


nondeterministic polynomial time

nondeterministic polynomial time (countable and uncountable, plural nondeterministic polynomial times)

nondeterministic polynomial times (plural)

deterministic Turing machine
deterministic Turing machine

(computer science) A class of decision problems for which a yes solution can be verified by a deterministic Turing machine in polynomial time, or alternatively a set of problems that can be solved in polynomial time by a nondeterministic Turing machine.


deterministic Turing machine

deterministic Turing machine (plural deterministic Turing machines)

Coordinate term: nondeterministic Turing machine

(computer science) A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read.


queap

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

Devised by John Iacono and Stefan Langerman.

(computer science) a priority queue data structure


constant time

constant time (countable and uncountable, plural constant times)

Coordinate term: amortized constant time

(computer science) An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input.


amortized constant time

Coordinate term: constant time

(computer science) A class of algorithms in which the amortized time (the time per operation averaged over many operations) is constant, although for some operations the time may be dependent on the size of the input.


time-loop logic

Novikov self-consistency principle
Novikov self-consistency principle

(computer science) A hypothetical system of computation that exploits the Novikov self-consistency principle to compute answers much faster than possible with the standard model of computational complexity using Turing machines.


space-time trade-off

space-time trade-off (plural space-time trade-offs)

(computer science) A case where an algorithm or program trades increased space usage with decreased time, in which space refers to the data storage consumed in performing a given task and time refers to the time consumed in performing a given task.


time factor

(computer science) Synonym of time scale


time-space complexity

time-space complexity (usually uncountable, plural time-space complexities)

(computer science) The combination of the measure of the amount of time and space in which an algorithm requires to run or solve a given decision problem.


HNSW

w:Hierarchical Navigable Small World graphs

(computer science) Initialism of Hierarchical Navigable Small Worlds.


time algorithm

(computer science) An algorithm which specifies the amount of time required to solve a problem as a function of its input size.


APTIME

alternating Turing machine
alternating Turing machine

(computer science, computational complexity theory) The set of problems decidable by an alternating Turing machine in polynomial time.


alternating Turing machine

alternating Turing machine (countable and uncountable, plural alternating Turing machines)

(computer science, computational complexity theory) A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP.


EXPTIME

(computer science, computational complexity theory) The set of all decision problems that are solvable by a deterministic Turing machine in exponential time.


exponential time

exponential time (countable and uncountable, plural exponential times)

exponential function
exponential function

(computer science) An algorithm whose running time increases as an exponential function of the size of its input.


cubic time

cubic time (countable and uncountable, plural cubic times)

(computer science, computational complexity theory) An algorithm whose running time consists of three loops proportional to the cube of n.


pseudo-polynomial time

pseudo-polynomial time (countable and uncountable, plural pseudo-polynomial times)

LL-Q1860 (eng)-Flame, not lame-pseudo-polynomial time.wav

(computer science, computational complexity theory) A time algorithm whose running time is a polynomial in the numeric value of the input, but not necessarily in the length of the input.


quadratic time

quadratic time (countable and uncountable, plural quadratic times)

(computer science) A time algorithm in which given an input of size n, the number of steps required to complete a task is the square of n.


nondeterministic polynomial time
nondeterministic polynomial time

(computer science) The set, or property, of a problem with a yes/no answer in which the complementary yes/no problem calls for nondeterministic polynomial time.


nonuniform polynomial time

nonuniform polynomial time (countable and uncountable, plural nonuniform polynomial times)

(computer science, computational complexity theory) The class of decision problems solvable by a family of polynomial-sized Boolean circuits.


Boolean circuit

Boolean circuit (plural Boolean circuits)

(computer science, computational complexity theory) A directed acyclic graph whose internal nodes are Boolean functions.


deferred time

deferred time (countable and uncountable, plural deferred times)

computer engineering
computer engineering

(computer engineering) The time when a deferred operation eventually takes place.


subquadratic time

subquadratic time (plural subquadratic times)

(computer science) A time algorithm that runs in greater than linear, but less than quadratic time.


conk off

en-verb

conk off (third-person singular simple present conks off, present participle conking off, simple past and past participle conked off)

conks off (present singular third-person)
conking off (participle present)
conked off (participle past)
conked off (past)

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


Knuthian

The purpose of this paper is to present an algebraic treatment of Knuth's approach to the specification of the semantics of context-free languages. Knuthian systems, hereinafter called K-systems, have been called declarative semantics, K-grammars and attributed grammars.

1976, Laurian M. Chirica, David F. Martin, “An algebraic formulation of Knuthian semantics”, in 17th Annual Symposium on Foundations of Computer Science (SFCS), →DOI, internal citations omitted:

This page lists bugs in the original (Knuthian) TeX distribution which have been received since the last tune-up[.]

2024 October 26 (last accessed), “Pending bugs for original TeX”, in tug.org:

(computer science, mathematics) Of or relating to the work, or theory developed from the work, of American computer scientist and mathematician Donald Knuth.


control-flow graph

en-noun

control-flow graph (plural control-flow graphs)

(computer science) A representation, using graph notation, of all paths that might be traversed through a program during its execution.


concatenation tree

concatenation tree (plural concatenation trees)

When working on the tree representations in our algorithms, we assume that the symbol [.] (vₗ, vᵣ) means a concatenation tree with root "." and children vₗ and vᵣ.

2002, Gonzalo Navarro, Mathieu Raffinot, Flexible Pattern Matching in Strings, page 101:

While galleys are sent between the several objects in a concatenation tree, galleys arriving at the left-most leaf are not expanded, while all other galleys are expanded as far as possible (are “forced”) on arrival.

2003, Wolfram Kahl, “Beyond Pretty-Printing: Galley Concepts in Document Formatting Combinators”, in Gopal Gupta, editor, Practical Aspects of Declarative Languages, page 82:

(computer science) A tree data structure whose internal nodes represent the concatenation of their child branches.


processing unit

processing unit (plural processing units)

(computing, computer science) An electrical component (digital circuit) that performs operations on an external data source, usually memory or some other data stream.


monomorphize

en-verb

monomorphize (third-person singular simple present monomorphizes, present participle monomorphizing, simple past and past participle monomorphized)

monomorphizes (present singular third-person)
monomorphizing (participle present)
monomorphized (participle past)
monomorphized (past)

(computer science, transitive) To convert (a polymorphic function) to a monomorphic function.


precertificate

To do so, the CA submits a Precertificate that the log can use to create an entry that will be valid against the issued certificate.

2013 June, B. Laurie, A. Langley, E. Kasper, “RFC 6962: Certificate Transparency”, in IETF Datatracker, Internet Engineering Task Force (IETF), page 9:

Alternatively, before signing the certificate, the CA creates a precertificate that binds the same data in a different format as the final certificate.

2022, Jingqiang Lin, Qiang Tang, editors, Applied Cryptography in Computer and Communications: Second EAI International Conference, AC3 2022, Virtual Event, May 14-15, 2022, Proceedings (Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering; 448), Springer Nature, →ISBN, page 129:

The CA sends the precertificate to logs

2025 January 5, Wikipedia contributors, “Certificate Transparency”, in English Wikipedia, Wikimedia Foundation:

(computer science, cybersecurity) A special type of SSL/TLS certificate used in Certificate Transparency (CT) for logging purposes. It's a precursor to the actual SSL/TLS certificate and helps ensure transparency in the certificate issuance process.