Abstract
In order to find out the limiting speed of solving a specific problem using computer, this essay provides a method based on the entropy of information. The relationship between the minimum time complexity and the information entropy change is illustrated. Several examples are served as evidence of such connection. Meanwhile some notices of modeling these problems are proposed. Finally, the nature of solving problems with computer programs is disclosed to support the theory and a redefinition of the information entropy in this field is proposed. This will develop a new field of science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gang, C.: Shannon Information Model in E-commerce Information Analysis. In: International Joint Conference on Artificial Intelligence, pp. 580–583 (2009)
Verdú, S.: Fifty Years of Shannon Theory. IEEE Transactions on Information Theory 44(6), 2057–2078 (1998)
Wang, Y.: Analyses on Limitations of Information Theory. In: International Conference on Artificial Intelligence and Computational Intelligence, pp. 85–88 (2009)
Shannon, C.E.: A Mathematical Theory of Communication. Bell System Technical Journal 27, 379–429, 623–656 (1948)
Shannon, C.E.: The Bandwagon. IEEE Transactions on Information Theory 2, 3 (1956)
Hatfield, A.J., Hipel, K.W.: Understanding and Managing Uncertainty and Information. In: IEEE International Conference on System, Man and Cybernetics, pp. 1007–1012 (1999)
Zhao, M., Ye, X., Han, K., Li, Y.: Research on Digital Image Edge Detection with Local Entropy and Fuzzy Entropy Algorithms. In: IEEE International Conference on Information and Automation (ICIA), pp. 2477–2482 (2010)
Xie, X., Zang, X.-Y., Guan, Z.-L.: Analytic Demonstration on the Irrationality of Negative Entropy Principle. In: International Conference on Management Science and Engineering, pp. 109–115 (2008)
Wang, X., Ge, Y., Wang, X.: Research on Manthematical Theory of Information Acquisition. In: Proceedings of International Conference on Information Acquisition, pp. 59–70 (2004)
Iqbal, S.Z., Gull, H., Muzaffar, A.W.: A New Friends Sort Algorithm. In: 2nd IEEE International Conference on Computer Science and Information Technology, pp. 326–329 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
WU, X. (2012). Calculation of the Minimum Time Complexity Based on Information Entropy. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Computer Science and Engineering. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27308-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-27308-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27307-0
Online ISBN: 978-3-642-27308-7
eBook Packages: Computer ScienceComputer Science (R0)