期刊文献+

复杂性究竟有多复杂?——论复杂性的测度 被引量:14

On the Measure of Complexity
下载PDF
导出
摘要 系统的复杂性测度叫做复杂度,然而目前却没有适用所有复杂性的通用测度方法,通常都从某个角度或参数来衡量一个系统的复杂性。现在研究比较成熟的有结构复杂性、计算复杂性、描述复杂性、有效复杂性等几种测度,并用这几种复杂性测度来衡量复杂性到底有多复杂。 the measure of complexity for a system is called degree of complexity. But until now, there is no commonly means to suitable for all complexity systems. In generally, we measure the degree of complexity for a system from one point of view or parameter. Currently, structure complexity, computational complexity, description complexity, and effective complexity are some well-rounded measure and we can use these means to measure the complexity of a system how complex it has.
作者 黄欣荣
出处 《系统辩证学学报》 2005年第4期49-55,共7页 Journal of Systemic Dialectics
关键词 复杂性 测度 复杂度 complexity measure degree of complexity
  • 相关文献

参考文献14

  • 1黄欣荣.复杂性究竟是什么——复杂性的语义分析[J].自然辩证法研究,2004,20(5):31-35. 被引量:12
  • 2John Hogan. From complexity to perplexity [J] . Scientific America, Jun, 1995.
  • 3N · Rasher. Complexity: a philosophical overview [M]. Transaction Publishers. New Brunswick. New Jersey, 1998.9,9-10.
  • 4F·克拉默 柯志阳 吴彤译.混沌与秩序[M].上海:上海科学技术教育出版社,2000.285.
  • 5宋学峰.系统复杂性的度量方法[A]..复杂性科学进展[C].北京:科学出版社,2004.57-59.
  • 6Millar G A. The magical number seven. Plus or mines two: some limitation on our capacity for processing information [J]. Psychology Peview. 63 (2): 81-97.
  • 7Winfield J N. A science of generic design: managing complexity through systems design [M]. The 2nd edition, Ames,IA: lower State University Press, 1994.
  • 8Winfield J N and el. A handbook of interactive management [M]. Ames, IA: Iowa State University Press, 1994.
  • 9Delbecq A L and el. Group techniques for program landing [A]. A guide to nominal group and Delphi processes [C]. Glenview, IL: Scott, Foresman, 1975.
  • 10Staley S M. Complexity measurement of systems design [A]. Integrated design and process technology [C]. IDPT.1995, 1 153-161.

二级参考文献39

  • 1林德宏.辩证法:复杂性的哲学[J].江苏社会科学,1997(5):93-96. 被引量:10
  • 2..http://www. cwi. nl/-paulv/KOLMOGOROV . BIOGRAPHY. html,.
  • 3霍尔姆斯 王兰字译.天遇—混沌与稳定性的起源[M].上海:上海科技教育出版社,2001.226—280.
  • 4.不列颠百科全书(国际中文版):第9卷[M].北京:中国大百科全书出版社,1999.322.
  • 5莫兰 陈一壮译.复杂思想:自觉的科学[M].北京:北京大学出版社,2001.155,159,184.
  • 6Solomonoff R J. A formal theory of inductive inference(part Ⅰ and Ⅱ )[J ]. Inform Contr, 1964 (7): 1 - 2,224 - 254.
  • 7Chaitin G J.On the length of programs for computing finite binary. sequences[J ] .J Assoc Comput Math, 1966, 13:547 - 569.
  • 8Chaitin G J. On the length of programs for computing finite binary sequences: statistical considerations[ J ]. J Assoc Comput Math, 1969.16 : 145 -159.
  • 9Aleksandrov P S. A few words on A. N. Kolmorov[J ]. Russian Math Surveys, 1983,38(4) :5 - 7.
  • 10Tikhomirov V M. The life and work of Andrei Nikolaevich Kolmogorov[J ]. Russian Math Surveys, 1988,43(6) : 1 - 39.

共引文献29

同被引文献266

引证文献14

二级引证文献37

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部