1,568
个编辑
更改
跳到导航
跳到搜索
小第1行：
第1行： − 此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。+ 第9行：
第9行： − + − + − + − − | last = Johnson − − 最后的约翰逊 − | first = Steven+ − − 首先是史蒂文 − | title = Emergence: The Connected Lives of Ants, Brains, Cities+ − − 文章标题: 蚂蚁、大脑、城市的相互联系的生活 − | publisher = Scribner+ − 出版商 Scribner+ − | year = 2001+ − 2001年+ − − | location = New York − − | 地点: 纽约 − − | url = https://books.google.com/books?id=Au_tLkCwExQC − − Https://books.google.com/books?id=au_tlkcwexqc − | page = 19+ − 第19页+ − | isbn = 978-3411040742}}+ − | isbn 978-3411040742}+ − </ref>+ − </ref> − / 参考 + + − The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of emergence greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of complex systems theory. − 这个术语通常用来描述具有许多部分的事物，这些部分以多种方式相互作用，最终以大于其部分之和的更高级别出现。在不同尺度上研究这些复杂连杆机构是复杂系统理论的主要目标。 + + − − Science takes a number of approaches to characterizing complexity; Zayed et al.<ref> − − 科学采取了许多方法来描述复杂性; 扎耶德等人 − J. M. Zayed, N. Nouvel, U. Rauwald, O. A. Scherman. Chemical Complexity – supramolecular self-assembly of synthetic and biological building blocks in water. Chemical Society Reviews, 2010, 39, 2806–2816 http://pubs.rsc.org/en/Content/ArticleLanding/2010/CS/b922348g+ − 扎耶德，n. Nouvel，u. Rauwald，o。作者: a. Scherman。化学复杂性-超分子自组装的合成和生物构建块在水中。化学学会评论，2010,39,2806-2816 http://pubs.rsc.org/en/content/articlelanding/2010/cs/b922348g+ − − </ref> − − / 参考 − − reflect many of these. Neil Johnson states that "even among scientists, there is no unique definition of complexity – and the scientific notion has traditionally been conveyed using particular examples..." Ultimately Johnson adopts the definition of "complexity science" as "the study of the phenomena which emerge from a collection of interacting objects".<ref name="Neil Johnson">{{cite book − − 反映了很多这样的事情。Neil Johnson 指出，”即使在科学家中，也没有对复杂性的独特定义——传统上，科学概念是通过特定的例子传达的... ... ”最终，Johnson 采用了”复杂性科学”的定义，即”研究从一系列相互作用的物体中产生的现象”。 尼尔 · 约翰逊自传 − |last = Johnson+ − 最后的约翰逊+ − − |first = Neil F. − − 首先是尼尔 · f。 − |title = Simply complexity: A clear guide to complexity theory+ − 简单的复杂性: 复杂性理论的明确指南+ − − |publisher = Oneworld Publications − − 出版商寰宇一家出版社 − |year = 2009+ − 2009年+ − − |chapter = Chapter 1: Two's company, three is complexity − − 第一章: 两个人的公司，三个人的复杂性 − |page = 3+ − − 第三页 − |chapter-url = http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf+ − − | 章节-网址 http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf − |isbn = 978-1780740492+ − 978-1780740492+ − − |access-date = 2013-06-29 − − 2013-06-29 − − |archive-url = https://web.archive.org/web/20151211064454/http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf − | 档案-网址 https://web.archive.org/web/20151211064454/http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf+ − |archive-date = 2015-12-11+ − − | 档案日期2015-12-11 − |url-status = dead+ − 状态死机+ − }}</ref>+ − }}</ref> − {} / ref + + − == Overview ==+ − Definitions of complexity often depend on the concept of a "system" – a set of parts or elements that have relationships among them differentiated from relationships with other elements outside the relational regime. Many definitions tend to postulate or assume that complexity expresses a condition of numerous elements in a system and numerous forms of relationships among the elements. However, what one sees as complex and what one sees as simple is relative and changes with time. − 复杂性的定义往往取决于”系统”的概念，这是一组部件或要素，它们之间的关系不同于与关系制度之外的其他要素的关系。许多定义倾向于假设或假设复杂性表达了系统中众多元素的条件和元素之间众多形式的关系。然而，人们所认为的复杂和简单是相对的，并且随着时间的推移而变化。 + + − − Warren Weaver posited in 1948 two forms of complexity: disorganized complexity, and organized complexity.<ref name=Weaver>{{Cite journal − − 沃伦 · 韦弗在1948年假定了两种形式的复杂性: 无组织的复杂性和有组织的复杂性 − | last = Weaver+ − 最后一个韦弗+ − − | first = Warren − − 首先是沃伦 − − | title = Science and Complexity − − 科学与复杂性 − | journal = American Scientist+ − 美国科学家杂志+ − − | volume = 36 − − 第36卷 − − | pages = 536–44 − − 第536-44页 − − | year = 1948 − − 1948年 − − | url = http://people.physics.anu.edu.au/~tas110/Teaching/Lectures/L1/Material/WEAVER1947.pdf − − Http://people.physics.anu.edu.au/~tas110/teaching/lectures/l1/material/weaver1947.pdf − − | pmid = 18882675 − − 18882675 − − | issue = 4 − − 第四期 − − | accessdate = 2007-11-21}} − − [ accessdate 2007-11-21} − − </ref> − − / 参考 − − Phenomena of 'disorganized complexity' are treated using probability theory and statistical mechanics, while 'organized complexity' deals with phenomena that escape such approaches and confront "dealing simultaneously with a sizable number of factors which are interrelated into an organic whole". Weaver's 1948 paper has influenced subsequent thinking about complexity.<ref>{{cite book − − ‘无组织的复杂性’现象用概率论和统计力学来处理，而‘有组织的复杂性’处理逃避这种方法的现象，并且面对“同时处理相当数量的相关因素，这些因素相互关联，形成一个有机的整体”。韦弗1948年的论文影响了后来对复杂性的思考 − − | last = Johnson − − 最后的约翰逊 − − | first = Steven − − 首先是史蒂文 − − | title = Emergence: the connected lives of ants, brains, cities, and software − − 出现: 蚂蚁、大脑、城市和软件之间的联系 − | publisher = Scribner+ − 出版商 Scribner+ − − | year = 2001 − − 2001年 − − | page = [https://archive.org/details/emergenceconnect00john/page/46 46] − − [ https://archive.org/details/emergenceconnect00john/page/4646] − − | location = New York − − | 地点: 纽约 − | isbn = 978-0-684-86875-2+ − | isbn 978-0-684-86875-2+ − − | url = https://archive.org/details/emergenceconnect00john − − Https://archive.org/details/emergenceconnect00john − − | url-access = registration − − 访问注册 − − }} − − }} 第357行：
第221行： − </ref> − / 参考 + + − − The approaches that embody concepts of systems, multiple elements, multiple relational regimes, and state spaces might be summarized as implying that complexity arises from the number of distinguishable relational regimes (and their associated state spaces) in a defined system. − − 体现系统、多元素、多关系体系和状态空间概念的方法可以概括为: 复杂性来自于一个已定义系统中可区分的关系体系(及其相关的状态空间)的数量。 第373行：
第233行： − Some definitions relate to the algorithmic basis for the expression of a complex phenomenon or model or mathematical expression, as later set out herein.+ − 有些定义涉及表达复杂现象或模型或数学表达式的算法基础，如本文后面所述。+ 第383行：
第243行： − One of the problems in addressing complexity issues has been formalizing the intuitive conceptual distinction between the large number of variances in relationships extant in random collections, and the sometimes large, but smaller, number of relationships between elements in systems where constraints (related to correlation of otherwise independent elements) simultaneously reduce the variations from element independence and create distinguishable regimes of more-uniform, or correlated, relationships, or interactions.+ − 解决复杂性问题的一个问题是将随机集合中现存的大量关系变量与系统中有时较大但较小的元素之间的关系(与其他独立元素的相关性有关)同时减少了元素独立性的变量并创造了更加统一或相关的关系或相互作用的可区分的制度之间的直观概念区分形式化。+ − − Weaver perceived and addressed this problem, in at least a preliminary way, in drawing a distinction between "disorganized complexity" and "organized complexity". − − 在区分“无组织的复杂性”和“有组织的复杂性”时，编织者至少以一种初步的方式察觉并解决了这个问题。 第399行：
第255行： − In Weaver's view, disorganized complexity results from the particular system having a very large number of parts, say millions of parts, or many more. Though the interactions of the parts in a "disorganized complexity" situation can be seen as largely random, the properties of the system as a whole can be understood by using probability and statistical methods.+ − 在韦弗看来，无组织的复杂性是由于特定系统拥有非常多的部件，比如数百万个部件，或者更多。虽然在“无组织复杂性”的情况下各部分之间的相互作用可以看作是很大程度上的随机性，但系统作为一个整体的性质可以通过使用概率和统计方法来理解。+ 第407行：
第263行： − A prime example of disorganized complexity is a gas in a container, with the gas molecules as the parts. Some would suggest that a system of disorganized complexity may be compared with the (relative) simplicity of planetary orbits – the latter can be predicted by applying Newton's laws of motion. Of course, most real-world systems, including planetary orbits, eventually become theoretically unpredictable even using Newtonian dynamics; as discovered by modern chaos theory. − 无组织复杂性的一个典型例子是容器中的气体，以气体分子为部件。有些人认为，一个无组织的复杂系统可以与行星轨道的(相对)简单性相比较——后者可以通过应用牛顿运动定律来预测。当然，大多数真实世界的系统，包括行星轨道，最终在理论上变得不可预测，即使使用牛顿动力学; 正如现代混沌理论所发现的那样。 + + − Organized complexity, in Weaver's view, resides in nothing else than the non-random, or correlated, interaction between the parts. These correlated relationships create a differentiated structure that can, as a system, interact with other systems. The coordinated system manifests properties not carried or dictated by individual parts. The organized aspect of this form of complexity vis-a-vis to other systems than the subject system can be said to "emerge," without any "guiding hand". − 在 Weaver 看来，有组织的复杂性仅仅存在于各部分之间的非随机或相关的交互中。这些相互关联的关系创建了一个可以作为一个系统与其他系统交互的差异化结构。协调系统显示的属性不是由单个部分承载或支配的。这种形式的复杂性相对于主体系统以外的其他系统的有组织的方面可以说是“浮现” ，没有任何“指导手”。 + + − − The number of parts does not have to be very large for a particular system to have emergent properties. A system of organized complexity may be understood in its properties (behavior among the properties) through modeling and simulation, particularly modeling and simulation with computers. An example of organized complexity is a city neighborhood as a living mechanism, with the neighborhood people among the system's parts.<ref>{{cite book − − 对于一个具有涌现特性的特定系统来说，部件的数量不一定非常大。一个有组织的复杂系统可以通过建模与模拟来理解它的属性(属性之间的行为) ，特别是计算机的建模与模拟。有组织的复杂性的一个例子是一个城市邻里作为一个生活机制，与邻里的人在系统的部分。 文档{ cite book − | last = Jacobs+ − 最后的雅各布斯+ − − | first = Jane − − 先是简 − | title = The Death and Life of Great American Cities+ − 美国伟大城市的生与死+ − − | url = https://archive.org/details/deathlifeofgre00jaco − − Https://archive.org/details/deathlifeofgre00jaco − | url-access = registration+ − 访问注册+ − − | publisher = Random House − − 出版商兰登书屋 − | year = 1961+ − 1961年+ − − | location = New York }} − − | location New York } − </ref> − / 参考 + + − == Sources and factors ==+ − There are generally rules which can be invoked to explain the origin of complexity in a given system. − 通常有一些规则可以用来解释给定系统中复杂性的起源。 + + − The source of disorganized complexity is the large number of parts in the system of interest, and the lack of correlation between elements in the system.+ − The source of disorganized complexity is the large number of parts in the system of interest, and the lack of correlation between elements in the system. − 无组织复杂性的根源是感兴趣系统中的大量部件，以及系统中各要素之间缺乏相关性。 + + − In the case of self-organizing living systems, usefully organized complexity comes from beneficially mutated organisms being selected to survive by their environment for their differential reproductive ability or at least success over inanimate matter or less organized complex organisms. See e.g. Robert Ulanowicz's treatment of ecosystems. − 就自我组织的生命系统而言，有效组织的复杂性来自有益的突变生物体，它们被选择在其环境中生存，因为它们具有不同的生殖能力，或者至少在无生命物质或组织较少的复杂生物体上取得成功。参见。罗伯特·尤兰维奇对生态系统的处理。 + + − Complexity of an object or system is a relative property. For instance, for many functions (problems), such a computational complexity as time of computation is smaller when multitape [[Turing machine]]s are used than when Turing machines with one tape are used. [[Random Access Machine]]s allow one to even more decrease time complexity (Greenlaw and Hoover 1998: 226), while inductive Turing machines can decrease even the complexity class of a function, language or set (Burgin 2005). This shows that tools of activity can be an important factor of complexity.+ − Complexity of an object or system is a relative property. For instance, for many functions (problems), such a computational complexity as time of computation is smaller when multitape Turing machines are used than when Turing machines with one tape are used. Random Access Machines allow one to even more decrease time complexity (Greenlaw and Hoover 1998: 226), while inductive Turing machines can decrease even the complexity class of a function, language or set (Burgin 2005). This shows that tools of activity can be an important factor of complexity. − 对象或系统的复杂性是一个相对的属性。例如，对于许多函数(问题) ，使用多带图灵机比使用单带图灵机的计算复杂度更小。随机存取机器允许一个人甚至更多地降低时间复杂度(Greenlaw 和 Hoover 1998:226) ，而归纳图灵机甚至可以降低函数、语言或集合的复杂度等级(Burgin 2005)。这表明活动工具可以是复杂性的一个重要因素。 + + − == Varied meanings ==+ − In several scientific fields, "complexity" has a precise meaning: − 在一些科学领域，“复杂性”有着精确的含义: + + + + + + 第537行：
第377行： − + − |title=Thermodynamic depth of causal states: Objective complexity via minimal representations |journal=Physical Review E |volume=59 |issue=1 |pages=275–283+ − − 热力学深度的因果状态: 客观的复杂性通过最小的表述 | 杂志物理评论 e | 卷59 | 问题1 | 页275-283 − − − − |doi=10.1103/PhysRevE.59.275 |bibcode=1999PhRvE..59..275C }}</ref>. While the algorithmic complexity implies a deterministic description of an object (it measures the information content of an individual sequence), the statistical complexity, like forecasting complexity, implies a statistical description, and refers to an ensemble of sequences generated by a certain source. Formally, the statistical complexity reconstructs a minimal model comprising the collection of all histories sharing a similar probabilistic future, and measures the entropy of the probability distribution of the states within this model. It is a computable and observer-independent measure based only on the internal dynamics of the system, and has been used in studies of emergence and self-organization.<ref>{{cite journal − − | doi 10.1103 / PhysRevE. 59.275 | bibcode 1999PhRvE. . 59. . 275 c } / ref.虽然算法的复杂性意味着对一个对象的确定性描述(它测量单个序列的信息含量) ，但统计复杂性，如预测复杂性，意味着统计描述，并指的是由某个源生成的一组序列。在形式上，统计复杂性重构了一个最小模型，包括所有共享一个相似的概率未来的历史的集合，并且测量了这个模型中状态概率分布的熵。它是一个可计算的、独立于观测者的度量，仅仅基于系统的内部动力学，并且已经被用于涌现和自我组织的研究。 这是一个很好的例子 − − |last1=Prokopenko |first1=M. |last2=Boschetti |first2=F. |last3=Ryan |first3=A. |year=2009 |title=An information-theoretic primer on complexity, self-organisation and emergence |journal=Complexity |volume=15 |issue=1 |pages=11–28 |doi=10.1002/cplx.20249 |bibcode=2009Cmplx..15a..11P }}</ref> − − 1 m.2 Boschetti | first2 f.3瑞安。关于复杂性、自我组织和突现的信息理论入门 | 期刊复杂性 | 第15卷 | 第1页 | 第11-28页 | doi 10.1002 / cplx. 20249 | bibcode 2009Cmplx. 15 a. . 11 p } / ref 第568行：
第396行： − − Other fields introduce less precisely defined notions of complexity: − − 其他领域则引入了定义不那么精确的复杂性概念: 第594行：
第418行： − − Complexity has always been a part of our environment, and therefore many scientific fields have dealt with complex systems and phenomena. From one perspective, that which is somehow complex – displaying variation without being random – is most worthy of interest given the rewards found in the depths of exploration. − − 复杂性一直是我们环境的一部分，因此许多科学领域都涉及到复杂的系统和现象。从一个角度来看，这是某种复杂的-显示变化而不是随机的-是最值得关注的，因为在深度探索中发现的回报。 − − The use of the term complex is often confused with the term complicated. In today's systems, this is the difference between myriad connecting "stovepipes" and effective "integrated" solutions.<ref>Lissack, Michael R.; Johan Roos (2000). The Next Common Sense, The e-Manager's Guide to Mastering Complexity. Intercultural Press. . − − 术语复杂的使用经常与术语复杂混淆。在今天的系统中，这就是无数连接“烟囱管”和有效的“集成”解决方案之间的区别。下一个常识，电子管理者掌握复杂性指南。跨文化新闻。. − − </ref> This means that complex is the opposite of independent, while complicated is the opposite of simple. − − / ref 这意味着复杂是独立的对立面，而复杂是简单的对立面。 − − While this has led some fields to come up with specific definitions of complexity, there is a more recent movement to regroup observations from different fields to study complexity in itself, whether it appears in anthills, human brains, or stock markets, social systems. One such interdisciplinary group of fields is relational order theories. − − 虽然这已经导致一些领域提出了复杂性的具体定义，但是最近有一种运动重新组合来自不同领域的观察结果来研究复杂性本身，无论它是出现在蚁丘、人类大脑，还是股票市场、社会系统。其中一个跨学科的领域就是关系秩序理论。 第630行：
第438行： − − The behavior of a complex system is often said to be due to emergence and self-organization. Chaos theory has investigated the sensitivity of systems to variations in initial conditions as one cause of complex behaviour. − − 一个复杂系统的行为通常被认为是由于涌现和自我组织。混沌理论已经研究了系统对初始条件变化的敏感性作为复杂行为的原因之一。 第640行：
第444行： − − Recent developments around artificial life, evolutionary computation and genetic algorithms have led to an increasing emphasis on complexity and complex adaptive systems. − − 最近围绕人工生命、进化计算和遗传算法的发展使人们越来越重视复杂性和复杂适应系统。 − − − − === Simulations === − − In [[social science]], the study on the emergence of macro-properties from the micro-properties, also known as macro-micro view in [[sociology]]. The topic is commonly recognized as [[social complexity]] that is often related to the use of computer simulation in social science, i.e.: [[computational sociology]]. − − In social science, the study on the emergence of macro-properties from the micro-properties, also known as macro-micro view in sociology. The topic is commonly recognized as social complexity that is often related to the use of computer simulation in social science, i.e.: computational sociology. − − 在社会科学中，研究宏观属性的出现是从微观属性出发的，在社会学中又称为宏观-微观视角。这个话题通常被认为是社会复杂性，常常与社会科学中计算机模拟的使用有关，例如。计算社会学。 − − − − === Systems === − − {{main article|Complex system}} − − [[Systems theory]] has long been concerned with the study of [[complex system]]s (in recent times, ''complexity theory'' and ''complex systems'' have also been used as names of the field). These systems are present in the research of a variety disciplines, including [[biology]], [[economics]], social studies and [[technology]]. Recently, complexity has become a natural domain of interest of real world socio-cognitive systems and emerging [[systemics]] research. Complex systems tend to be high-[[dimension]]al, [[non-linearity|non-linear]], and difficult to model. In specific circumstances, they may exhibit low-dimensional behaviour. − − Systems theory has long been concerned with the study of complex systems (in recent times, complexity theory and complex systems have also been used as names of the field). These systems are present in the research of a variety disciplines, including biology, economics, social studies and technology. Recently, complexity has become a natural domain of interest of real world socio-cognitive systems and emerging systemics research. Complex systems tend to be high-dimensional, non-linear, and difficult to model. In specific circumstances, they may exhibit low-dimensional behaviour. − − 系统理论长期以来一直关注复杂系统的研究(近年来，复杂性理论和复杂系统也被用作该领域的名称)。这些系统存在于各种学科的研究中，包括生物学、经济学、社会研究和技术。近年来，复杂性已经成为现实世界社会认知系统和新兴系统学研究的一个自然领域。复杂系统往往是高维的、非线性的、难以建模的。在特定情况下，他们可能表现出低维度的行为。 − − − − === Data === − − In [[information theory]], algorithmic information theory is concerned with the complexity of strings of data. − − In information theory, algorithmic information theory is concerned with the complexity of strings of data. − − 在信息论中，算法信息论关注的是数据串的复杂性。 − − − − Complex strings are harder to compress. While intuition tells us that this may depend on the [[codec]] used to compress a string (a codec could be theoretically created in any arbitrary language, including one in which the very small command "X" could cause the computer to output a very complicated string like "18995316"), any two [[Turing completeness|Turing-complete]] languages can be implemented in each other, meaning that the length of two encodings in different languages will vary by at most the length of the "translation" language – which will end up being negligible for sufficiently large data strings. − − Complex strings are harder to compress. While intuition tells us that this may depend on the codec used to compress a string (a codec could be theoretically created in any arbitrary language, including one in which the very small command "X" could cause the computer to output a very complicated string like "18995316"), any two Turing-complete languages can be implemented in each other, meaning that the length of two encodings in different languages will vary by at most the length of the "translation" language – which will end up being negligible for sufficiently large data strings. − − 复杂的字符串更难压缩。直觉告诉我们，这可能取决于用于压缩字符串的编解码器(编解码器理论上可以在任何语言中创建，包括一个非常小的命令“ x”可以使计算机输出一个非常复杂的字符串，比如“18995316”) ，但是任何两种图灵完整语言都可以在彼此中实现，这意味着不同语言中两种编码器的长度最多只会随着“翻译”语言的长度而变化，这对于足够大数据字符串来说可以忽略不计。 − − − − These algorithmic measures of complexity tend to assign high values to [[signal noise|random noise]]. However, those studying complex systems would not consider randomness as complexity{{who|date=October 2013}}. − − These algorithmic measures of complexity tend to assign high values to random noise. However, those studying complex systems would not consider randomness as complexity. − − 这些复杂度的算法测量倾向于给随机噪声赋予较高的值。然而，那些研究复杂系统的人并不认为随机性就是复杂性。 − − − − [[Information entropy]] is also sometimes used in information theory as indicative of complexity, but entropy is also high for randomness. [[Information fluctuation complexity]], fluctuations of information about entropy, does not consider randomness to be complex and has been useful in many applications. − − Information entropy is also sometimes used in information theory as indicative of complexity, but entropy is also high for randomness. Information fluctuation complexity, fluctuations of information about entropy, does not consider randomness to be complex and has been useful in many applications. − − 在信息论中，熵也有时被用来表示复杂性，但熵的随机性也很高。信息波动的复杂性，熵信息的波动性，不考虑随机性的复杂性，已经在许多应用中得到应用。 − − − − Recent work in [[machine learning]] has examined the complexity of the data as it affects the performance of [[Supervised learning|supervised]] classification algorithms. Ho and Basu present a set of [[Computational complexity theory|complexity measures]] for [[binary classification]] problems.<ref>Ho, T.K.; Basu, M. (2002). "[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=990132&tag=1 Complexity Measures of Supervised Classification Problems]". IEEE Transactions on Pattern Analysis and Machine Intelligence 24 (3), pp 289–300.</ref> − − Recent work in machine learning has examined the complexity of the data as it affects the performance of supervised classification algorithms. Ho and Basu present a set of complexity measures for binary classification problems. − − 最近机器学习的工作已经检查了数据的复杂性，因为它影响了监督分类算法的性能。Ho 和 Basu 为二分类问题提出了一套复杂度量方法。 − − − − The complexity measures broadly cover: − − The complexity measures broadly cover: − − 复杂性指标大致涵盖: − − * the overlaps in feature values from differing classes. − − * the separability of the classes. − − * measures of geometry, topology, and density of [[manifold]]s. Instance hardness is another approach seeks to characterize the data complexity with the goal of determining how hard a data set is to classify correctly and is not limited to binary problems.<ref>Smith, M.R.; Martinez, T.; Giraud-Carrier, C. (2014). "[https://link.springer.com/article/10.1007%2Fs10994-013-5422-z An Instance Level Analysis of Data Complexity]". Machine Learning, 95(2): 225–256.</ref> − − Instance hardness is a bottom-up approach that first seeks to identify instances that are likely to be misclassified (or, in other words, which instances are the most complex). The characteristics of the instances that are likely to be misclassified are then measured based on the output from a set of hardness measures. The hardness measures are based on several supervised learning techniques such as measuring the number of disagreeing neighbors or the likelihood of the assigned class label given the input features. The information provided by the complexity measures has been examined for use in [[Meta learning (computer science)|meta learning]] to determine for which data sets filtering (or removing suspected noisy instances from the training set) is the most beneficial<ref>{{cite journal|title= Predicting Noise Filtering Efficacy with Data Complexity Measures for Nearest Neighbor Classification|journal= Pattern Recognition|volume= 46|pages= 355–364|doi= 10.1016/j.patcog.2012.07.009|year= 2013|last1= Sáez|first1= José A.|last2= Luengo|first2= Julián|last3= Herrera|first3= Francisco}}</ref> and could be expanded to other areas. − − Instance hardness is a bottom-up approach that first seeks to identify instances that are likely to be misclassified (or, in other words, which instances are the most complex). The characteristics of the instances that are likely to be misclassified are then measured based on the output from a set of hardness measures. The hardness measures are based on several supervised learning techniques such as measuring the number of disagreeing neighbors or the likelihood of the assigned class label given the input features. The information provided by the complexity measures has been examined for use in meta learning to determine for which data sets filtering (or removing suspected noisy instances from the training set) is the most beneficial and could be expanded to other areas. − − 实例硬度是一种自下而上的方法，它首先寻求识别可能被错误分类的实例(或者，换句话说，哪些实例是最复杂的)。然后，可能被错误分类的实例的特征根据一组硬度测量值的输出进行测量。硬度测量是基于一些监督式学习技术，如测量不同意的邻居的数量或分配给输入功能的类标签的可能性。复杂性度量提供的信息已经被用于元学习，以确定哪些数据集过滤(或者从训练集中去除可疑的噪音实例)是最有益的，并且可以扩展到其他领域。 − − − − === In molecular recognition === − − A recent study based on molecular simulations and compliance constants describes [[molecular recognition]] as a phenomenon of organisation.<ref>{{cite journal | title=Complexity in molecular recognition | author=Jorg Grunenberg | journal=Phys. Chem. Chem. Phys. | year=2011 | volume=13 | issue=21 | pages= 10136–10146 | doi=10.1039/c1cp20097f| pmid=21503359 | bibcode=2011PCCP...1310136G }}</ref> − − A recent study based on molecular simulations and compliance constants describes molecular recognition as a phenomenon of organisation. − − 最近一项基于分子模拟和顺应常数的研究将分子识别描述为一种组织现象。 − − Even for small molecules like [[carbohydrates]], the recognition process can not be predicted or designed even assuming that each individual [[hydrogen bond]]'s strength is exactly known. − − Even for small molecules like carbohydrates, the recognition process can not be predicted or designed even assuming that each individual hydrogen bond's strength is exactly known. − − 即使是像碳水化合物这样的小分子，识别过程也不能被预测或设计，即使假设每个单独的氢键的强度是确切知道的。 − − − − == Applications == − − Computational complexity theory is the study of the complexity of problems – that is, the difficulty of [[problem solving|solving]] them. Problems can be classified by complexity class according to the time it takes for an algorithm – usually a computer program – to solve them as a function of the problem size. Some problems are difficult to solve, while others are easy. For example, some difficult problems need algorithms that take an exponential amount of time in terms of the size of the problem to solve. Take the [[travelling salesman problem]], for example. It can be solved in time <math>O(n^2 2^n)</math> (where ''n'' is the size of the network to visit – the number of cities the travelling salesman must visit exactly once). As the size of the network of cities grows, the time needed to find the route grows (more than) exponentially. − − Computational complexity theory is the study of the complexity of problems – that is, the difficulty of solving them. Problems can be classified by complexity class according to the time it takes for an algorithm – usually a computer program – to solve them as a function of the problem size. Some problems are difficult to solve, while others are easy. For example, some difficult problems need algorithms that take an exponential amount of time in terms of the size of the problem to solve. Take the travelling salesman problem, for example. It can be solved in time <math>O(n^2 2^n)</math> (where n is the size of the network to visit – the number of cities the travelling salesman must visit exactly once). As the size of the network of cities grows, the time needed to find the route grows (more than) exponentially. − − 计算复杂性理论是研究问题的复杂性，也就是解决问题的难度。问题可以根据算法(通常是计算机程序)解决问题所需的时间(作为问题大小的函数)按复杂程度分类。有些问题很难解决，而有些则很容易。例如，一些困难的问题需要算法花费指数量的时间来解决问题的大小。以旅行推销员问题为例。这个问题可以用时间数学 o (n ^ 2 ^ n) / math (其中 n 是要访问的网络的大小-货郎担必须访问一次的城市数)来解决。随着城市网络规模的扩大，寻找路线所需的时间呈指数增长(超过倍)。 − − − − Even though a problem may be computationally solvable in principle, in actual practice it may not be that simple. These problems might require large amounts of time or an inordinate amount of space. [[Analysis of algorithms|Computational complexity]] may be approached from many different aspects. Computational complexity can be investigated on the basis of time, memory or other resources used to solve the problem. Time and space are two of the most important and popular considerations when problems of complexity are analyzed. − − Even though a problem may be computationally solvable in principle, in actual practice it may not be that simple. These problems might require large amounts of time or an inordinate amount of space. Computational complexity may be approached from many different aspects. Computational complexity can be investigated on the basis of time, memory or other resources used to solve the problem. Time and space are two of the most important and popular considerations when problems of complexity are analyzed. − − 即使一个问题在原则上是可以计算解决的，但在实际操作中可能没有那么简单。这些问题可能需要大量的时间或过多的空间。计算复杂性可以从许多不同的方面来研究。计算复杂性可以根据时间，内存或其他资源来解决问题。在分析复杂性问题时，时间和空间是两个最重要和最普遍的考虑因素。 − − − − There exist a certain class of problems that although they are solvable in principle they require so much time or space that it is not practical to attempt to solve them. These problems are called [[Computational complexity theory#Intractability|intractable]]. − − There exist a certain class of problems that although they are solvable in principle they require so much time or space that it is not practical to attempt to solve them. These problems are called intractable. − − 有一类问题，虽然原则上是可以解决的，但它们需要很多时间或空间，因此试图解决它们是不切实际的。这些问题被称为棘手的。 − − − − There is another form of complexity called [[Model of hierarchical complexity|hierarchical complexity]]. It is orthogonal to the forms of complexity discussed so far, which are called horizontal complexity. − − There is another form of complexity called hierarchical complexity. It is orthogonal to the forms of complexity discussed so far, which are called horizontal complexity. − − 还有另一种形式的复杂性称为等级复杂性。它与迄今为止所讨论的复杂性的形式是正交的，即所谓的横向复杂性。 − − − − == See also == − − {{Div col|colwidth=18em}} − − * [[Chaos theory]] − − * [[Complexity theory (disambiguation)|Complexity theory]] (disambiguation page) − − * [[Cyclomatic complexity]] − − * [[Digital morphogenesis]] − − * [[Dual-phase evolution]] − − * [[Emergence]] − − * [[Evolution of complexity]] − − * [[Game complexity]] − − * [[Holism in science]] − − * [[Law of Complexity/Consciousness]] − − * [[Model of hierarchical complexity]] − − * [[Names of large numbers]] − − * [[Network science]] − − * [[Network theory]] − − * [[Novelty theory]] − − * [[Occam's razor]] − − * [[Process architecture]] − − * [[Programming Complexity]] − − * [[Sociology and complexity science]] − − * [[Systems theory]] − − * [[Thorngate's postulate of commensurate complexity]] − − * [[Variety (cybernetics)]] − − * [[Volatility, uncertainty, complexity and ambiguity]] − − * [[Computational irreducibility]] − − *[[Zero-Force Evolutionary Law]] − − {{Div col end}} − − − − == References == − − {{reflist}} − − − − == Further reading == − − {{refbegin}} − − * {{cite journal − | last = Chu+ − 最后朱丽叶 − | first = Dominique − 第一个多米尼克+ − | title = Complexity: Against Systems+ − + − | journal = Theory in Biosciences+ 第875行：
第467行： − | volume = 130+ − 第130卷+ − | issue = 3+ 第887行：
第479行： − | pages = 229–45+ − 第229-45页+ − | year = 2011+ + + − | pmid =21287293 | doi = 10.1007/s12064-011-0121-4+ + + − 21287293 | doi 10.1007 / s12064-011-0121-4+ − | url = http://kar.kent.ac.uk/30776/1/againstSystems.pdf+ − | url = http://kar.kent.ac.uk/30776/1/againstSystems.pdf+ + + + + 第915行：
第515行： − }}+ + − * {{cite book − | last = Waldrop+ − 最后一个 Waldrop+ − | first = M. Mitchell+ + − 第一个 m. Mitchell − | authorlink = + − 作者链接+ − | title = Complexity: The Emerging Science at the Edge of Order and Chaos+ − 复杂性: 处于秩序与混乱边缘的新兴科学 − | location = New York + + − | publisher = Simon & Schuster+ − 出版商西蒙与舒斯特 − | year = 1992 第961行：
第559行： − | isbn = 978-0-671-76789-1+ − [国际标准图书馆编号978-0-671-76789-1]+ − | url = https://archive.org/details/complexityemergi00wald+ + + 第977行：
第577行： − }}+ − * {{cite book+ − | last = Czerwinski+ − 最后的捷尔温斯基 − | first = Tom − 先是汤姆+ − |author2=David Alberts+ − 作者: David Alberts+ − | title = Complexity, Global Politics, and National Security+ − 文章标题复杂性，全球政治和国家安全+ − | url = http://www.dodccrp.org/files/Alberts_Complexity_Global.pdf+ 第1,011行：
第609行： − | publisher = National Defense University+ − 出版商: 国防大学+ − | year = 1997+ + + − | isbn = 978-1-57906-046-6 }}+ + − | isbn 978-1-57906-046-6} − * {{cite book+ 第1,035行：
第635行： − | last = Solé+ − | first = R. V.+ − 第一个 r. v。+ − |author2=B. C. Goodwin+ + − 2 b.C. 古德温 − | title = Signs of Life: How Complexity Pervades Biology+ − 生命的迹象: 复杂性如何渗透生物学+ − | publisher = Basic Books+ − | 出版商 Basic Books − | year = 2002 第1,067行：
第665行： − | isbn = 978-0-465-01928-1 }}+ − + − * {{Cite book+ − | first = Francis+ − 先是弗朗西斯+ − | last =[[Francis Heylighen|Heylighen]]+ − 最后一个 Heylighen+ − | editor-last = Bates+ − 最后一个贝茨+ − | editor-first = Marcia J.+ − + − | editor2-last = Maack+ − | 编辑2-last Maack+ − | editor2-first = Mary Niles+ − + − | contribution = Complexity and Self-Organization+ − + − | contribution-url = http://pespmc1.vub.ac.be/Papers/ELIS-Complexity.pdf+ − + − | title = Encyclopedia of Library and Information Sciences+ 第1,129行：
第727行： − | year = 2008+ 第1,135行：
第733行： − | publisher = CRC+ − + − | isbn = 978-0-8493-9712-7+ − [国际标准图书编号978-0-8493-9712-7]+ − }}+ 第1,153行：
第751行： − + − + − + − + − {{refend}}+ + + − == External links ==+ − {{wikiquote}}+ − {{Wiktionary}}+ − + − + − * [http://www.santafe.edu/ Santa Fe Institute] focusing on the study of complexity science: [https://web.archive.org/web/20110304121331/http://www.santafe.edu/research/videos/catalog/ Lecture Videos]+ − * [https://web.archive.org/web/20061009004757/http://eclectic.ss.uci.edu/~drwhite/center/cac.html UC Four Campus Complexity Videoconferences] – Human Sciences and Complexity + − + − {{Authority control}}+ − + − − [[Category:Abstraction]] 第1,195行：
第793行： − [[Category:Chaos theory]]+ 第1,201行：
第799行： − [[Category:Complex systems theory]]+ 第1,207行：
第805行： − [[Category:Holism]]+ 第1,213行：
第811行： − [[Category:Systems]]+ 第1,219行：
第817行： − [[Category:Transdisciplinarity]]+
Moved page from wikipedia:en:Complexity (history)
此词条暂由彩云小译翻译，翻译字数共2038，未经人工整理和审校，带来阅读不便，请见谅。
{{short description|Properties of systems that cannot be simply described or modeled}}
{{short description|Properties of systems that cannot be simply described or modeled}}
'''Complexity''' characterises the behaviour of a [[system]] or [[model (disambiguation)|model]] whose components interact in multiple ways and follow local rules, meaning there is no reasonable higher instruction to define the various possible interactions.<ref name="steven">{{cite book
'''Complexity''' characterises the behaviour of a [[system]] or [[model (disambiguation)|model]] whose components [[interaction|interact]] in multiple ways and follow local rules, meaning there is no reasonable higher instruction to define the various possible interactions.<ref name="steven">{{cite book
Complexity characterises the behaviour of a system or model whose components interact in multiple ways and follow local rules, meaning there is no reasonable higher instruction to define the various possible interactions.<ref name="steven">{{cite book
Complexity characterises the behaviour of a system or model whose components interact in multiple ways and follow local rules, meaning there is no reasonable higher instruction to define the various possible interactions.
复杂性描述了一个系统或模型的行为，其组件以多种方式交互并遵循局部规则，这意味着没有合理的更高指令来定义各种可能的交互。 文件名“ steven { cite book”
复杂性描述了一个系统或模型的行为，其组件以多种方式交互并遵循局部规则，这意味着没有合理的更高指令来定义各种可能的交互。
| last = Johnson
| last = Johnson
| first = Steven
| first = Steven
The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of emergence greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of complex systems theory.
这个术语通常用来描述具有许多部分的事物，其中这些部分以多种方式相互作用，最终以大于其各部分之和的更高级别出现。在不同尺度上研究这些复杂的连杆机构是复杂系统理论的主要目标。
| title = Emergence: The Connected Lives of Ants, Brains, Cities
| title = Emergence: The Connected Lives of Ants, Brains, Cities
| publisher = Scribner
| publisher = Scribner
Science takes a number of approaches to characterizing complexity; Zayed et al.
科学需要许多方法来描述复杂性; 扎耶德等人。
| year = 2001
| year = 2001
reflect many of these. Neil Johnson states that "even among scientists, there is no unique definition of complexity – and the scientific notion has traditionally been conveyed using particular examples..." Ultimately Johnson adopts the definition of "complexity science" as "the study of the phenomena which emerge from a collection of interacting objects".
反映了很多这样的事情。Neil Johnson 指出，”即使在科学家中，也没有关于复杂性的独特定义——传统上，科学概念是通过特定的例子传达的... ... ”最终，Johnson 采用了”复杂性科学”的定义，即”研究从一系列相互作用的物体中产生的现象”。
| location = New York
| location = New York
| url = https://books.google.com/books?id=Au_tLkCwExQC
| url = https://books.google.com/books?id=Au_tLkCwExQC
| page = 19
| page = 19
Definitions of complexity often depend on the concept of a "system" – a set of parts or elements that have relationships among them differentiated from relationships with other elements outside the relational regime. Many definitions tend to postulate or assume that complexity expresses a condition of numerous elements in a system and numerous forms of relationships among the elements. However, what one sees as complex and what one sees as simple is relative and changes with time.
复杂性的定义往往取决于”系统”的概念，即一系列部分或要素之间的关系有别于与关系制度之外的其他要素的关系。许多定义倾向于假设或假设复杂性表达了系统中众多元素的条件和元素之间众多形式的关系。然而，人们所认为的复杂和简单是相对的，并且随着时间的推移而变化。
| isbn = 978-3411040742}}
| isbn = 978-3411040742}}
</ref>
Warren Weaver posited in 1948 two forms of complexity: disorganized complexity, and organized complexity.
沃伦 · 韦弗在1948年提出了复杂性的两种形式: 无组织的复杂性和有组织的复杂性。
Phenomena of 'disorganized complexity' are treated using probability theory and statistical mechanics, while 'organized complexity' deals with phenomena that escape such approaches and confront "dealing simultaneously with a sizable number of factors which are interrelated into an organic whole".
‘无组织的复杂性’现象用概率论和统计力学来处理，而‘有组织的复杂性’处理逃避这种方法的现象，并且面对“同时处理相当数量的相关因素，这些因素相互关联，形成一个有机的整体”。
The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of [[emergence]] greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of [[complex systems theory]].
The term is generally used to characterize something with many parts where those parts interact with each other in multiple ways, culminating in a higher order of [[emergence]] greater than the sum of its parts. The study of these complex linkages at various scales is the main goal of [[complex systems theory]].
The approaches that embody concepts of systems, multiple elements, multiple relational regimes, and state spaces might be summarized as implying that complexity arises from the number of distinguishable relational regimes (and their associated state spaces) in a defined system.
体现系统、多元素、多关系体系和状态空间概念的方法可以概括为: 复杂性来自于一个已定义系统中可区分的关系体系(及其相关的状态空间)的数量。
[[Science]] {{as of | 2010 | lc = on}} takes a number of approaches to characterizing complexity; Zayed ''et al.''<ref>
[[Science]] {{as of | 2010 | lc = on}} takes a number of approaches to characterizing complexity; Zayed ''et al.''<ref>
J. M. Zayed, N. Nouvel, U. Rauwald, O. A. Scherman. ''Chemical Complexity – supramolecular self-assembly of synthetic and biological building blocks in water''. Chemical Society Reviews, 2010, 39, 2806–2816 http://pubs.rsc.org/en/Content/ArticleLanding/2010/CS/b922348g
J. M. Zayed, N. Nouvel, U. Rauwald, O. A. Scherman. ''Chemical Complexity – supramolecular self-assembly of synthetic and biological building blocks in water''. Chemical Society Reviews, 2010, 39, 2806–2816 http://pubs.rsc.org/en/Content/ArticleLanding/2010/CS/b922348g
Some definitions relate to the algorithmic basis for the expression of a complex phenomenon or model or mathematical expression, as later set out herein.
有些定义涉及表达复杂现象或模型或数学表达式的算法基础，如本文后面所述。
</ref>
</ref>
reflect many of these. [[Neil F. Johnson|Neil Johnson]] states that "even among scientists, there is no unique definition of complexity – and the scientific notion has traditionally been conveyed using particular examples..." Ultimately Johnson adopts the definition of "complexity science" as "the study of the phenomena which emerge from a collection of interacting objects".<ref name="Neil Johnson">{{cite book
reflect many of these. [[Neil F. Johnson|Neil Johnson]] states that "even among scientists, there is no unique definition of complexity – and the scientific notion has traditionally been conveyed using particular examples..." Ultimately Johnson adopts the definition of "complexity science" as "the study of the phenomena which emerge from a collection of interacting objects".<ref name="Neil Johnson">{{cite book
|last = Johnson
|last = Johnson
One of the problems in addressing complexity issues has been formalizing the intuitive conceptual distinction between the large number of variances in relationships extant in random collections, and the sometimes large, but smaller, number of relationships between elements in systems where constraints (related to correlation of otherwise independent elements) simultaneously reduce the variations from element independence and create distinguishable regimes of more-uniform, or correlated, relationships, or interactions.
解决复杂性问题的一个问题是将随机集合中现存的大量关系变量与系统中有时较大但较小的元素之间的关系(与其他独立元素的相关性有关)同时减少了元素独立性的变量，并创造了更加统一或相关的关系或相互作用的可区分的制度之间的直观概念区分形式化。
|first = Neil F.
|first = Neil F.
|title = Simply complexity: A clear guide to complexity theory
|title = Simply complexity: A clear guide to complexity theory
Weaver perceived and addressed this problem, in at least a preliminary way, in drawing a distinction between "disorganized complexity" and "organized complexity".
在区分“无组织的复杂性”和“有组织的复杂性”时，编织者至少以一种初步的方式察觉并解决了这个问题。
|publisher = Oneworld Publications
|publisher = Oneworld Publications
|year = 2009
|year = 2009
In Weaver's view, disorganized complexity results from the particular system having a very large number of parts, say millions of parts, or many more. Though the interactions of the parts in a "disorganized complexity" situation can be seen as largely random, the properties of the system as a whole can be understood by using probability and statistical methods.
在韦弗看来，无组织的复杂性是由于特定系统具有非常多的部件，比如数百万个部件，或者更多。虽然在“无组织复杂性”的情况下，各部分之间的相互作用可以看作是很大程度上的随机性，但是系统作为一个整体的性质可以通过使用概率和统计方法来理解。
|chapter = Chapter 1: Two's company, three is complexity
|chapter = Chapter 1: Two's company, three is complexity
|page = 3
|page = 3
A prime example of disorganized complexity is a gas in a container, with the gas molecules as the parts. Some would suggest that a system of disorganized complexity may be compared with the (relative) simplicity of planetary orbits – the latter can be predicted by applying Newton's laws of motion. Of course, most real-world systems, including planetary orbits, eventually become theoretically unpredictable even using Newtonian dynamics; as discovered by modern chaos theory.
无组织复杂性的一个典型例子是一个容器中的气体，以气体分子为部件。有些人认为，一个无组织的复杂系统可以与行星轨道的(相对)简单性相比较——后者可以通过应用牛顿运动定律来预测。当然，大多数真实世界的系统，包括行星轨道，最终在理论上变得不可预测，即使使用牛顿动力学; 正如现代混沌理论所发现的那样。
|chapter-url = http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf
|chapter-url = http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf
|isbn = 978-1780740492
|isbn = 978-1780740492
Organized complexity, in Weaver's view, resides in nothing else than the non-random, or correlated, interaction between the parts. These correlated relationships create a differentiated structure that can, as a system, interact with other systems. The coordinated system manifests properties not carried or dictated by individual parts. The organized aspect of this form of complexity vis-a-vis to other systems than the subject system can be said to "emerge," without any "guiding hand".
在 Weaver 看来，有组织的复杂性仅仅存在于各部分之间的非随机或相关的交互中。这些相互关联的关系创建了一个可以作为一个系统与其他系统交互的差异化结构。协调系统显示的属性不是由单个部分承载或支配的。这种形式的复杂性相对于主体系统以外的其他系统的有组织的方面可以说是“浮现” ，没有任何“指导手”。
|access-date = 2013-06-29
|access-date = 2013-06-29
|archive-url = https://web.archive.org/web/20151211064454/http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf
|archive-url = https://web.archive.org/web/20151211064454/http://www.uvm.edu/rsenr/nr385se/readings/complexity.pdf
The number of parts does not have to be very large for a particular system to have emergent properties. A system of organized complexity may be understood in its properties (behavior among the properties) through modeling and simulation, particularly modeling and simulation with computers. An example of organized complexity is a city neighborhood as a living mechanism, with the neighborhood people among the system's parts.
对于一个具有涌现特性的特定系统来说，部件的数量不一定非常大。一个有组织的复杂系统可以从它的属性(属性之间的行为)来理解，通过建模与模拟，特别是计算机的建模与模拟。有组织的复杂性的一个例子是一个城市邻里作为一个生活机制，与邻里的人在系统的部分。
|archive-date = 2015-12-11
|archive-date = 2015-12-11
|url-status = dead
|url-status = dead
}}</ref>
There are generally rules which can be invoked to explain the origin of complexity in a given system.
通常有一些规则可以用来解释给定系统中复杂性的起源。
== Overview ==
The source of disorganized complexity is the large number of parts in the system of interest, and the lack of correlation between elements in the system.
无组织复杂性的根源是感兴趣系统中的大量部件，以及系统中各要素之间缺乏相关性。
Definitions of complexity often depend on the concept of a "[[system]]" – a set of parts or elements that have relationships among them differentiated from relationships with other elements outside the relational regime. Many definitions tend to postulate or assume that complexity expresses a condition of numerous elements in a system and numerous forms of relationships among the elements. However, what one sees as complex and what one sees as simple is relative and changes with time.
Definitions of complexity often depend on the concept of a "[[system]]" – a set of parts or elements that have relationships among them differentiated from relationships with other elements outside the relational regime. Many definitions tend to postulate or assume that complexity expresses a condition of numerous elements in a system and numerous forms of relationships among the elements. However, what one sees as complex and what one sees as simple is relative and changes with time.
In the case of self-organizing living systems, usefully organized complexity comes from beneficially mutated organisms being selected to survive by their environment for their differential reproductive ability or at least success over inanimate matter or less organized complex organisms. See e.g. Robert Ulanowicz's treatment of ecosystems.
就自我组织的生命系统而言，有效组织的复杂性来自于有益的突变生物体，它们被选择在其环境中生存，因为它们具有不同的生殖能力，或者至少在无生命物质或组织较少的复杂生物体上取得成功。参见。罗伯特·尤兰维奇对生态系统的处理。
[[Warren Weaver]] posited in 1948 two forms of complexity: disorganized complexity, and organized complexity.<ref name=Weaver>{{Cite journal
[[Warren Weaver]] posited in 1948 two forms of complexity: disorganized complexity, and organized complexity.<ref name=Weaver>{{Cite journal
| last = Weaver
| last = Weaver
Complexity of an object or system is a relative property. For instance, for many functions (problems), such a computational complexity as time of computation is smaller when multitape Turing machines are used than when Turing machines with one tape are used. Random Access Machines allow one to even more decrease time complexity (Greenlaw and Hoover 1998: 226), while inductive Turing machines can decrease even the complexity class of a function, language or set (Burgin 2005). This shows that tools of activity can be an important factor of complexity.
对象或系统的复杂性是一个相对的属性。例如，对于许多函数(问题)来说，使用多带图灵机比使用单带图灵机的计算复杂度要小。随机存取机器允许一个人甚至更多地降低时间复杂度(Greenlaw 和 Hoover 1998:226) ，而归纳图灵机甚至可以降低函数、语言或集合的复杂度等级(Burgin 2005)。这表明活动工具可以是复杂性的一个重要因素。
| first = Warren
| first = Warren
| title = Science and Complexity
| title = Science and Complexity
| journal = American Scientist
| journal = American Scientist
In several scientific fields, "complexity" has a precise meaning:
在一些科学领域，“复杂性”有着精确的含义:
| volume = 36
| volume = 36
| pages = 536–44
| pages = 536–44
| year = 1948
| year = 1948
| url = http://people.physics.anu.edu.au/~tas110/Teaching/Lectures/L1/Material/WEAVER1947.pdf
| url = http://people.physics.anu.edu.au/~tas110/Teaching/Lectures/L1/Material/WEAVER1947.pdf
| pmid = 18882675
| pmid = 18882675
| issue = 4
| issue = 4
| accessdate = 2007-11-21}}
| accessdate = 2007-11-21}}
</ref>
</ref>
Phenomena of 'disorganized complexity' are treated using probability theory and statistical mechanics, while 'organized complexity' deals with phenomena that escape such approaches and confront "dealing simultaneously with a sizable number of factors which are interrelated into an organic whole".<ref name=Weaver/> Weaver's 1948 paper has influenced subsequent thinking about complexity.<ref>{{cite book
Phenomena of 'disorganized complexity' are treated using probability theory and statistical mechanics, while 'organized complexity' deals with phenomena that escape such approaches and confront "dealing simultaneously with a sizable number of factors which are interrelated into an organic whole".<ref name=Weaver/> Weaver's 1948 paper has influenced subsequent thinking about complexity.<ref>{{cite book
| last = Johnson
| last = Johnson
| first = Steven
| first = Steven
| title = Emergence: the connected lives of ants, brains, cities, and software
| title = Emergence: the connected lives of ants, brains, cities, and software
| publisher = Scribner
| publisher = Scribner
Other fields introduce less precisely defined notions of complexity:
其他领域则引入了定义不那么精确的复杂性概念:
| year = 2001
| year = 2001
| page = [https://archive.org/details/emergenceconnect00john/page/46 46]
| page = [https://archive.org/details/emergenceconnect00john/page/46 46]
| location = New York
| location = New York
| isbn = 978-0-684-86875-2
| isbn = 978-0-684-86875-2
While this has led some fields to come up with specific definitions of complexity, there is a more recent movement to regroup observations from different fields to study complexity in itself, whether it appears in anthills, human brains, or stock markets, social systems. One such interdisciplinary group of fields is relational order theories.
虽然这已经导致一些领域提出了复杂性的具体定义，但是最近有一种运动重新组合来自不同领域的观察结果来研究复杂性本身，无论它是出现在蚁丘、人类大脑，还是股票市场、社会系统。其中一个跨学科的领域就是关系秩序理论。
| url = https://archive.org/details/emergenceconnect00john
| url = https://archive.org/details/emergenceconnect00john
| url-access = registration
| url-access = registration
}}
}}
</ref>
</ref>
The behavior of a complex system is often said to be due to emergence and self-organization. Chaos theory has investigated the sensitivity of systems to variations in initial conditions as one cause of complex behaviour.
一个复杂系统的行为通常被认为是由于涌现和自我组织。混沌理论研究了系统对初始条件变化的敏感性，这是导致复杂行为的原因之一。
The approaches that embody concepts of systems, multiple elements, multiple relational regimes, and state spaces might be summarized as implying that complexity arises from the number of distinguishable relational regimes (and their associated state spaces) in a defined system.
The approaches that embody concepts of systems, multiple elements, multiple relational regimes, and state spaces might be summarized as implying that complexity arises from the number of distinguishable relational regimes (and their associated state spaces) in a defined system.
Some definitions relate to the algorithmic basis for the expression of a complex phenomenon or model or mathematical expression, as later set out herein.
Some definitions relate to the algorithmic basis for the expression of a complex phenomenon or model or mathematical expression, as later set out herein.
Recent developments around artificial life, evolutionary computation and genetic algorithms have led to an increasing emphasis on complexity and complex adaptive systems.
最近围绕人工生命、进化计算和遗传算法的发展使人们越来越重视复杂性和复杂适应系统。
One of the problems in addressing complexity issues has been formalizing the intuitive conceptual distinction between the large number of variances in relationships extant in random collections, and the sometimes large, but smaller, number of relationships between elements in systems where constraints (related to correlation of otherwise independent elements) simultaneously reduce the variations from element independence and create distinguishable regimes of more-uniform, or correlated, relationships, or interactions.
One of the problems in addressing complexity issues has been formalizing the intuitive conceptual distinction between the large number of variances in relationships extant in random collections, and the sometimes large, but smaller, number of relationships between elements in systems where constraints (related to correlation of otherwise independent elements) simultaneously reduce the variations from element independence and create distinguishable regimes of more-uniform, or correlated, relationships, or interactions.
In social science, the study on the emergence of macro-properties from the micro-properties, also known as macro-micro view in sociology. The topic is commonly recognized as social complexity that is often related to the use of computer simulation in social science, i.e.: computational sociology.
在社会科学中，研究宏观属性的出现是从微观属性出发的，在社会学中又称为宏观-微观视角。这个话题通常被认为是社会的复杂性，常常与计算机模拟在社会科学中的应用有关。计算社会学。
Weaver perceived and addressed this problem, in at least a preliminary way, in drawing a distinction between "disorganized complexity" and "organized complexity".
Weaver perceived and addressed this problem, in at least a preliminary way, in drawing a distinction between "disorganized complexity" and "organized complexity".
In Weaver's view, disorganized complexity results from the particular system having a very large number of parts, say millions of parts, or many more. Though the interactions of the parts in a "disorganized complexity" situation can be seen as largely random, the properties of the system as a whole can be understood by using probability and statistical methods.
In Weaver's view, disorganized complexity results from the particular system having a very large number of parts, say millions of parts, or many more. Though the interactions of the parts in a "disorganized complexity" situation can be seen as largely random, the properties of the system as a whole can be understood by using probability and statistical methods.
Systems theory has long been concerned with the study of complex systems (in recent times, complexity theory and complex systems have also been used as names of the field). These systems are present in the research of a variety disciplines, including biology, economics, social studies and technology. Recently, complexity has become a natural domain of interest of real world socio-cognitive systems and emerging systemics research. Complex systems tend to be high-dimensional, non-linear, and difficult to model. In specific circumstances, they may exhibit low-dimensional behaviour.
系统理论长期以来一直关注复杂系统的研究(近年来，复杂性理论和复杂系统也被用作该领域的名称)。这些系统存在于各种学科的研究中，包括生物学、经济学、社会研究和技术。近年来，复杂性已经成为现实世界社会认知系统和新兴系统学研究的一个自然领域。复杂系统往往是高维的、非线性的、难以建模的。在特定情况下，他们可能表现出低维度的行为。
A prime example of disorganized complexity is a gas in a container, with the gas molecules as the parts. Some would suggest that a system of disorganized complexity may be compared with the (relative) [[simplicity]] of planetary orbits – the latter can be predicted by applying [[Newton's laws of motion]]. Of course, most real-world systems, including planetary orbits, eventually become theoretically unpredictable even using Newtonian dynamics; as discovered by modern [[chaos theory]].<ref>"Sir James Lighthill and Modern Fluid Mechanics", by Lokenath Debnath, The University of Texas-Pan American, US, Imperial College Press: {{ISBN|978-1-84816-113-9}}: {{ISBN|1-84816-113-1}}, Singapore, page 31. Online at http://cs5594.userapi.com/u11728334/docs/25eb2e1350a5/Lokenath_Debnath_Sir_James_Lighthill_and_mode.pdf{{dead link|date=August 2017 |bot=InternetArchiveBot |fix-attempted=yes }}</ref>
A prime example of disorganized complexity is a gas in a container, with the gas molecules as the parts. Some would suggest that a system of disorganized complexity may be compared with the (relative) [[simplicity]] of planetary orbits – the latter can be predicted by applying [[Newton's laws of motion]]. Of course, most real-world systems, including planetary orbits, eventually become theoretically unpredictable even using Newtonian dynamics; as discovered by modern [[chaos theory]].<ref>"Sir James Lighthill and Modern Fluid Mechanics", by Lokenath Debnath, The University of Texas-Pan American, US, Imperial College Press: {{ISBN|978-1-84816-113-9}}: {{ISBN|1-84816-113-1}}, Singapore, page 31. Online at http://cs5594.userapi.com/u11728334/docs/25eb2e1350a5/Lokenath_Debnath_Sir_James_Lighthill_and_mode.pdf{{dead link|date=August 2017 |bot=InternetArchiveBot |fix-attempted=yes }}</ref>
In information theory, algorithmic information theory is concerned with the complexity of strings of data.
在信息论中，算法信息论关注的是数据串的复杂性。
Organized complexity, in Weaver's view, resides in nothing else than the non-random, or correlated, interaction between the parts. These correlated relationships create a differentiated structure that can, as a system, interact with other systems. The coordinated system manifests properties not carried or dictated by individual parts. The organized aspect of this form of complexity vis-a-vis to other systems than the subject system can be said to "emerge," without any "guiding hand".
Organized complexity, in Weaver's view, resides in nothing else than the non-random, or correlated, interaction between the parts. These correlated relationships create a differentiated structure that can, as a system, interact with other systems. The coordinated system manifests properties not carried or dictated by individual parts. The organized aspect of this form of complexity vis-a-vis to other systems than the subject system can be said to "emerge," without any "guiding hand".
Complex strings are harder to compress. While intuition tells us that this may depend on the codec used to compress a string (a codec could be theoretically created in any arbitrary language, including one in which the very small command "X" could cause the computer to output a very complicated string like "18995316"), any two Turing-complete languages can be implemented in each other, meaning that the length of two encodings in different languages will vary by at most the length of the "translation" language – which will end up being negligible for sufficiently large data strings.
复杂的字符串更难压缩。直觉告诉我们，这可能取决于用于压缩字符串的编解码器(编解码器理论上可以在任何语言中创建，包括一个非常小的命令“ x”可以导致计算机输出非常复杂的字符串，比如“18995316”) ，但是任何两种图灵完整语言都可以在彼此中实现，这意味着不同语言中两种编码器的长度最多只会随着“翻译”语言的长度而变化——这对于足够大数据字符串来说可以忽略不计。
The number of parts does not have to be very large for a particular system to have emergent properties. A system of organized complexity may be understood in its properties (behavior among the properties) through [[model (abstract)|modeling]] and [[simulation]], particularly [[computer simulation|modeling and simulation with computers]]. An example of organized complexity is a city neighborhood as a living mechanism, with the neighborhood people among the system's parts.<ref>{{cite book
The number of parts does not have to be very large for a particular system to have emergent properties. A system of organized complexity may be understood in its properties (behavior among the properties) through [[model (abstract)|modeling]] and [[simulation]], particularly [[computer simulation|modeling and simulation with computers]]. An example of organized complexity is a city neighborhood as a living mechanism, with the neighborhood people among the system's parts.<ref>{{cite book
| last = Jacobs
| last = Jacobs
These algorithmic measures of complexity tend to assign high values to random noise. However, those studying complex systems would not consider randomness as complexity.
这些复杂度的算法测量倾向于给随机噪声赋予较高的值。然而，那些研究复杂系统的人并不认为随机性就是复杂性。
| first = Jane
| first = Jane
| title = The Death and Life of Great American Cities
| title = The Death and Life of Great American Cities
Information entropy is also sometimes used in information theory as indicative of complexity, but entropy is also high for randomness. Information fluctuation complexity, fluctuations of information about entropy, does not consider randomness to be complex and has been useful in many applications.
信息论中有时也会用熵表示复杂性，但是熵的随机性也很高。信息波动的复杂性，熵信息的波动性，不考虑随机性的复杂性，已经在许多应用中得到应用。
| url = https://archive.org/details/deathlifeofgre00jaco
| url = https://archive.org/details/deathlifeofgre00jaco
| url-access = registration
| url-access = registration
Recent work in machine learning has examined the complexity of the data as it affects the performance of supervised classification algorithms. Ho and Basu present a set of complexity measures for binary classification problems.
最近机器学习的工作已经检查了数据的复杂性，因为它影响了监督分类算法的性能。Ho 和 Basu 为二分类问题提出了一套复杂度量方法。
| publisher = Random House
| publisher = Random House
| year = 1961
| year = 1961
The complexity measures broadly cover:
复杂性指标大致涵盖:
| location = New York }}
| location = New York }}
</ref>
</ref>
== Sources and factors ==
Instance hardness is a bottom-up approach that first seeks to identify instances that are likely to be misclassified (or, in other words, which instances are the most complex). The characteristics of the instances that are likely to be misclassified are then measured based on the output from a set of hardness measures. The hardness measures are based on several supervised learning techniques such as measuring the number of disagreeing neighbors or the likelihood of the assigned class label given the input features. The information provided by the complexity measures has been examined for use in meta learning to determine for which data sets filtering (or removing suspected noisy instances from the training set) is the most beneficial and could be expanded to other areas.
实例硬度是一种自下而上的方法，它首先寻求识别可能被错误分类的实例(或者，换句话说，哪些实例是最复杂的)。然后，可能被错误分类的实例的特征根据一组硬度测量值的输出进行测量。硬度测量是基于一些监督式学习技术，如测量不同意的邻居的数量或分配的类标签的可能性给予输入特征。复杂性度量提供的信息已经被用于元学习，以确定哪些数据集过滤(或者从训练集中去除可疑的噪音实例)是最有益的，并且可以扩展到其他领域。
There are generally rules which can be invoked to explain the origin of complexity in a given system.
There are generally rules which can be invoked to explain the origin of complexity in a given system.
The source of disorganized complexity is the large number of parts in the system of interest, and the lack of correlation between elements in the system.
A recent study based on molecular simulations and compliance constants describes molecular recognition as a phenomenon of organisation.
最近一项基于分子模拟和顺应常数的研究将分子识别描述为一种组织现象。
Even for small molecules like carbohydrates, the recognition process can not be predicted or designed even assuming that each individual hydrogen bond's strength is exactly known.
即使是像碳水化合物这样的小分子，识别过程也不能被预测或设计，即使假设每个单独的氢键的强度是确切知道的。
In the case of self-organizing living systems, usefully organized complexity comes from beneficially mutated organisms being selected to survive by their environment for their differential reproductive ability or at least success over inanimate matter or less organized complex organisms. See e.g. [[Robert Ulanowicz]]'s treatment of ecosystems.<ref>Ulanowicz, Robert, "Ecology, the Ascendant Perspective", Columbia, 1997</ref>
In the case of self-organizing living systems, usefully organized complexity comes from beneficially mutated organisms being selected to survive by their environment for their differential reproductive ability or at least success over inanimate matter or less organized complex organisms. See e.g. [[Robert Ulanowicz]]'s treatment of ecosystems.<ref>Ulanowicz, Robert, "Ecology, the Ascendant Perspective", Columbia, 1997</ref>
Complexity of an object or system is a relative property. For instance, for many functions (problems), such a computational complexity as time of computation is smaller when multitape [[Turing machine]]s are used than when Turing machines with one tape are used. [[Random Access Machine]]s allow one to even more decrease time complexity (Greenlaw and Hoover 1998: 226), while inductive Turing machines can decrease even the complexity class of a function, language or set (Burgin 2005). This shows that tools of activity can be an important factor of complexity.
Computational complexity theory is the study of the complexity of problems – that is, the difficulty of solving them. Problems can be classified by complexity class according to the time it takes for an algorithm – usually a computer program – to solve them as a function of the problem size. Some problems are difficult to solve, while others are easy. For example, some difficult problems need algorithms that take an exponential amount of time in terms of the size of the problem to solve. Take the travelling salesman problem, for example. It can be solved in time <math>O(n^2 2^n)</math> (where n is the size of the network to visit – the number of cities the travelling salesman must visit exactly once). As the size of the network of cities grows, the time needed to find the route grows (more than) exponentially.
计算复杂性理论是研究问题的复杂性，也就是解决问题的难度。问题可以根据算法(通常是计算机程序)解决它们所需的时间(作为问题大小的函数)按复杂性类别进行分类。有些问题很难解决，而有些则很容易。例如，一些困难的问题需要算法花费指数量的时间来解决问题的大小。以旅行推销员问题为例。这个问题可以在时间上得到解决(其中 n 是要访问的网络的大小，也就是货郎担必须访问一次的城市数)。随着城市网络规模的扩大，寻找路线所需的时间呈指数增长(超过倍)。
== Varied meanings ==
Even though a problem may be computationally solvable in principle, in actual practice it may not be that simple. These problems might require large amounts of time or an inordinate amount of space. Computational complexity may be approached from many different aspects. Computational complexity can be investigated on the basis of time, memory or other resources used to solve the problem. Time and space are two of the most important and popular considerations when problems of complexity are analyzed.
即使一个问题在原则上是可以计算解决的，但在实际操作中可能没有那么简单。这些问题可能需要大量的时间或过多的空间。计算复杂性可以从许多不同的方面来看待。计算复杂性可以根据时间，内存或其他资源用于解决问题的基础上进行研究。在分析复杂性问题时，时间和空间是最重要和最普遍的两个考虑因素。
In several scientific fields, "complexity" has a precise meaning:
In several scientific fields, "complexity" has a precise meaning:
There exist a certain class of problems that although they are solvable in principle they require so much time or space that it is not practical to attempt to solve them. These problems are called intractable.
有一类问题，虽然原则上是可以解决的，但是它们需要很多时间和空间，因此试图解决它们是不切实际的。这些问题被称为棘手的。
* In [[computational complexity theory]], the [[Computational resource|amounts of resources]] required for the execution of [[algorithm]]s is studied. The most popular types of computational complexity are the time complexity of a problem equal to the number of steps that it takes to solve an instance of the problem as a function of the [[problem size|size of the input]] (usually measured in bits), using the most efficient algorithm, and the space complexity of a problem equal to the volume of the [[computer storage|memory]] used by the algorithm (e.g., cells of the tape) that it takes to solve an instance of the problem as a function of the size of the input (usually measured in bits), using the most efficient algorithm. This allows classification of computational problems by [[complexity class]] (such as [[P (complexity)|P]], [[NP (complexity)|NP]], etc.). An axiomatic approach to computational complexity was developed by [[Manuel Blum]]. It allows one to deduce many properties of concrete computational complexity measures, such as time complexity or space complexity, from properties of axiomatically defined measures.
* In [[computational complexity theory]], the [[Computational resource|amounts of resources]] required for the execution of [[algorithm]]s is studied. The most popular types of computational complexity are the time complexity of a problem equal to the number of steps that it takes to solve an instance of the problem as a function of the [[problem size|size of the input]] (usually measured in bits), using the most efficient algorithm, and the space complexity of a problem equal to the volume of the [[computer storage|memory]] used by the algorithm (e.g., cells of the tape) that it takes to solve an instance of the problem as a function of the size of the input (usually measured in bits), using the most efficient algorithm. This allows classification of computational problems by [[complexity class]] (such as [[P (complexity)|P]], [[NP (complexity)|NP]], etc.). An axiomatic approach to computational complexity was developed by [[Manuel Blum]]. It allows one to deduce many properties of concrete computational complexity measures, such as time complexity or space complexity, from properties of axiomatically defined measures.
* In [[algorithmic information theory]], the ''[[Kolmogorov complexity]]'' (also called ''descriptive complexity'', ''algorithmic complexity'' or ''algorithmic entropy'') of a [[string (computer science)|string]] is the length of the shortest binary [[computer program|program]] that outputs that string. [[Minimum message length]] is a practical application of this approach. Different kinds of Kolmogorov complexity are studied: the uniform complexity, prefix complexity, monotone complexity, time-bounded Kolmogorov complexity, and space-bounded Kolmogorov complexity. An axiomatic approach to Kolmogorov complexity based on [[Blum axioms]] (Blum 1967) was introduced by Mark Burgin in the paper presented for publication by [[Andrey Kolmogorov]].<ref>Burgin, M. (1982) Generalized Kolmogorov complexity and duality in theory of computations, Notices of the Russian Academy of Sciences, v.25, No. 3, pp. 19–23</ref> The axiomatic approach encompasses other approaches to Kolmogorov complexity. It is possible to treat different kinds of Kolmogorov complexity as particular cases of axiomatically defined generalized Kolmogorov complexity. Instead of proving similar theorems, such as the basic invariance theorem, for each particular measure, it is possible to easily deduce all such results from one corresponding theorem proved in the axiomatic setting. This is a general advantage of the axiomatic approach in mathematics. The axiomatic approach to Kolmogorov complexity was further developed in the book (Burgin 2005) and applied to software metrics (Burgin and Debnath, 2003; Debnath and Burgin, 2003).
* In [[algorithmic information theory]], the ''[[Kolmogorov complexity]]'' (also called ''descriptive complexity'', ''algorithmic complexity'' or ''algorithmic entropy'') of a [[string (computer science)|string]] is the length of the shortest binary [[computer program|program]] that outputs that string. [[Minimum message length]] is a practical application of this approach. Different kinds of Kolmogorov complexity are studied: the uniform complexity, prefix complexity, monotone complexity, time-bounded Kolmogorov complexity, and space-bounded Kolmogorov complexity. An axiomatic approach to Kolmogorov complexity based on [[Blum axioms]] (Blum 1967) was introduced by Mark Burgin in the paper presented for publication by [[Andrey Kolmogorov]].<ref>Burgin, M. (1982) Generalized Kolmogorov complexity and duality in theory of computations, Notices of the Russian Academy of Sciences, v.25, No. 3, pp. 19–23</ref> The axiomatic approach encompasses other approaches to Kolmogorov complexity. It is possible to treat different kinds of Kolmogorov complexity as particular cases of axiomatically defined generalized Kolmogorov complexity. Instead of proving similar theorems, such as the basic invariance theorem, for each particular measure, it is possible to easily deduce all such results from one corresponding theorem proved in the axiomatic setting. This is a general advantage of the axiomatic approach in mathematics. The axiomatic approach to Kolmogorov complexity was further developed in the book (Burgin 2005) and applied to software metrics (Burgin and Debnath, 2003; Debnath and Burgin, 2003).
There is another form of complexity called hierarchical complexity. It is orthogonal to the forms of complexity discussed so far, which are called horizontal complexity.
还有另外一种复杂性，叫做层次复杂性。它与迄今为止所讨论的复杂性的形式是正交的，即所谓的横向复杂性。
*In [[information theory]], [[information fluctuation complexity]] is the fluctuation of information about [[Entropy (information theory)|information entropy]]. It is derivable from fluctuations in the predominance of order and chaos in a dynamic system and has been used as a measure of complexity in many diverse fields.
*In [[information theory]], [[information fluctuation complexity]] is the fluctuation of information about [[Entropy (information theory)|information entropy]]. It is derivable from fluctuations in the predominance of order and chaos in a dynamic system and has been used as a measure of complexity in many diverse fields.
* In [[physical systems]], complexity is a measure of the [[probability]] of the [[Quantum state|state vector]] of the system. This should not be confused with [[entropy (statistical thermodynamics)|entropy]]; it is a distinct mathematical measure, one in which two distinct states are never conflated and considered equal, as is done for the notion of entropy in [[statistical mechanics]].
* In [[physical systems]], complexity is a measure of the [[probability]] of the [[Quantum state|state vector]] of the system. This should not be confused with [[entropy (statistical thermodynamics)|entropy]]; it is a distinct mathematical measure, one in which two distinct states are never conflated and considered equal, as is done for the notion of entropy in [[statistical mechanics]].
* In [[dynamical systems]], statistical complexity measures the size of the minimum program able to statistically reproduce the patterns (configurations) contained in the data set (sequence)<ref>{{Cite journal |last1=Crutchfield |first1=J.P. |last2=Young |first2=K. |year=1989 |title=Inferring statistical complexity |journal=[[Physical Review Letters]] |volume=63 |issue=2 |pages=105–108|doi=10.1103/PhysRevLett.63.105 |pmid=10040781 |bibcode=1989PhRvL..63..105C }}</ref><ref>{{Cite journal |last1=Crutchfield |first1=J.P. |last2=Shalizi |first2=C.R. |year=1999
* In [[dynamical systems]], statistical complexity measures the size of the minimum program able to statistically reproduce the patterns (configurations) contained in the data set (sequence).<ref>{{Cite journal |last1=Crutchfield |first1=J.P. |last2=Young |first2=K. |year=1989 |title=Inferring statistical complexity |journal=[[Physical Review Letters]] |volume=63 |issue=2 |pages=105–108|doi=10.1103/PhysRevLett.63.105 |pmid=10040781 |bibcode=1989PhRvL..63..105C }}</ref><ref>{{Cite journal |last1=Crutchfield |first1=J.P. |last2=Shalizi |first2=C.R. |year=1999
|title=Thermodynamic depth of causal states: Objective complexity via minimal representations |journal=[[Physical Review E]] |volume=59 |issue=1 |pages=275–283
|title=Thermodynamic depth of causal states: Objective complexity via minimal representations |journal=[[Physical Review E]] |volume=59 |issue=1 |pages=275–283
|doi=10.1103/PhysRevE.59.275 |bibcode=1999PhRvE..59..275C }}</ref> While the algorithmic complexity implies a deterministic description of an object (it measures the information content of an individual sequence), the statistical complexity, like [[forecasting complexity]],<ref>{{cite journal |last1=Grassberger |first1=P. |year=1986 |title=Toward a quantitative theory of self-generated complexity |journal=[[International Journal of Theoretical Physics]] |volume=25 |issue=9 |pages=907–938 |doi=10.1007/bf00668821|bibcode=1986IJTP...25..907G|s2cid=16952432 }}</ref> implies a statistical description, and refers to an ensemble of sequences generated by a certain source. Formally, the statistical complexity reconstructs a minimal model comprising the collection of all histories sharing a similar probabilistic future, and measures the [[entropy (information theory)|entropy]] of the probability distribution of the states within this model. It is a computable and observer-independent measure based only on the internal dynamics of the system, and has been used in studies of [[emergence]] and [[self-organization]].<ref>{{cite journal
|doi=10.1103/PhysRevE.59.275 |bibcode=1999PhRvE..59..275C }}</ref>. While the algorithmic complexity implies a deterministic description of an object (it measures the information content of an individual sequence), the statistical complexity, like [[forecasting complexity]]<ref>{{cite journal |last1=Grassberger |first1=P. |year=1986 |title=Toward a quantitative theory of self-generated complexity |journal=[[International Journal of Theoretical Physics]] |volume=25 |issue=9 |pages=907–938 |doi=10.1007/bf00668821|bibcode=1986IJTP...25..907G}}</ref>, implies a statistical description, and refers to an ensemble of sequences generated by a certain source. Formally, the statistical complexity reconstructs a minimal model comprising the collection of all histories sharing a similar probabilistic future, and measures the [[entropy (information theory)|entropy]] of the probability distribution of the states within this model. It is a computable and observer-independent measure based only on the internal dynamics of the system, and has been used in studies of [[emergence]] and [[self-organization]].<ref>{{cite journal
|last1=Prokopenko |first1=M. |last2=Boschetti |first2=F. |last3=Ryan |first3=A. |year=2009 |title=An information-theoretic primer on complexity, self-organisation and emergence |journal=Complexity |volume=15 |issue=1 |pages=11–28 |doi=10.1002/cplx.20249 |bibcode=2009Cmplx..15a..11P }}</ref>
|last1=Prokopenko |first1=M. |last2=Boschetti |first2=F. |last3=Ryan |first3=A. |year=2009 |title=An information-theoretic primer on complexity, self-organisation and emergence |journal=Complexity |volume=15 |issue=1 |pages=11–28 |doi=10.1002/cplx.20249 |bibcode=2009Cmplx..15a..11P }}</ref>
* In [[mathematics]], [[Krohn–Rhodes complexity]] is an important topic in the study of finite [[semigroup]]s and [[automata theory|automata]].
* In [[mathematics]], [[Krohn–Rhodes complexity]] is an important topic in the study of finite [[semigroup]]s and [[automata theory|automata]].
Other fields introduce less precisely defined notions of complexity:
Other fields introduce less precisely defined notions of complexity:
Complexity has always been a part of our environment, and therefore many scientific fields have dealt with complex systems and phenomena. From one perspective, that which is somehow complex – displaying variation without being [[randomness|random]] – is most worthy of interest given the rewards found in the depths of exploration.
Complexity has always been a part of our environment, and therefore many scientific fields have dealt with complex systems and phenomena. From one perspective, that which is somehow complex – displaying variation without being [[randomness|random]] – is most worthy of interest given the rewards found in the depths of exploration.
The use of the term complex is often confused with the term complicated. In today's systems, this is the difference between myriad connecting "stovepipes" and effective "integrated" solutions.<ref>[[Lissack, Michael R.]]; [[Johan Roos]] (2000). ''The Next Common Sense, The e-Manager's Guide to Mastering Complexity.'' Intercultural Press. {{ISBN|978-1-85788-235-3}}.
The use of the term complex is often confused with the term complicated. In today's systems, this is the difference between myriad connecting "stovepipes" and effective "integrated" solutions.<ref>[[Lissack, Michael R.]]; [[Johan Roos]] (2000). ''The Next Common Sense, The e-Manager's Guide to Mastering Complexity.'' Intercultural Press. {{ISBN|978-1-85788-235-3}}.
</ref> This means that complex is the opposite of independent, while complicated is the opposite of simple.
</ref> This means that complex is the opposite of independent, while complicated is the opposite of simple.
While this has led some fields to come up with specific definitions of complexity, there is a more recent movement to regroup observations [[interdisciplinarity|from different fields]] to study complexity in itself, whether it appears in [[anthill]]s, [[human brain]]s, or [[stock market]]s, social systems.<ref>{{Cite journal|url=https://www.academia.edu/30193748|title=Complexics as a meta-transdisciplinary field|last=Bastardas-Boada|first=Albert|date=|journal=Congrès Mondial Pour la Pensée Complexe. Les Défis d'Un Monde Globalisé. (Paris, 8-9 Décembre). Unesco|access-date=}}</ref> One such interdisciplinary group of fields is [[relational order theories]].
While this has led some fields to come up with specific definitions of complexity, there is a more recent movement to regroup observations [[interdisciplinarity|from different fields]] to study complexity in itself, whether it appears in [[anthill]]s, [[human brain]]s, or [[stock market]]s, social systems.<ref>{{Cite journal|url=https://www.academia.edu/30193748|title=Complexics as a meta-transdisciplinary field|last=Bastardas-Boada|first=Albert|date=|journal=Congrès Mondial Pour la Pensée Complexe. Les Défis d'Un Monde Globalisé. (Paris, 8-9 Décembre). Unesco|access-date=}}</ref> One such interdisciplinary group of fields is [[relational order theories]].
The behavior of a complex system is often said to be due to emergence and [[self-organization]]. Chaos theory has investigated the sensitivity of systems to variations in initial conditions as one cause of complex behaviour.
The behavior of a complex system is often said to be due to emergence and [[self-organization]]. Chaos theory has investigated the sensitivity of systems to variations in initial conditions as one cause of complex behaviour.
Recent developments around [[artificial life]], [[evolutionary computation]] and [[genetic algorithm]]s have led to an increasing emphasis on complexity and [[complex adaptive systems]].
Recent developments around [[artificial life]], [[evolutionary computation]] and [[genetic algorithm]]s have led to an increasing emphasis on complexity and [[complex adaptive systems]].
| last = Chu
| last = Chu
| last = Chu
| first = Dominique
| first = Dominique
第一 = Dominique
=== Simulations ===
| title = Complexity: Against Systems
| title = Complexity: Against Systems
| 题目复杂性: 对抗系统
| title = 复杂性: 对抗系统
In [[social science]], the study on the emergence of macro-properties from the micro-properties, also known as macro-micro view in [[sociology]]. The topic is commonly recognized as [[social complexity]] that is often related to the use of computer simulation in social science, i.e.: [[computational sociology]].
| journal = Theory in Biosciences
| journal = Theory in Biosciences
生物科学理论
生物科学理论
| volume = 130
| volume = 130
130
=== Systems ===
| issue = 3
| issue = 3
第三期
第三期
{{main article|Complex system}}
| pages = 229–45
| pages = 229–45
| 页数 = 229-45
[[Systems theory]] has long been concerned with the study of [[complex system]]s (in recent times, ''complexity theory'' and ''complex systems'' have also been used as names of the field). These systems are present in the research of a variety disciplines, including [[biology]], [[economics]], social studies and [[technology]]. Recently, complexity has become a natural domain of interest of real world socio-cognitive systems and emerging [[systemics]] research. Complex systems tend to be high-[[dimension]]al, [[non-linearity|non-linear]], and difficult to model. In specific circumstances, they may exhibit low-dimensional behaviour.
| year = 2011
| year = 2011
2011年
2011年
| pmid =21287293 | doi = 10.1007/s12064-011-0121-4
| pmid =21287293 | doi = 10.1007/s12064-011-0121-4
21287293 | doi = 10.1007/s12064-011-0121-4
=== Data ===
| s2cid = 14903039
2cid = 14903039
In [[information theory]], algorithmic information theory is concerned with the complexity of strings of data.
| url = http://kar.kent.ac.uk/30776/1/againstSystems.pdf
Http://kar.kent.ac.uk/30776/1/againstsystems.pdf
Http://kar.kent.ac.uk/30776/1/againstsystems.pdf
}}
}}
}}
}}
Complex strings are harder to compress. While intuition tells us that this may depend on the [[codec]] used to compress a string (a codec could be theoretically created in any arbitrary language, including one in which the very small command "X" could cause the computer to output a very complicated string like "18995316"), any two [[Turing completeness|Turing-complete]] languages can be implemented in each other, meaning that the length of two encodings in different languages will vary by at most the length of the "translation" language – which will end up being negligible for sufficiently large data strings.
| last = Waldrop
| last = Waldrop
| last = Waldrop
These algorithmic measures of complexity tend to assign high values to [[signal noise|random noise]]. However, those studying complex systems would not consider randomness as complexity{{who|date=October 2013}}.
| first = M. Mitchell
| first = M. Mitchell
作者: m. Mitchell
| authorlink =
| authorlink =
| authorlink =
[[Information entropy]] is also sometimes used in information theory as indicative of complexity, but entropy is also high for randomness. [[Information fluctuation complexity]], fluctuations of information about entropy, does not consider randomness to be complex and has been useful in many applications.
| title = Complexity: The Emerging Science at the Edge of Order and Chaos
| title = Complexity: The Emerging Science at the Edge of Order and Chaos
复杂性: 处于秩序与混沌边缘的新兴科学
| location = New York
| location = New York
| 地点: 纽约
| 地点: 纽约
Recent work in [[machine learning]] has examined the complexity of the data as it affects the performance of [[Supervised learning|supervised]] classification algorithms. Ho and Basu present a set of [[Computational complexity theory|complexity measures]] for [[binary classification]] problems.<ref>Ho, T.K.; Basu, M. (2002). "[http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=990132&tag=1 Complexity Measures of Supervised Classification Problems]". IEEE Transactions on Pattern Analysis and Machine Intelligence 24 (3), pp 289–300.</ref>
| publisher = Simon & Schuster
| publisher = Simon & Schuster
2012年3月24日 | publisher = 西蒙与舒斯特
| year = 1992
| year = 1992
1992年
1992年
The complexity measures broadly cover:
| isbn = 978-0-671-76789-1
| isbn = 978-0-671-76789-1
978-0-671-76789-1
* the overlaps in feature values from differing classes.
| url = https://archive.org/details/complexityemergi00wald
| url = https://archive.org/details/complexityemergi00wald
Https://archive.org/details/complexityemergi00wald
Https://archive.org/details/complexityemergi00wald
* the separability of the classes.
}}
}}
}}
}}
* measures of geometry, topology, and density of [[manifold]]s. Instance hardness is another approach seeks to characterize the data complexity with the goal of determining how hard a data set is to classify correctly and is not limited to binary problems.<ref>Smith, M.R.; Martinez, T.; Giraud-Carrier, C. (2014). "[https://link.springer.com/article/10.1007%2Fs10994-013-5422-z An Instance Level Analysis of Data Complexity]". Machine Learning, 95(2): 225–256.</ref>
Instance hardness is a bottom-up approach that first seeks to identify instances that are likely to be misclassified (or, in other words, which instances are the most complex). The characteristics of the instances that are likely to be misclassified are then measured based on the output from a set of hardness measures. The hardness measures are based on several supervised learning techniques such as measuring the number of disagreeing neighbors or the likelihood of the assigned class label given the input features. The information provided by the complexity measures has been examined for use in [[Meta learning (computer science)|meta learning]] to determine for which data sets filtering (or removing suspected noisy instances from the training set) is the most beneficial<ref>{{cite journal|title= Predicting Noise Filtering Efficacy with Data Complexity Measures for Nearest Neighbor Classification|journal= Pattern Recognition|volume= 46|pages= 355–364|doi= 10.1016/j.patcog.2012.07.009|year= 2013|last1= Sáez|first1= José A.|last2= Luengo|first2= Julián|last3= Herrera|first3= Francisco}}</ref> and could be expanded to other areas.
| last = Czerwinski
| last = Czerwinski
| last = Czerwinski
| first = Tom
| first = Tom
第一名: 汤姆
=== In molecular recognition ===
|author2=David Alberts
|author2=David Alberts
2 = David Alberts
A recent study based on molecular simulations and compliance constants describes [[molecular recognition]] as a phenomenon of organisation.<ref>{{cite journal | title=Complexity in molecular recognition | author=Jorg Grunenberg | journal=Phys. Chem. Chem. Phys. | year=2011 | volume=13 | issue=21 | pages= 10136–10146 | doi=10.1039/c1cp20097f| pmid=21503359 | bibcode=2011PCCP...1310136G }}</ref>
| title = Complexity, Global Politics, and National Security
| title = Complexity, Global Politics, and National Security
| 题目 = 复杂性，全球政治和国家安全
Even for small molecules like [[carbohydrates]], the recognition process can not be predicted or designed even assuming that each individual [[hydrogen bond]]'s strength is exactly known.
| url = http://www.dodccrp.org/files/Alberts_Complexity_Global.pdf
| url = http://www.dodccrp.org/files/Alberts_Complexity_Global.pdf
Http://www.dodccrp.org/files/alberts_complexity_global.pdf
Http://www.dodccrp.org/files/alberts_complexity_global.pdf
| publisher = National Defense University
| publisher = National Defense University
| publisher = National Defense University
== Applications ==
| year = 1997
| year = 1997
1997年
1997年
Computational complexity theory is the study of the complexity of problems – that is, the difficulty of [[problem solving|solving]] them. Problems can be classified by complexity class according to the time it takes for an algorithm – usually a computer program – to solve them as a function of the problem size. Some problems are difficult to solve, while others are easy. For example, some difficult problems need algorithms that take an exponential amount of time in terms of the size of the problem to solve. Take the [[travelling salesman problem]], for example. It can be solved in time <math>O(n^2 2^n)</math> (where ''n'' is the size of the network to visit – the number of cities the travelling salesman must visit exactly once). As the size of the network of cities grows, the time needed to find the route grows (more than) exponentially.
| isbn = 978-1-57906-046-6 }}
| isbn = 978-1-57906-046-6 }}
978-1-57906-046-6}
Even though a problem may be computationally solvable in principle, in actual practice it may not be that simple. These problems might require large amounts of time or an inordinate amount of space. [[Analysis of algorithms|Computational complexity]] may be approached from many different aspects. Computational complexity can be investigated on the basis of time, memory or other resources used to solve the problem. Time and space are two of the most important and popular considerations when problems of complexity are analyzed.
| last = Solé
| last = Solé
| last = Solé
| last = Solé
| first = R. V.
| first = R. V.
| 第一 = r. v。
There exist a certain class of problems that although they are solvable in principle they require so much time or space that it is not practical to attempt to solve them. These problems are called [[Computational complexity theory#Intractability|intractable]].
|author2=B. C. Goodwin
|author2=B. C. Goodwin
2 = b.C. 古德温
| title = Signs of Life: How Complexity Pervades Biology
| title = Signs of Life: How Complexity Pervades Biology
生命的迹象: 复杂性是如何渗透到生物学中的
There is another form of complexity called [[Model of hierarchical complexity|hierarchical complexity]]. It is orthogonal to the forms of complexity discussed so far, which are called horizontal complexity.
| publisher = Basic Books
| publisher = Basic Books
| publisher = Basic Books
| year = 2002
| year = 2002
2002年
2002年
== See also ==
| isbn = 978-0-465-01928-1 }}
| isbn = 978-0-465-01928-1 }}
| isbn 978-0-465-01928-1}
| isbn = 978-0-465-01928-1}
{{Div col|colwidth=18em}}
* [[Chaos theory]]
| first = Francis
| first = Francis
第一名: 弗朗西斯
* [[Complexity theory (disambiguation)|Complexity theory]] (disambiguation page)
| last =Heylighen
| last =Heylighen
| last = Heylighen
* [[Cyclomatic complexity]]
| editor-last = Bates
| editor-last = Bates
| 编辑-last = Bates
* [[Digital morphogenesis]]
| editor-first = Marcia J.
| editor-first = Marcia J.
| 编辑-第一个 Marcia j。
| 编辑-第一 = Marcia j。
* [[Dual-phase evolution]]
| editor2-last = Maack
| editor2-last = Maack
2-last = Maack
* [[Emergence]]
| editor2-first = Mary Niles
| editor2-first = Mary Niles
| 编辑2-第一个 Mary Niles
| 编辑2-first = Mary Niles
* [[Evolution of complexity]]
| contribution = Complexity and Self-Organization
| contribution = Complexity and Self-Organization
复杂性和自我组织
| 贡献 = 复杂性和自我组织
* [[Game complexity]]
| contribution-url = http://pespmc1.vub.ac.be/Papers/ELIS-Complexity.pdf
| contribution-url = http://pespmc1.vub.ac.be/Papers/ELIS-Complexity.pdf
| 贡献- http://pespmc1.vub.ac.be/papers/elis-complexity.pdf
| 贡献-url = http://pespmc1.vub.ac.be/papers/elis-complexity.pdf
* [[Holism in science]]
| title = Encyclopedia of Library and Information Sciences
| title = Encyclopedia of Library and Information Sciences
图书馆与信息科学百科全书
图书馆与信息科学百科全书
* [[Law of Complexity/Consciousness]]
| year = 2008
| year = 2008
2008年
2008年
* [[Model of hierarchical complexity]]
| publisher = CRC
| publisher = CRC
| 出版商 CRC
| publisher = CRC
* [[Names of large numbers]]
| isbn = 978-0-8493-9712-7
| isbn = 978-0-8493-9712-7
| isbn = 978-0-8493-9712-7
* [[Network science]]
}}
}}
}}
}}
* Burgin, M. (1982) Generalized Kolmogorov complexity and duality in theory of computations, Notices of the Russian Academy of Sciences, v.25, No. 3, pp. 19–23
* [[Network theory]]
* Meyers, R.A., (2009) "Encyclopedia of Complexity and Systems Science", {{ISBN|978-0-387-75888-6}}
* [[Novelty theory]]
* Mitchell, M. (2009). Complexity: A Guided Tour. Oxford University Press, Oxford, UK.
* [[Occam's razor]]
* Gershenson, C., Ed. (2008). Complexity: 5 Questions. Automatic Peess / VIP.
* [[Process architecture]]
* [[Programming Complexity]]
* [[Sociology and complexity science]]
* [[Systems theory]]
* [[Thorngate's postulate of commensurate complexity]]
* [[Variety (cybernetics)]]
* [[Volatility, uncertainty, complexity and ambiguity]]
* [http://bactra.org/notebooks/complexity-measures.html Complexity Measures] – an article about the abundance of not-that-useful complexity measures.
* [[Computational irreducibility]]
* [http://web.cecs.pdx.edu/~mm/ExploringComplexityFall2009/index.html Exploring Complexity in Science and Technology] – Introductory complex system course by Melanie Mitchell
*[[Zero-Force Evolutionary Law]]
{{Div col end}}
== References ==
{{chaos theory|state=collapsed}}
{{reflist}}
== Further reading ==
{{refbegin}}
Category:Abstraction
Category:Abstraction
类别: 抽象
类别: 抽象
* {{cite journal
Category:Chaos theory
Category:Chaos theory
范畴: 混沌理论
范畴: 混沌理论
| last = Chu
Category:Complex systems theory
Category:Complex systems theory
范畴: 复杂系统理论
范畴: 复杂系统理论
| first = Dominique
Category:Holism
Category:Holism
分类: 整体论
分类: 整体论
| title = Complexity: Against Systems
Category:Systems
Category:Systems
类别: 系统
类别: 系统
| journal = Theory in Biosciences
Category:Transdisciplinarity
Category:Transdisciplinarity