## ALGORITHMS THAT CANNOT BE CONSTRUED
^{3)}

← Back

N. KASKOV "demonstrated that the following mass problems could not be solved in the framework of the General System Theory:

- to construe an algorithm allowing to find all the elements of a given system

- to construe an algorithm allowing to find all the connections of a given system

- to construe an algorithm allowing to determine the structure of a given system

- to construe an algorithm allowing to determine all the functions realized by any given system (even if one knows its elements, connections and structures)" (BLAUBERG, SADOVSKY & YUDIN, 1977, p.205)

Any complex system seems to contain a power for innovative and unpredictable variations, due probably to its relatively open character.

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