Long-range dependencies in algorithmic computing

• Main Authors: Strzalka, D., Grabowski, F.
• Format: Conference Proceeding
• Language: English
• Subjects: Algorithm design and analysis; complex systems; Complexity theory; computer systems; Computers; Heuristic algorithms; long-range dependencies; Mathematical model; Noise; Sorting
• ISSN: 2158-2246
• DOI: 10.1109/HSI.2008.4581502

An article shows the problem of existence the long-range dependencies in algorithmic computing. A brilliant idea of Turing machine, which is the basis of all theoretical considerations in the contemporary computer engineering, seems to be, from the system analysis point of view, only a complicated system that works only under an algorithmic processing mode. Meanwhile, taking into account the physical structure, the character of realized tasks and the interactive processing mode of nowadays computer systems, one may concluded that they are complex systems, whose analysis requires a definitely different approach. It will be achievable when the widest possible context, which requires: the complex systems approach, the proper thermodynamical analysis and the knowledge about the idea of paradigms changes will be taken. In the case of computer science, where the paradigm of algorithmic computing is changed towards interactive computing the problem of existence long-range dependencies is crucial because such a property degrade the performance of computer systems. The ancient rule divide and conquer (reductionist approach) canpsilat be used in the case of complex systems, because they are governed by Aristotle rule the whole is more that sum of its parts. Thus the analysis of modern computer systems requires the understanding of general laws that govern it as a whole and also a different, system approach that takes into account the long-range dependencies in time and space domain.