Computational Complexity Theory : Basics

Computational complexity theory theoretically deals with problems to be treated in mathematically defined computer models,like use of resources or storage space. Computational Complexity is the attempt to define the set of efficiently solvable ways for inherently difficult problems.

 

Basics of Computational Complexity Theory

 

Computational Complexity Theory differs from computability theory, which deals with the question of which problems can be solved algorithmically. In contrast, the most important research goal of Computational Complexity Theory is to classify the set of all solvable problems. In particular, one tries to define the set of efficiently solvable problems on the amount of inherently difficult problems.

If you are feeling sleepy after reading the teeth grinding technical words, one practical usage can be – the simple bar visualizer of any music player software – the specific bars go up and down, not to make a graphically entertaining thing but it actually involves quite complex process behind and behind it Computational Complexity Theory works. In our normal computers with free softwares they actually lags by few milliseconds, in professional sound setup, this is purely real time calculation.

 

Importance of Computational Complexity Theory

 

 

Computational Complexity Theory is really quite complex and has various models. Computational Complexity Theory can be compared with basic Laws of Physics like Newton’s laws of motion. Like the Third law, When two bodies interact by exerting force on each other, these forces are equal in magnitude, but opposite in direction. This is probably not funny for a student to read and memorize these for exam purposes. But the ultimate goal of education is to make few persons who can apply these for further improvement of human life, in some way or the other.

Computational Complexity Theory expresses problems as formal languages like, if 5 peoples are there in a room and one left the room, then how many peoples remained. Its an easy example, the equivalent mathematical expression would be (5-1)=4.

Computational Complexity Theory can do calculation of problems in which logarithm and functions of Calculus are used. Basically the example of simple bar visualizer of any music player software was visual expression of few log charts that is constantly changing.

 

As biological sciences started to merge very prominently since 1950s, especially when Human Genome Project was planned, Computational Complexity Theory became an internal part of these research processes. Moreover, on advanced biological sciences, like we published the hypothesis of Mind Uploading, the basic models of Computational Complexity Theory is of critical usage. Its not possible to explain why Newton’s laws of motion are important, if someone never applied them after proper understanding, Computational Complexity Theory is somewhat closer as we have said before.

 

 

Tagged With Computational Complexity models , describe how computation complexity theory provides the theoretical basis for the design of modern scalable crypsystem