algorithmic formula
Смотреть что такое "algorithmic formula" в других словарях:
algorithmic program — noun a precise rule (or set of rules) specifying how to solve some problem • Syn: ↑algorithm, ↑algorithmic rule • Derivationally related forms: ↑algorithmic (for: ↑algorithm) • Hypernyms: ↑ … Useful english dictionary
algorithmic rule — noun a precise rule (or set of rules) specifying how to solve some problem • Syn: ↑algorithm, ↑algorithmic program • Derivationally related forms: ↑algorithmic (for: ↑algorithm) • Hypernyms: ↑ … Useful english dictionary
Weyl character formula — In mathematics, the Weyl character formula in representation theory describes the characters of irreducible representations of compact Lie groups in terms of their highest weights. It is named after Hermann Weyl, who proved it in the late… … Wikipedia
algorithm — algorithmic, adj. /al geuh ridh euhm/, n. a set of rules for solving a problem in a finite number of steps, as for finding the greatest common divisor. [1890 95; var. of ALGORISM, by assoc. with Gk arithmós number. See ARITHMETIC] * * * Procedure … Universalium
Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… … Wikipedia
Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… … Wikipedia
Per Martin-Löf — in 2004 Born May 8, 1942 (194 … Wikipedia
information theory — the mathematical theory concerned with the content, transmission, storage, and retrieval of information, usually in the form of messages or data, and esp. by means of computers. [1945 50] * * * ▪ mathematics Introduction a mathematical… … Universalium
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
computer programming language — Introduction any of various languages for expressing a set of detailed instructions for a digital computer. Such instructions can be executed directly when they are in the computer manufacturer specific numerical form known as machine… … Universalium
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
