{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:18:46Z","timestamp":1760242726673,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2016,3,12]],"date-time":"2016-03-12T00:00:00Z","timestamp":1457740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Despite the fact that much has been said about processing in computer science, it seems that there is still much to do. A classical approach assumes that the computations done by computers are a kind of mathematical operation (calculations of functions values) and have no special relations to energy transformation and flow. However, there is a possibility to get a new view on selected topics, and as a special case, the sorting problem is presented; we know many different sorting algorithms, including those that have complexity equal to                                        O(n lg(n))                                 , which means that this problem is algorithmically closed, but it is also possible to focus on the problem of sorting in terms of flow control, entropy and statistical mechanics. This is done in relation to the existing definitions of sorting, connections between sorting and ordering and some important aspects of computer processing understood as a flow that are not taken into account in many theoretical considerations in computer science. The proposed new view is an attempt to change the paradigm in the description of algorithms\u2019 performance by computational complexity and processing, taking into account the existing references between the idea of Turing machines and their physical implementations. This proposal can be expressed as a physics of computer processing; a reference point to further analysis of algorithmic and interactive processing in computer systems.<\/jats:p>","DOI":"10.3390\/e18030093","type":"journal-article","created":{"date-parts":[[2016,3,14]],"date-time":"2016-03-14T11:03:45Z","timestamp":1457953425000},"page":"93","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Selected Remarks about Computer Processing in Terms of Flow Control and Statistical Mechanics"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8887-4321","authenticated-orcid":false,"given":"Dominik","family":"Strza\u0142ka","sequence":"first","affiliation":[{"name":"Department of Power Electronics, Power Engineering and Complex Systems, Rzesz\u00f3w University of Technology, Al. Powsta\u0144c\u00f3w Warszawy 12, 35-959 Rzesz\u00f3w, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,3,12]]},"reference":[{"key":"ref_1","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. Lond. Math. Soc."},{"key":"ref_2","unstructured":"Wegner, P. (1976, January 13\u201315). Research paradigms in computer science. Proceedings of the 2nd International Conference on Software Engineering, San Francisco, CA, USA."},{"key":"ref_3","unstructured":"Papadimitriou, C.H. (1993). Computational Complexity, Addison Wesley."},{"key":"ref_4","unstructured":"Penrose, R. (1990). The Emperor\u2019s New Mind, Oxford University Press. [2nd ed.]."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.3390\/e16042278","article-title":"Going Round in Circles: Landauer vs. Norton on the Thermodynamics of Computation","volume":"16","author":"Ladyman","year":"2014","journal-title":"Entropy"},{"key":"ref_6","unstructured":"Hor\u00e1kow\u00e1, J., and Kelemen, J. (2003, January 10\u201312). \u010capek, Turing, von Neumann, and the 20th Century Evolution of the Concept of Machine. Proceedings of the International Conference in Memoriam John von Neumann, John von Neumann Computer Society, Budape\u0161\u0165, Hungary."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Waldrop, M.M. (1992). Complexity: The Emerging Science at the Edge of Order and Chaos, Simon and Schuster.","DOI":"10.1063\/1.2809917"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/641205.641235","article-title":"Computation Beyond Turing Machines","volume":"46","author":"Wegner","year":"2003","journal-title":"Commun. ACM"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Teuscher, C.H. (2005). Turing\u2019s Ideas and Models of Computation, in Alan. Turing: Life and Legacy of a Great Thinker, Springer-Verlag.","DOI":"10.1007\/978-3-662-05642-4"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Goldin, D., and Wegner, P. (2005). The Church-Turing Thesis: Breaking the Myth, Springer. Lecture Notes in Computer Science 3526.","DOI":"10.1007\/11494645_20"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/253769.253801","article-title":"Why Interaction is More Powerful Than Algorithms","volume":"40","author":"Wegner","year":"1997","journal-title":"Commun. ACM"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1007\/BF02084158","article-title":"The Thermodynamics of Computation\u2014A Review","volume":"21","author":"Bennett","year":"1982","journal-title":"Int. J. Theor. Phys."},{"key":"ref_13","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (1994). Introduction to Algorithms, MIT Press."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Daintith, J., and Wright, E. (2008). A Dictionary of Computing, Oxford University Press.","DOI":"10.1093\/acref\/9780199234004.001.0001"},{"key":"ref_15","unstructured":"Laplante, P.A. (2000). Dictionary of Computer Science, Engineering and Technology, CRC Press."},{"key":"ref_16","unstructured":"Cambridge Dictionaries. Available online: http:\/\/dictionary.cambridge.org."},{"key":"ref_17","unstructured":"Collins English Dictionary\u2014Complete & Unabridged 10th Edition. Available online: http:\/\/dictionary.reference.com\/browse\/order."},{"key":"ref_18","unstructured":"Knuth, D.E. (1973). The Art of Computer Programming, Addison-Wesley."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"4863","DOI":"10.3390\/e17074863","article-title":"Entropy, Information and Complexity or Which Aims the Arrow of Time?","volume":"17","author":"Mikhailovsky","year":"2015","journal-title":"Entropy"},{"key":"ref_20","first-page":"203","article-title":"Paradigms evolution in computer science","volume":"6","year":"2010","journal-title":"Egitania Sci."},{"key":"ref_21","first-page":"1","article-title":"Dynamical interaction between input data and simple insertion sort algorithm","volume":"27","year":"2016","journal-title":"Int. J. Math. Comput."},{"key":"ref_22","first-page":"1193","article-title":"Entropy as Computational Complexity","volume":"5","author":"Takaoka","year":"2010","journal-title":"Inf. Media Technol."},{"key":"ref_23","unstructured":"Shah, D., and Sharma, M. Entropy and Complexity. Available online: http:\/\/www.hpl.hp.com\/techreports\/2000\/HPL-BRIMS-2000-32.html?jumpid=reg_R1002_USEN."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1142\/S0129183108013011","article-title":"Towards possible non-extensive thermodynamics of algorithmic processing\u2014Statistical mechanics of insertion sort algorithm","volume":"19","author":"Grabowski","year":"2008","journal-title":"Int. J. Mod. Phys. C"},{"key":"ref_25","unstructured":"Prigogine, I., and Stengers, I. (1984). Order out of Chaos: Man\u2019s New Dialogue with Nature, Flamingo Edition, Bantam Books."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1103\/PhysRev.37.405","article-title":"Reciprocal Relations in Irreversible Processes. I","volume":"37","author":"Onsager","year":"1931","journal-title":"Phys. Rev."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1590\/S0103-97331999000100002","article-title":"Nonextensive Statistics: Theoretical, Experimental and Computational Evidences and Connections","volume":"29","author":"Tsallis","year":"1999","journal-title":"Braz. J. Phys."},{"key":"ref_28","first-page":"149","article-title":"Long-range dependencies in quick-sort algorithm","volume":"90","author":"Dymora","year":"2014","journal-title":"Electr. Rev."},{"key":"ref_29","unstructured":"Eisner, J. State-of-the-art algorithms for minimum spanning trees. Available online: https:\/\/www.cs.jhu.edu\/jason\/papers\/eisner.mst-tutorial.pdf."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0196-6774(03)00046-4","article-title":"Average-case complexity of single-source shortest-paths algorithms: Lower and upper bounds","volume":"48","author":"Meyer","year":"2003","journal-title":"J. Algorithms"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/18\/3\/93\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:20:38Z","timestamp":1760210438000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/18\/3\/93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,12]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,3]]}},"alternative-id":["e18030093"],"URL":"https:\/\/doi.org\/10.3390\/e18030093","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2016,3,12]]}}}