Calculation of the minimum time complexity based on information entropy

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2012.

Cite

CITATION STYLE

APA

Wu, X. (2012). Calculation of the minimum time complexity based on information entropy. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 85, pp. 376–385). https://doi.org/10.1007/978-3-642-27308-7_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free