Abstract
Computational complexity was introduced and developed by Hartmanis and Stearns in order to provide methods in measuring the degree of complexity or difficulty of computational problems or functions as well as to measure the efficiency of algorithms. It was developed through understanding of numerous complex problems and analysis of the issues within these problems. The history of the subject of computational history started with the theoretical computational model or a machine developed by Alan Turing in during the 1930s. In his paper, he convinced the scientific community that developing an effective algorithm is possible. The Turing machine paved way ...