Computational resource

<h2 id="describing-generally-accessible-computing-equipment">Describing generally accessible computing equipment</h2>
<p>The term "Computational resource" is commonly used to describe accessible computing equipment and software.  See <a href="/facts/Utility_computing/VoIk5vf3">Utility computing</a>.
</p>
<h2 id="formal-quantification-of-computing-capability">Formal quantification of computing capability</h2>
<p>There has been some effort to formally quantify computing capability. A bounded <a href="/facts/Turing_machine/ojCtglYu">Turing machine</a> 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.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a><a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a>
</p>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>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. <a href="/wiki/Gregory_J._Chaitin" target="_blank">/wiki/Gregory_J._Chaitin</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>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. <a href="0-7803-5148-7" target="_blank">0-7803-5148-7</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Computational resource open-in-new

Computational resource