The Algorithmic Complexity of Landscapes

被引:23
|
作者
Papadimitriou, Fivos
机构
关键词
Landscape complexity; K-complexity; Kolmogorov complexity; spatial complexity; Greece; MINIMUM MESSAGE LENGTH; ECOLOGICAL COMPLEXITY; MANAGEMENT; DIVERSITY; SYSTEM;
D O I
10.1080/01426397.2011.650628
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
A method to evaluate the algorithmic complexity of landscapes is developed here, based on the notion of Kolmogorov complexity (or K-complexity). The K-complexity of a landscape is calculated from a string x of symbols representing the landscape's features (e. g. land use), whereby each symbol belongs to an alphabet L, and can be defined as the size of the shortest string y that fully describes x. K-complexity presents several useful aspects as a measure of landscape complexity: a) it is a direct measure of complexity and not a surrogate measure, well supported by the literature of Informatics; b) it is easy to apply to landscapes of 'small' size' c) it can be used to compare the complexity of two or more landscapes; d) it allows calculations of a landscape's changes in complexity with time; e) it can be a descriptor not only of the landscape's structural complexity, but also of its functional complexity; and f) it makes possible to distinguish two landscapes with the same diversity but with different complexity.
引用
收藏
页码:591 / 611
页数:21
相关论文
共 50 条
  • [1] Algorithmic complexity and randomness
    Partovi, AH
    BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING, PT 2, 2001, 568 : 31 - 37
  • [2] Algorithmic complexity and applications
    Calude, Cristian S.
    Jurgensen, Helmut
    FUNDAMENTA INFORMATICAE, 2008, 83 (1-2) : VII - VIII
  • [3] Algorithmic Folding Complexity
    Jean Cardinal
    Erik D. Demaine
    Martin L. Demaine
    Shinji Imahori
    Tsuyoshi Ito
    Masashi Kiyomi
    Stefan Langerman
    Ryuhei Uehara
    Takeaki Uno
    Graphs and Combinatorics, 2011, 27 : 341 - 351
  • [4] Algorithmic complexity of a protein
    Dewey, TG
    PHYSICAL REVIEW E, 1996, 54 (01): : R39 - R41
  • [5] The history of Algorithmic complexity
    Nasar, Audrey A.
    MATHEMATICS ENTHUSIAST, 2016, 13 (03): : 217 - 242
  • [6] Chaos and algorithmic complexity
    Batterman, RW
    White, H
    FOUNDATIONS OF PHYSICS, 1996, 26 (03) : 307 - 336
  • [7] On the algorithmic complexity of crystals
    Krivovichev, S. V.
    MINERALOGICAL MAGAZINE, 2014, 78 (02) : 415 - 435
  • [8] Algorithmic Folding Complexity
    Cardinal, Jean
    Demaine, Erik D.
    Demaine, Martin L.
    Imahori, Shinji
    Ito, Tsuyoshi
    Kiyomi, Masashi
    Langerman, Stefan
    Uehara, Ryuhei
    Uno, Takeaki
    GRAPHS AND COMBINATORICS, 2011, 27 (03) : 341 - 351
  • [9] Algorithmic Folding Complexity
    Cardinal, Jean
    Demaine, Erik D.
    Demaine, Martin L.
    Imahori, Shinji
    Langerman, Stefan
    Uehara, Ryuhei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 452 - +
  • [10] Algorithmic theory of complexity
    Polizzi, Gaspare
    NUNCIUS-JOURNAL OF THE HISTORY OF SCIENCE, 2007, 22 (01): : 176 - 177