## GENERAL SYSTEMS THEORY: limits to its algorithmization
^{2)}^{3)}

← Back

N. KASKOV, quoted by I.V. BLAUBERG et al, "demonstrated that the following mass problems could not be solved in the framework of the general systems theory: – to construct

- an algorithm allowing to find all the elements of any given system;

- an algorithm allowing to find all the connections of any given system;

- an algorithm allowing to determine the structure of any given system;

- an algorithm allowing to determine all the functions realized by any given system" (1977, p.205).

Of course, neither could any other theory produce any such algorithms.

Such a result seems perfectly logical, in view of the massive non-linearity of complex systems, KASKOV's statements are quite interesting in relation to FORRESTER's Systems Dynamics and to Systems Analysis in general.

### Categories

- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented

### Publisher

Bertalanffy Center for the Study of Systems Science(2020).

To cite this page, please use the following information:

* Bertalanffy Center for the Study of Systems Science (2020).* Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]

We thank the following partners for making the open access of this volume possible: