My understanding is that complexity is only meaningful when

送交者: 蓝隼于 2011-10-04, 15:36:16:

回答: finding the topological entropy of a dynamic system is undecidable. 由 steven 于 2011-10-04, 15:00:56:

two or more systems are compared against each other. The concept of being simple or complicate is relative, just like the electric potential. One can not say the absolute value.
Besides, I don't think quantity is the major concern here. What metter is not how much two system different in their complexity, but if one is more complicate than the other. That can be determined quite objectively in many cases matter here.

所有跟贴:

Steven is talking about computational complexity. - ak7O (24 bytes) 2011-10-05, 00:08:35 (622530)
Well, what it says is that there is no way to tell if one of two systems - steven (108 bytes) 2011-10-04, 15:44:53 (622485)
- Generally, you are right. Yet my guess is - 蓝隼 (191 bytes) 2011-10-04, 16:08:08 (622489)
  - When you say "compare", you have to define it. - ak7O (577 bytes) 2011-10-05, 00:27:55 (622533)
    - Occam's razor isn't a "devine" golden law. - steven (131 bytes) 2011-10-05, 13:35:26 (622604)

加跟贴