algorithmic+complexity

См. также в других словарях:

• Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… …   Wikipedia

• Algorithmic information theory — is a subfield of information theory and computer science that concerns itself with the relationship between computation and information. According to Gregory Chaitin, it is the result of putting Shannon s information theory and Turing s… …   Wikipedia

• Algorithmic probability — is a concept in theoretical computer science; it quantifies the idea of theories and predictions with reference to short programs and their output. Around 1960, Ray Solomonoff invented the concept of algorithmic probability: take a universal… …   Wikipedia

• Algorithmic composition — is the technique of using algorithms to create music.Algorithms (or, at the very least, formal sets of rules) have been used to compose music for centuries; the procedures used to plot voice leading in Western counterpoint, for example, can often …   Wikipedia

• Algorithmic mechanism design — (AMD) lies at the intersection of economic game theory and computer science.Noam Nisan and Amir Ronen, from the Hebrew University of Jerusalem, first coined Algorithmic mechanism design in a research paper supported by grants from the Israeli… …   Wikipedia

• Complexity theory — may refer to: The study of a complex system or complex systems Complexity theory and organizations, the application of complexity theory to strategy Complexity economics, the application of complexity theory to economics Chaos theory, the study… …   Wikipedia

• Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… …   Wikipedia

• Algorithmic trading — In electronic financial markets, algorithmic trading or automated trading, also known as algo trading, black box trading, or robo trading, is the use of computer programs for entering trading orders with the computer algorithm deciding on certain …   Wikipedia

• Complexity index — Besides complexity intended as a difficulty to compute a function (see computational complexity), in modern computer science and in statistics another complexity index of a function stands for denoting its information content, in turn affecting… …   Wikipedia

• algorithmic entropy — noun Kolmogorov complexity …   Wiktionary

• 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