KIAM Main page Web Library  •  Publication Searh  Русский 

KIAM Preprint № 18, Moscow, 2001
Authors: Vorogtsov A.V.
Large Predicting and Complexity Theory.
Here we turn onto the predicting task. The purpose of this paper is much of the setting the task correctly. It's just the case when the correctly formulated task is half of its solution. It's showed that the measure of complexity on the set of dynamical systems is needed. And firstly Affine maps (Markov chains) must be endowed with this measure. This complexity corresponds to the complexity of modeling or the complexity of calculating dynamic system. Suggested approach includes a lot of special cases - linear, harmonic and quantum approximations.
Publication language: russian
Research direction:
Mathematical problems and theory of numerical methods
Russian source text:
View statistics (updated once a day)
over the last 30 days — 0 (+0), total hit from 01.09.2019 — 0