n
(computing) In multithreaded computing, when a program mistakenly considers equality of a variable at two times to mean it has never changed in between.
n
(computer science) A function that defines the output of a particular node in an artificial neural network on the basis of its inputs.
n
(programming, type theory) A data type formed by combining other types.
n
The principles governing any of various forms of analysis.
n
(statistics) Acronym of analysis of covariance.
n
A parameter at a function call; an actual parameter, as opposed to a formal parameter.
n
(computer hardware) the section of a CPU that performs calculations and logical operations
v
(transitive) To treat (a mathematical system) by methods involving only the fundamental concepts and operations of arithmetic.
adj
(computing) Addressable by a key more complex than an integer index.
n
(mathematics) A form of calculation in which input parameters are adjusted until the calculated result coincides with the actual result found
n
(statistics) The numerical width of a bin
n
A method of transmitting binary data that avoids problems associated with long strings of ones or zeros.
n
A normalised numerical score used to determine the similarity of two lists
n
(computer science) A method of computation wherein the computer is let to try all permutations of a problem until one is found that provides a solution, in contrast to the implementation of a more intelligent algorithm.
n
(computing) Any function that is provided as part of a high-level language and can be executed by a simple reference with specification of arguments
n
An algorithm used in data compression that rearranges a character string into runs of similar characters.
n
(formal, rare) An equation, ratio, or other quantitative problem designated for calculation; “that which is to be calculated”.
adj
Arrived at or determined by mathematical calculation; ascertained mathematically.
adj
Of, pertaining to, or employing calculation
n
(dated) A person who performs mathematical calculation
adj
Of or pertaining to calculation.
n
(obsolete) mathematician
n
(computer science) A generalization of the folds on lists known from functional programming to arbitrary abstract data types that can be described as initial algebras.
adj
(computing) Describing a definition, particularly of an algorithm, given in terms of its output, rather than its input.
n
(computer science) A lambda expression which has no free variables in it.
n
(computer science) A mathematical function that can be computed using an abstract computation machine such as Turing machine.
n
The act or process of computing; calculation; reckoning.
n
(computer science) a sequence of steps taken by an abstract machine in the process of computing its result.
n
(philosophy) The view that the human mind and/or brain is an information-processing system and that thinking is a form of computing.
n
(philosophy) Synonym of computationalism
adj
of or relating to computation, computational
adj
Calculated, determined by computation.
n
(rare) The process or means of computing; computational resources.
n
convolutional neural network
n
The dual to recursion, that acts on the computed result, rather than the input.
adj
Alternative form of co-recursive [(computing) Describing a definition, particularly of an algorithm, given in terms of its output, rather than its input.]
adj
(computing theory) Not using fuzzy logic; based on a binary distinction between true and false.
n
The mathematics of cryptography.
n
(computing) The technique of converting a function that takes multiple arguments into a sequence of functions that each take a single argument.
n
(mathematics) del, the partial difference symbol ∂
n
Decision making, especially by means of a formal computational methodology.
n
(logic, uncountable) The act of representing one language, typically a logic or programming language, with another by modeling expressions in the former as data in the latter.
n
(computing, informal) A small but noticeable effect. Compare epsilon.
adj
(nonstandard, non-native speakers' English, especially in India) Having a specified number or kind of digits.
n
(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
n
(computing) Setting up a hierarchy of calculated constants in a language such as Ada so that the values of one or more of them determine others further down in the hierarchy.
n
(computing) Any device or circuit that carries out a exponentiation operation
n
Alternative form of finite-state machine [(computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another.]
n
(computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another.
n
(computer science) the rigorous mathematical study of the meaning of programming languages
n
(computing) A routine that receives zero or more arguments and may return a result.
n
(functional programming) A structure allowing a function to apply within a generic type, in a way that is conceptually similar to a functor in category theory.
n
(computing theory) A formula giving the theoretical speedup in latency of the execution of a task at fixed execution time that can be expected of a system whose resources are improved.
adj
(computing) Having values that are constants rather than variables.
n
(computer science) A function that takes one or more functions as an input, and returns a function as a result.
n
(computing theory) A classical type system for the lambda calculus with parametric polymorphism, notable for its completeness and its ability to infer the most general type of a given program without programmer-supplied type annotations or other hints.
n
(computing) Any of several forms of computation that are theoretically (or practically) impossible with current technology
n
(computing) an operator that is placed in between the operands like it is commonly used in arithmetical and logical formulae and statements.
n
A device that calculates definite integrals.
n
(business) The management and optimization of internal production and distribution processes.
n
(programming) A property that does not change through a program's execution.
n
(mathematics) a function that iterates
v
(obsolete) Pronunciation spelling of calculate. [(transitive, mathematics) To determine the value of something or the solution to something by a mathematical process.]
n
(computer science) The number of edits (replacements, deletions and insertions) required to change one string into another.
n
A model that uses simplified description of behavior of spatially distributed physical system into a topology which consists of discrete entities that approximate the behavior of the distributed system under certain assumptions.
n
(mathematics, computing) simulation of a system as a whole, without simulating the behaviour of its individual components
n
An abstract mathematical representation of a process, device or concept; it uses a number of variables to represent inputs, outputs and internal states, and sets of equations and inequalities to describe their interaction.
n
(statistics) An analysis resulting from combining the results of diverse statistical studies.
n
(computing theory) The property of an interpreter that is written in the same programming language that it interprets, and that exploits homoiconicity to reuse the existing facilities of the parent interpreter rather than reimplementing them.
n
(computing theory) The transformation of computer programs based on their semantics.
adj
(programming, of a function) taking only a single data type
n
(computing theory) A finite-state machine whose output values are determined solely by its current state.
n
(programming) A data structure that has the semantics of an array of arrays, all of which may be indexed with values of any data type, usually with a supporting syntax built-into a programming language.
adj
(computing) Of a programming language, able to produce such programs
n
(electrical engineering) The use of the higher(positive) voltage level to represent the Boolean value 0 and the lower voltage(negative) level to represent the Boolean value 1.
n
Synonym of nat (“logarithmic unit of information”)
n
(grammar) Synonym of quirky subject
n
(sciences, statistics) The practice of reanalysis of data until a desired result is obtained which is statistically significant
n
(cryptography) A method of permuting or transposing bits (binary digits) across S-box inputs while retaining diffusion.
adj
(computing) Supporting a variable but nonzero number of arguments.
n
(computing) An increment operation that takes place after evaluation of the expression that contains the variable being incremented.
n
A description of the relationship between the academic literature on a subject and the number of authors in the subject area, stating that half of the publications come from the square root of all contributors.
adj
(computing) Generated by means of a procedure, rather than being designed.
n
(mathematics, computing) Something that resembles a value but is not a true value or does not really belong to the set of data being studied.
n
The weight of a pseudocodeword
n
(computing theory) A model-free reinforcement learning algorithm to learn a policy telling an agent what action to take under what circumstances.
n
(finance) A quantitative analyst.
n
(computing) A symbol or symbols in a regular expression indicating the number of characters to be matched.
adj
(computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time
adj
(computing, of a computing language, or expert system) based on a series of simple "if then" rules
adj
(computing) Of, relating to, or happening during run time.
n
(programming) A binary operator that returns its second argument, unless the first argument is null, in which case it returns null; used to simplify code that would otherwise need multiple explicit checks for nullity.
n
(computing, sciences) The use of computing to solve scientific and engineering problems, especially by means of simulation, or the construction of mathematical models of physical, chemical or biological processes
n
(computing theory) A set of semiwords.
n
(computing theory) The conversion of a parallel algorithm into sequential form.
adj
Of or pertaining to simulation
n
(computing) The set of all parameters relevant to a computation.
adj
Of or pertaining to statistics.
n
The process of examining data to draw conclusions or insights, and determine cause-and-effect patterns between events; for example determining the safety and efficacy of new drugs by drawing out a probability as to whether the fact that a patient got better (or worse) was due to the drug or some other (perhaps random) factor.
n
(statistics) A method of monitoring a process through the use of control charts.
n
(mathematics, programming) An expression that is a part of a larger expression.
adj
Of or relating to supercomputers or supercomputation.
n
(philosophy) A quantifiably infinite number of operations that occur sequentially within a finite interval of time.
adj
(computing theory) Being or relating to a type of operator used in hypercomputation.
n
(programming) A variable, etc. that can take any of three distinct values.
n
(statistics) A single-step multiple-comparison procedure and statistical test that can be used to find means that are significantly different from each other.
n
(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.
n
(computing, programming) The use of variadic templates.
n
(computing) A variable that can hold any of various unrelated data types.
n
(programming) A one-dimensional array.
n
A dynamic programming algorithm for finding the most likely sequence of hidden states (the Viterbi path) that results in a sequence of observed events.
n
A code used to describe one-dimensional cellular automaton rules, based on a mapping of cell states to a digit sequence.
n
(computer graphics) A property of a graphical object that indicates its position in the z-order.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 8 letters and means "Believable and worthy of trust." Can you find it?