correlation, bitcoin, criminal brokers, infinite matrix, chaos theory, hurst exponent, stochastic volatility garch, price reaction, g-bot, black and scholes model, beware, perceptron, trader-assistant.com, our beathespread ea, hft, alpari, oooooppss, laguerre, mq4, kolmogorov complexity, idea, profitability, video, levenberg-marquardt algorithm, best mq4 coders, chess program, jobs, initiative interesting, trades proposal, logarithms for central banks, pfe, black-scholes-merton, broker, mt4, state-based mobility model, GOERTZEL, coding, Looking for a trader, A good trader shows good results, Wedge Chart patterns, big lecture, futures, important news, NxCOREAPI. DLL, MT4 not reliable, Empiric method, funny, VSA, Wide Range Bodies, Need to Know News

- Blogs
- jaguar1637
- Kolmogorov complexity

From http://en.wikipedia.org/wiki/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 the Andrey Kolmogorov who first published on the subject in 1963.^{[1]}^{[2]}

Kolmogorov complexity is also known as "descriptive complexity" (not to be confused with descriptive complexity theory), **Kolmogorov–Chaitin complexity**, **algorithmic entropy**, or **program-size complexity**.

It can be shown^{[11]} that for the output of Markov information sources, Kolmogorov complexity is related to the entropy of the information source. More precisely, the Kolmogorov complexity of the output of a Markov information source, normalized by the length of the output, converges almost surely (as the length of the output goes to infinity) to the entropy of the source