The Search for the Universal Concept of Complexity and a General Optimality Condition of Cooperative Agents

Korotkich, Victor

doi:10.1007/978-1-4757-3758-5_8

Cited by 3 publications

(10 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For this purpose each agent in choosing the next strategy follows an optimal fuzzy if-then rule (Korotkikh 1999(Korotkikh , 2004 which relies on the Prouhet-Thue-Morse (PTM) sequence. The PTM sequence…”

Section: On Optimality Condition Of Complex Systemsmentioning

confidence: 99%

“…However, they can not explain in general how the performance of a system may depend on its complexity and provide an optimality condition with practical instructions for efficient management. The idea of the computational experiments presented in the next section is to investigate whether the concept of structural complexity could make a difference (Korotkikh 2003;.…”

Section: The Concept Of Structural Complexitymentioning

confidence: 99%

“…Extensive computational experiments have been conducted (Korotkikh 2003; by using the problems of a class P={eil76, eil101, st70, rat195, lin105, kroC100, kroB100, kroA100, kroD100, d198, kroA150, pr107, u159, pr144, pr144, pr152, pr226, pr136, pr76, ts225} selected from the benchmark traveling salesman problems (Reinelt 2000).…”

Section: On Optimality Condition Of Complex Systemsmentioning

confidence: 99%

“…The partial order is built by the self-organization processes starting at the zero level and following different interconnected paths on the way to organize themselves nevertheless monotonically according to the levels progressed (Korotkikh 1999). Computational experiments based on the concept of structural complexity suggest the possibility of a general optimality condition with practical instructions for efficient optimization of complex systems (Korotkikh 2003;.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On principles in engineering of distributed computing systems

Korotkikh

2007

Soft Comput

View full text Add to dashboard Cite

Engineering of distributed computing systems requires understanding of principles of complex systems, which have not been yet identified. To address the situation we use a concept of structural complexity and present results of computational experiments suggesting the possibility of a general optimality condition of complex systems. The optimality condition introduces the structural complexity of a system as a key to its optimization.

show abstract

Section: On Optimality Condition Of Complex Systemsmentioning

confidence: 99%

Section: The Concept Of Structural Complexitymentioning

confidence: 99%

Section: On Optimality Condition Of Complex Systemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On principles in engineering of distributed computing systems

Korotkikh

2007

Soft Comput

View full text Add to dashboard Cite

show abstract

“…To address the situation we conducted computational experiments to investigate whether the concept of structural complexity could make a difference [7], [8].…”

Section: Structural Complexity In Optimality Condition Of Complexmentioning

confidence: 99%

On an irreducible theory of complex systems

Korotkikh

2010

Unifying Themes in Complex Systems

View full text Add to dashboard Cite

In the paper we present results to develop an irreducible theory of complex systems in terms of selforganization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes can describe complex systems by information not requiring further explanations. Important properties of the description are revealed. It points to a special type of correlations that do not depend on the distances between parts, local times and physical signals and thus proposes a perspective on quantum entanglement. Through a concept of structural complexity the description also computationally suggests the possibility of a general optimality condition of complex systems. The computational experiments indicate that the performance of a complex system may behave as a concave function of the structural complexity. A connection between the optimality condition and the majorization principle in quantum algorithms is identified. A global symmetry of complex systems belonging to the system as a whole, but not necessarily applying to its embedded parts is presented. As arithmetic fully determines the breaking of the global symmetry, there is no further need to explain why the resulting gauge forces exist the way they do and not even slightly different.

show abstract

From Space and Time to a Deeper Reality as a Possible Way to Solve Global Problems

Korotkikh,

Korotkikh

2011

Preprint

View full text Add to dashboard Cite

To deal with global problems we suggest to consider complex systems not in space and time, but in a possible deeper reality, i.e., the hierarchical network of prime integer relations. Encoded by arithmetic through the self-organization processes the hierarchical network appears as the mathematical structure of one harmonious and interconnected whole. Remarkably, the holistic nature of the hierarchical network allows to formulate a single universal objective of a complex system defined in terms of the integration principle. We propose that by the realization of the integration principle the Earth system could be transformed to become an integrated part of a larger system with more capacity and energy to sustain life. Significantly, based on integers and controlled by arithmetic only the hierarchical network has a unique potential to provide an irreducible common ground fully trusted by different parties and helping to reveal a higher collective purpose.

show abstract

The Search for the Universal Concept of Complexity and a General Optimality Condition of Cooperative Agents

Cited by 3 publications

References 25 publications

On principles in engineering of distributed computing systems

On principles in engineering of distributed computing systems

On an irreducible theory of complex systems

From Space and Time to a Deeper Reality as a Possible Way to Solve Global Problems

Contact Info

Product

Resources

About