Computational resource

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Not to be confused with Resource (computer science).

In computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems.

The simplest computational resources are computation time, the number of steps necessary to solve a problem, and memory space, the amount of storage needed while solving the problem, but many more complicated resources have been defined.[citation needed]

A computational problem is generally[citation needed] defined in terms of its action on any valid input. Examples of problems might be "given an integer n, determine whether n is prime", or "given two numbers x and y, calculate the product x*y". As the inputs get bigger, the amount of computational resources needed to solve a problem will increase. Thus, the resources needed to solve a problem are described in terms of asymptotic analysis, by identifying the resources as a function of the length or size of the input. Resource usage is often partially quantified using Big O notation.

Computational resources are useful because we can study which problems can be computed in a certain amount of each computational resource. In this way, we can determine whether algorithms for solving the problem are optimal and we can make statements about an algorithm's efficiency. The set of all of the computational problems that can be solved using a certain amount of a certain computational resource is a complexity class, and relationships between different complexity classes are one of the most important topics in complexity theory.

Describing generally accessible computing equipment[edit]

The term "Computational resource" is commonly used to describe accessible computing equipment and software. See Utility computing.

Formal quantification of computing capability[edit]

There has been some effort to formally quantify computing capability. A bounded Turing machine has been used to model specific computations using the number of state transitions and alphabet size to quantify the computational effort required to solve a particular problem.[1][2]

References[edit]

  1. ^ Gregory J., Chaitin (1966). "On the Length of Programs for Computing Finite Binary Sequences". Journal of the ACM (JACM) 13 (4): 547–569. doi:10.1145/321356.321363. Retrieved 2007-09-25. 
  2. ^ Sow, Daby; Eleftheriadis, Alexandros (1998). "Representing Information with Computational Resource Bounds". "Signals, Systems & Computers. Conference Record of the Thirty-Second Asilomar". Volume 1. pp. 452–456. ISBN 0-7803-5148-7. 10.1109/ACSSC.1998.750904. Retrieved 2007-09-25.