In presentation there will be shown a possible statistical mechanics of proceses in computer systems considered as the complex ones. In the case of nowadays computer systems one can see that from one hand we have a growing complexity of processed input data but from the other hand one can also see a growing complexity of processing environment. Turing machine paradigm, which is commonly accepted as a mathematical model of almost all deliberations in computer science seems to be an "appriopraite" model of some deliberation due to the fact that this is only a mathematical idea that doesn't need energy for its normal work, while Turing machines implementations are physical systems that dissipate energy thus the problem of their efficiency and entropy production apperas. In presentation it will be shown that in the case if one simple sorting algorithm (understood also as Turing machine) there are possibilities of existence non-extensive entropy production levels.

• Legal notice:
  

  Copyright (c) Pielaszek Research, all rights reserved.
  The above materials, including auxiliary resources, are subject to Publisher's copyright and the Author(s) intellectual rights. Without limiting Author(s) rights under respective Copyright Transfer Agreement, no part of the above documents may be reproduced without the express written permission of Pielaszek Research, the Publisher. Express permission from the Author(s) is required to use the above materials for academic purposes, such as lectures or scientific presentations.
  In every case, proper references including Author(s) name(s) and URL of this webpage: https://science24.com/paper/17806 must be provided.

1. Influence of long-term dependencies on hard drives performance during human computer interaction
2. Long-range dependencies in quick-sorting
3. Fractal properties of Linux self-organized kernel maps