preview

Complexity And Algorithms That Can Take An Impossible Amount Of Computation

Good Essays

Complexity and Tractability
The area of tractability explores problems and algorithms that can take an impossible amount of computation to solve. Tractable problems can be roughly defined as problems that can be solved in a reasonable amount of time, while intractable problems are those which take too long to solve to be useful. Finding solutions to these problems is a key problem in computer science today and has been for many years. It is also important for a computer scientist to recognise intractable problems as it would be a huge waste of time trying to write a program to an intractable problem. It would be better to recognise this and take a different more suitable approach that would save time and effort but also would come up with a valid solution. However there are advantages to making a problem intractable though as when securing things using intractable codes which cannot be hacked into easily. Complexity can be simply defined as a rough estimation of amount of time it takes a particular algorithm to solve a problem. This is not only measured in time but can be expressed as the number of steps taken in order to solve a problem. It is important to be able to measure the complexity of a problem as this can help to indicate how good/effective an algorithm will be and whether it is tractable or not.One of the most popular intractable problems that has been found is the Traveling Salesman problem. This problem represents a salesman who wants to find the shortest

Get Access