Computational resource
 | This article needs additional citations for verification. (September 2007) |
In computational complexity theory, "'Computational resource" (Template:Lang-en) means the resources consumed to solve a specific problem under a specific computational model.
The simplest computing resources are calculation time, which calculates the number of steps it takes to solve a specific problem; and "'Memory space"', which defines the space it takes to solve the problem. However, there are also many more complex definitions of computing resources. It is very useful to discuss computing resources because we can use it to study which questions can be answered with a given computing resource. In this way, we can decide which algorithms are the best, and there are ways to discuss the efficiency of algorithms. We call a collection that contains all the problems that can be solved with a specific number of resources a complexity class. The relationship between different complexity classes is a very important research area in computational complexity theory. ==Describe the available equipment of computers in a broad sense== Resources This term is often used to describe the equipment and software of actual computers. This is not the same as discussing the computational resources of computational complexity theory, but it has its relevance. == Formal quantification of computer computing power == Many studies have been conducted on how to formally define computer computing power. To define a specific computing power, we can use a restricted Turing machine; for example, to discuss the number of states required by the Turing machine to solve a specific problem and the size of the alphabet. [1][2] == Reference Materials==
- ^ Gregory J., Chaitin (1966). "On the Length of Programs for Computing Finite Binary Sequences" (PDF). Journal of the ACM (JACM). 13 (4): 547–569. doi:10.1145/321356.321363. Archived from the original (PDF) on 2007-02-05. Retrieved 2007-09-25.
{{cite journal}}: Unknown parameter|deadurl=ignored (|url-status=suggested) (help) - ^ Sow, Daby (1998). "Representing Information with Computational Resource Bounds" (PDF). Signals, Systems & Computers. Conference Record of the Thirty-Second Asilomar. Vol. Volume 1. pp. 452–456. ISBN 0780351487. 10.1109/ACSSC. 1998.750904. Archived from the original (PDF) on 2017-09-21. Retrieved 2007-09-25.
{{cite conference}}:|volume=has extra text (help); Unknown parameter|booktitle=ignored (|book-title=suggested) (help); Unknown parameter|coauthors=ignored (|author=suggested) (help); Unknown parameter|dead-url=ignored (|url-status=suggested) (help)CS1 maint: date and year (link)
Describing generally accessible computing equipment
The term "Computational resource" is commonly used to describe accessible computing equipment and software. See Utility computing.
Formal quantification of computing capability
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
- ^ Gregory J., Chaitin (1966). "On the Length of Programs for Computing Finite Binary Sequences" (PDF). Journal of the ACM. 13 (4): 547–569. doi:10.1145/321356.321363. S2CID 207698337. Archived from the original (PDF) on 2007-02-05. Retrieved 2007-09-25.
- ^ Sow, Daby; Eleftheriadis, Alexandros (1998). "Representing Information with Computational Resource Bounds" (PDF). Signals, Systems & Computers. Conference Record of the Thirty-Second Asilomar Conference on. Vol. 1. pp. 452–456. ISBN 0-7803-5148-7. 10.1109/ACSSC.1998.750904. Retrieved 2007-09-25.