| 单词 | Kolmogorov Complexity |
| 释义 | Kolmogorov ComplexityThe complexity of a pattern parameterized as the shortest Algorithm required to reproduce it. Also known as Algorithmic Complexity.
Goetz, P. ``Phil's Good Enough Complexity Dictionary.'' http://www.cs.buffalo.edu/~goetz/dict.html. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。