> Если Вас не затруднит, нельзя ли вот тут подробнее...плиз
Classicially, this complexity is the size of the optimal algorithmic description, roughly speaking. Since the pair (f, D) is one of the algorithmic descriptions of X, complexity of X in this sense cannot exceed complexity of f + complexity of D. He really means complexity, when he says simplicity.
So I don't think this is Kolmogorov complexity per se, but something similar in spirit. Just a description of X, not the optimal one, but the "current" one in some ill-specified, but acceptable for physists way...
It's real-time computations, not some abstract "optimal computations".
*******
Он как раз пытается поверить алгеброй душу в буддистском варианте :-) Это мне как раз нравится...
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
timeasmymeasure
no subject
Date: 2005-02-23 10:57 pm (UTC)Classicially, this complexity is the size of the optimal algorithmic description, roughly speaking. Since the pair (f, D) is one of the algorithmic descriptions of X, complexity of X in this sense cannot exceed complexity of f + complexity of D. He really means complexity, when he says simplicity.
So I don't think this is Kolmogorov complexity per se, but something similar in spirit. Just a description of X, not the optimal one, but the "current" one in some ill-specified, but acceptable for physists way...
It's real-time computations, not some abstract "optimal computations".
*******
Он как раз пытается поверить алгеброй душу в буддистском варианте :-) Это мне как раз нравится...