ALGORITHMS THAT CANNOT BE CONSTRUED
Charles François (2004). ALGORITHMS THAT CANNOT BE CONSTRUED, International Encyclopedia of Systems and Cybernetics, 2(1): 84.
| Collection | International Encyclopedia of Systems and Cybernetics |
|---|---|
| Year | 2004 |
| Vol. (num.) | 2(1) |
| ID | ◀ 84 ▶ |
| Object type | Epistemology, ontology or semantics |
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.