送交者: 蓝隼 于 2011-10-04, 13:46:32:

回答: 说了半天他还把数学当科学。另外， 由 ak7O 于 2011-10-04, 05:23:42:

• 问题是什么是“简单”，什么又是“复杂”？ - ak7O (252 bytes) 2011-10-04, 14:34:05 (622470)
  • finding the topological entropy of a dynamic system is undecidable. - steven (86 bytes) 2011-10-04, 15:00:56 (622474)
    • My understanding is that complexity is only meaningful when - 蓝隼 (425 bytes) 2011-10-04, 15:36:16 (622478)
      • 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)

加跟贴