On an irreducible theory of complex systems

@article{Korotkikh2010OnAI,
  title={On an irreducible theory of complex systems},
  author={Victor Korotkikh and Galina Korotkikh},
  journal={arXiv: Adaptation and Self-Organizing Systems},
  year={2010},
  pages={19-26}
}
Complex systems profoundly change human activities of the day and may be of strategic interest. As a result, it becomes increasingly important to have confidence in the theory of complex systems. Ultimately, this calls for clear explanations why the foundations of the theory are valid in the first place. The ideal situation would be to have an irreducible theory of complex systems not requiring a deeper explanatory base in principle. But the question arises: where could such a theory come from… 
3 Citations
From Space and Time to a Deeper Reality as a Possible Way to Solve Global Problems
TLDR
It is proposed 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.
Integration Principle as the Master Equation of the Dynamics of an Information System
TLDR
The integration principle is suggested as the master equation of the dynamics of an information system in the hierarchical network because it makes it possible to formulate a single universal objective of a complex system expressed in terms of the integration principle.
On principles in engineering of distributed computing systems
TLDR
Results of computational experiments are presented suggesting the possibility of a general optimality condition of complex systems, which introduces the structural complexity of a system as a key to its optimization.

References

SHOWING 1-9 OF 9 REFERENCES
DESCRIPTION OF COMPLEX SYSTEMS IN TERMS OF SELF-ORGANIZATION PROCESSES OF PRIME INTEGER RELATIONS
In the paper we present a description of complex systems in terms of self-organization processes of prime integer relations. A prime integer relation is an indivisible element made up of integers as
On Optimality Condition of Complex Systems: Computational Evidence
TLDR
The optimality condition provides a new perspective to the subject by recognizing that the relationship between certain quantities of the complex system and the problem may determine the optimal performance.
The Search for the Universal Concept of Complexity and a General Optimality Condition of Cooperative Agents
There are many different notions of complexity. However, complexity does not have a generally accepted universal concept. It is becoming more clear that the search for the universal concept must be
Can Relativity be Considered Complete? From Newtonian Nonlocality to Quantum Nonlocality and Beyond
We review the long history of nonlocality in physics with special emphasis on the conceptual breakthroughs over the last few years. (This was written at the end of Einstein’s year 2005, after Jurg
Systematic analysis of majorization in quantum algorithms
TLDR
It is concluded that step-by-step majorization is found in the known instances of fast and efficient algorithms, namely in the quantum Fourier transform, in Grover’s algorithm, in the hidden affine function problem, in searching by quantum adiabatic evolution and in deterministic quantum walks in continuous time solving a classically hard problem.
Green function identities in Euclidean quantum field theory
Given a generic Lagrangian system of even and odd fields, we show that any infinitesimal transformation of its classical Lagrangian yields the identities which Euclidean Green functions of quantum
Gennadi Sardanashvily, Green Function Identities in Euclidean Quantum Field Theory, arXiv:hep-th/0604003, and references therein
  • Gennadi Sardanashvily, Green Function Identities in Euclidean Quantum Field Theory, arXiv:hep-th/0604003, and references therein
Integer Code Series with Some Applications in Dynamical Systems and Complexity, Computing
  • Centre of the Russian Academy of Sciences,
  • 1993
Integer Code Series with Some Applications in Dynamical Systems and Complexity, Computing Centre of the Russian Academy of Sciences
  • Integer Code Series with Some Applications in Dynamical Systems and Complexity, Computing Centre of the Russian Academy of Sciences
  • 1993