摘要 We study how 統計 complexity depends on the system

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

• SFI 頁面

論文資訊

• 類型：已發表論文
• 日期：2008

摘要

We study how 統計 complexity depends on the system size and how the complexity of the whole system relates to the complexity of its subsystems. We study this size dependence for two well-known complexity measures, the excess 熵 of Grassberger and the 神經 complexity introduced by Tononi, Sporns and Edelman. We compare these results to properties of complexity measures that one might wish to impose when seeking an axiomatic characterization. It turns out that those two measures do not satisfy all those requirements, but a renormalized version of the TSE-complexity behaves reasonably well.

※ 此為已發表論文，全文需透過期刊付費取得