# 复杂性

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.[1]

Warren Weaver posited in 1948 two forms of complexity: disorganized complexity, and organized complexity.

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 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 takes a number of approaches to characterizing complexity; Zayed et al.[2]

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".[3]

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.

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.[4]

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".[4] Weaver's 1948 paper has influenced subsequent thinking about complexity.[5]

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.

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.

## Disorganized vs. organized

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".

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.[6]

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".

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.

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.[7]

## 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.

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.[8]

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.

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 $\displaystyle{ O(n^2 2^n) }$ (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.

## 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:

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 amounts of resources required for the execution of algorithms 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 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 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, 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 is the length of the shortest binary 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.[9] 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 dynamical systems, statistical complexity measures the size of the minimum program able to statistically reproduce the patterns (configurations) contained in the data set (sequence).[10][11] 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,[12] 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.[13]
• In Network theory complexity is the product of richness in the connections between components of a system,[14] and defined by a very unequal distribution of certain measures (some elements being highly connected and some very few, see complex network).
• In software engineering, programming complexity is a measure of the interactions of the various elements of the software. This differs from the computational complexity described above in that it is a measure of the design of the software.
• In abstract sense – Abstract Complexity, is based on visual structures perception [15] It is complexity of binary string defined as a square of features number divided by number of elements (0's and 1's). Features comprise here all distinctive arrangements of 0's and 1's. Though the features number have to be always approximated the definition is precise and meet intuitive criterion.

Other fields introduce less precisely defined notions of complexity:

• The number of parts (and types of parts) in the system and the number of relations between the parts is non-trivial – however, there is no general rule to separate "trivial" from "non-trivial";
• The system has memory or includes feedback;
• The system can adapt itself according to its history or feedback;
• The relations between the system and its environment are non-trivial or non-linear;
• The system can be influenced by, or can adapt itself to, its environment;
• The system is highly sensitive to initial conditions.

## Study

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.[16] 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 from different fields to study complexity in itself, whether it appears in anthills, human brains, or stock markets, social systems.[17] One such interdisciplinary group of fields is relational order theories.

## Topics

### 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.

### Mechanisms

Recent developments around artificial life, evolutionary computation and genetic algorithms have led to an increasing emphasis on complexity and complex adaptive systems.

 | last = Chu


| last = Chu

 | first = Dominique


### Simulations

 | 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


 | volume = 130


130

### Systems

 | issue = 3


 | pages = 229–45


| 页数 = 229-45

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.

 | year = 2011


2011年

 | 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


 }}

 }}


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.

 | last = Waldrop


| last = Waldrop

These algorithmic measures of complexity tend to assign high values to random noise. However, those studying complex systems would not consider randomness as complexity模板:Who.

 | first = M. Mitchell


 | 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


 | location = New York


| 地点: 纽约

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.[18]

 | publisher = Simon & Schuster


2012年3月24日 | publisher = 西蒙与舒斯特

 | year = 1992


1992年

 | 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

• the separability of the classes.
 }}

 }}

• measures of geometry, topology, and density of manifolds. 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.[19]

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[20] and could be expanded to other areas.

 | last = Czerwinski


| last = Czerwinski

 | first = Tom


### In molecular recognition

 |author2=David Alberts


2 = David Alberts

A recent study based on molecular simulations and compliance constants describes molecular recognition as a phenomenon of organisation.[21]

 | 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


 | publisher = National Defense University


| publisher = National Defense University

## Applications

 | year = 1997


1997年

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 $\displaystyle{ O(n^2 2^n) }$ (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 }}


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. 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é


 | 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 intractable.

 |author2=B. C. Goodwin


2 = b.C. 古德温

 | title = Signs of Life: How Complexity Pervades Biology


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.

 | publisher = Basic Books


| publisher = Basic Books

 | year = 2002


2002年

 | isbn = 978-0-465-01928-1 }}


| isbn = 978-0-465-01928-1}

 | first = Francis


 | last =Heylighen


| last = Heylighen

 | editor-last = Bates


| 编辑-last = Bates

 | editor-first = Marcia J.


| 编辑-第一 = Marcia j。

 | editor2-last = Maack


2-last = Maack

 | editor2-first = Mary Niles


| 编辑2-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


 | year = 2008


2008年

 | publisher = CRC


| publisher = CRC

 | isbn = 978-0-8493-9712-7


| isbn = 978-0-8493-9712-7

 }}

 }}


## References

1. {{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. 复杂性描述了一个系统或模型的行为，其组件以多种方式交互并遵循局部规则，这意味着没有合理的更高指令来定义各种可能的交互。 | last = Johnson | 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 | publisher = Scribner Science takes a number of approaches to characterizing complexity; Zayed et al. 科学需要许多方法来描述复杂性; 扎耶德等人。 | 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 | url = https://books.google.com/books?id=Au_tLkCwExQC | 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}}
2. 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. 有些定义涉及表达复杂现象或模型或数学表达式的算法基础，如本文后面所述。
3. 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. 解决复杂性问题的一个问题是将随机集合中现存的大量关系变量与系统中有时较大但较小的元素之间的关系(与其他独立元素的相关性有关)同时减少了元素独立性的变量，并创造了更加统一或相关的关系或相互作用的可区分的制度之间的直观概念区分形式化。, Neil F. (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 1: Two's company, three is complexity". 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". 在区分“无组织的复杂性”和“有组织的复杂性”时，编织者至少以一种初步的方式察觉并解决了这个问题。. Oneworld Publications. p. 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. 无组织复杂性的一个典型例子是一个容器中的气体，以气体分子为部件。有些人认为，一个无组织的复杂系统可以与行星轨道的(相对)简单性相比较——后者可以通过应用牛顿运动定律来预测。当然，大多数真实世界的系统，包括行星轨道，最终在理论上变得不可预测，即使使用牛顿动力学; 正如现代混沌理论所发现的那样。. ISBN [[Special:BookSources/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 看来，有组织的复杂性仅仅存在于各部分之间的非随机或相关的交互中。这些相互关联的关系创建了一个可以作为一个系统与其他系统交互的差异化结构。协调系统显示的属性不是由单个部分承载或支配的。这种形式的复杂性相对于主体系统以外的其他系统的有组织的方面可以说是“浮现” ，没有任何“指导手”。|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 看来，有组织的复杂性仅仅存在于各部分之间的非随机或相关的交互中。这些相互关联的关系创建了一个可以作为一个系统与其他系统交互的差异化结构。协调系统显示的属性不是由单个部分承载或支配的。这种形式的复杂性相对于主体系统以外的其他系统的有组织的方面可以说是“浮现” ，没有任何“指导手”。]].
4. 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)。这表明活动工具可以是复杂性的一个重要因素。, Warren (1948). "Science and Complexity" (PDF). American Scientist In several scientific fields, "complexity" has a precise meaning: 在一些科学领域，“复杂性”有着精确的含义:. 36 (4): 536–44. PMID 18882675. Retrieved 2007-11-21. line feed character in |last= at position 7 (help); line feed character in |journal= at position 19 (help)CS1 maint: extra punctuation (link) CS1 maint: multiple names: authors list (link)
5. Johnson, Steven (2001). Emergence: the connected lives of ants, brains, cities, and software. New York: Scribner Other fields introduce less precisely defined notions of complexity: 其他领域则引入了定义不那么精确的复杂性概念:. p. 46. ISBN [[Special:BookSources/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. 虽然这已经导致一些领域提出了复杂性的具体定义，但是最近有一种运动重新组合来自不同领域的观察结果来研究复杂性本身，无论它是出现在蚁丘、人类大脑，还是股票市场、社会系统。其中一个跨学科的领域就是关系秩序理论。|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. 虽然这已经导致一些领域提出了复杂性的具体定义，但是最近有一种运动重新组合来自不同领域的观察结果来研究复杂性本身，无论它是出现在蚁丘、人类大脑，还是股票市场、社会系统。其中一个跨学科的领域就是关系秩序理论。]].
6. "Sir James Lighthill and Modern Fluid Mechanics", by Lokenath Debnath, The University of Texas-Pan American, US, Imperial College Press: : , Singapore, page 31. Online at http://cs5594.userapi.com/u11728334/docs/25eb2e1350a5/Lokenath_Debnath_Sir_James_Lighthill_and_mode.pdfhttps://en.wikipedia.org/wiki/Defekte_Weblinks?dwl={{{url}}} Seite nicht mehr abrufbar], Suche in Webarchiven: Kategorie:Wikipedia:Weblink offline (andere Namensräume)[http://timetravel.mementoweb.org/list/2010/Kategorie:Wikipedia:Vorlagenfehler/Vorlage:Toter Link/URL_fehlt
7. 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. 这些复杂度的算法测量倾向于给随机噪声赋予较高的值。然而，那些研究复杂系统的人并不认为随机性就是复杂性。, Jane (1961 The complexity measures broadly cover: 复杂性指标大致涵盖:). [https://archive.org/details/deathlifeofgre00jaco 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. 信息论中有时也会用熵表示复杂性，但是熵的随机性也很高。信息波动的复杂性，熵信息的波动性，不考虑随机性的复杂性，已经在许多应用中得到应用。]. New York: Random House.
8. Ulanowicz, Robert, "Ecology, the Ascendant Perspective", Columbia, 1997
9. 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
10. Crutchfield, J.P.; Young, K. (1989). "Inferring statistical complexity". Physical Review Letters. 63 (2): 105–108. Bibcode:1989PhRvL..63..105C. doi:10.1103/PhysRevLett.63.105. PMID 10040781.
11. Crutchfield, J.P.; Shalizi, C.R. (1999). "Thermodynamic depth of causal states: Objective complexity via minimal representations". Physical Review E. 59 (1): 275–283. Bibcode:1999PhRvE..59..275C. doi:10.1103/PhysRevE.59.275.
12. Grassberger, P. (1986). "Toward a quantitative theory of self-generated complexity". International Journal of Theoretical Physics. 25 (9): 907–938. Bibcode:1986IJTP...25..907G. doi:10.1007/bf00668821. Unknown parameter |s2cid= ignored (help)
13. Prokopenko, M.; Boschetti, F.; Ryan, A. (2009). "An information-theoretic primer on complexity, self-organisation and emergence". Complexity. 15 (1): 11–28. Bibcode:2009Cmplx..15a..11P. doi:10.1002/cplx.20249.
14. A complex network analysis example: "Complex Structures and International Organizations" (Grandjean, Martin (2017). "Analisi e visualizzazioni delle reti in storia. L'esempio della cooperazione intellettuale della Società delle Nazioni". Memoria e Ricerca (2): 371–393. doi:10.14647/87204. See also: French version).
15. Mariusz Stanowski (2011) Abstract Complexity Definition, Complicity 2, p.78-83 [1]
16. Lissack, Michael R.; Johan Roos (2000). The Next Common Sense, The e-Manager's Guide to Mastering Complexity. Intercultural Press. .
17. Bastardas-Boada, Albert. "Complexics as a meta-transdisciplinary field". Congrès Mondial Pour la Pensée Complexe. Les Défis d'Un Monde Globalisé. (Paris, 8-9 Décembre). Unesco.
18. Ho, T.K.; Basu, M. (2002). "Complexity Measures of Supervised Classification Problems". IEEE Transactions on Pattern Analysis and Machine Intelligence 24 (3), pp 289–300.
19. Smith, M.R.; Martinez, T.; Giraud-Carrier, C. (2014). "An Instance Level Analysis of Data Complexity". Machine Learning, 95(2): 225–256.
20. Sáez, José A.; Luengo, Julián; Herrera, Francisco (2013). "Predicting Noise Filtering Efficacy with Data Complexity Measures for Nearest Neighbor Classification". Pattern Recognition. 46: 355–364. doi:10.1016/j.patcog.2012.07.009.
21. Jorg Grunenberg (2011). "Complexity in molecular recognition". Phys. Chem. Chem. Phys. 13 (21): 10136–10146. Bibcode:2011PCCP...1310136G. doi:10.1039/c1cp20097f. PMID 21503359.

Category:Abstraction

• {{cite journal

Category:Chaos theory

 | last = Chu


Category:Complex systems theory

 | first = Dominique


Category:Holism

 | title = Complexity: Against Systems


Category:Systems

 | journal = Theory in Biosciences


Category:Transdisciplinarity

This page was moved from wikipedia:en:Complexity. Its edit history can be viewed at 复杂性/edithistory