Non-extensive statistical mechanics of processes in computer systems Nie-ekstensywna mechanika statystyczna procesów w systemach komputerowych
Rzeszow University of Technology, Rzeszów, Poland
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.
Presentation: Oral at 4 Ogólnopolskie Sympozjum "Fizyka w Ekonomii i Naukach Społecznych", by Dominik Strzałka
See On-line Journal of 4 Ogólnopolskie Sympozjum "Fizyka w Ekonomii i Naukach Społecznych"
Submitted: 2009-01-28 14:17 Revised: 2009-06-07 00:48