Dynamics of Algorithmic Processing in Computer Systems

This paper presents a new analytical and experimental approach to the insertion sort algorithm and task processing dynamics. The dependencies that exist in the task structure can influence the algorithm’s behavior, especially in the number of dominant operations that are needed to compute the computational complexity. The proposed approach is based on a Tsallis definition of entropy suitable for all systems that are far from thermodynamical equilibrium. The ideas presented show how a complex systems approach can provide a good perspective for analyzing the processing dynamics of computer systems that are no longer simple.

[1]  Leonid A. Levin.  Problems, complete in “average” instance , 1984, STOC '84.

[2]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[3]  C. Tsallis,et al.  Statistical-mechanical foundation of the ubiquity of Lévy distributions in Nature. , 1995, Physical review letters.

[4]  Jeremy Smith,et al.  RandScape: Complex Images from Simple Algorithms , 2002, Artificial Life.

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Peter Wegner,et al.  Computation beyond turing machines , 2003, CACM.

[7]  Franciszek Grabowski,et al.  TOWARDS POSSIBLE NON-EXTENSIVE THERMODYNAMICS OF ALGORITHMIC PROCESSING — STATISTICAL MECHANICS OF INSERTION SORT ALGORITHM , 2008 .

[8]  Jie Wang,et al.  Average-case computational complexity theory , 1998 .

[9]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[10]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[11]  B. Mandelbrot.  How Long Is the Coast of Britain? Statistical Self-Similarity and Fractional Dimension , 1967, Science.

[12]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[13]  R. Rohwer.  Order out of Chaos: Man's New Dialogue with Nature , 1986 .

[14]  Mike Mannion,et al.  Complex systems , 1997, Proceedings International Conference and Workshop on Engineering of Computer-Based Systems.

[15]  A. Church.  Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

[16]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[17]  M. Rabin.  Degree of difficulty of computing a function and a partial ordering of recursive sets , 1960 .