Effectivity and Efficiency
Journal title PARADIGMI
Author/s Paolo Zellini
Publishing Year 2011 Issue 2011/3
Language Italian Pages 15 P. 73-87 File size 522 KB
DOI 10.3280/PARA2011-003006
DOI is like a bar code for intellectual property: to have more infomation
click here
Below, you can see the article first page
If you want to buy this article in PDF format, you can do it, following the instructions to buy download credits
FrancoAngeli is member of Publishers International Linking Association, Inc (PILA), a not-for-profit association which run the CrossRef service enabling links to and from online scholarly content.
The aim of this paper is to identify a concept of "computational efficiency", to be added as a requirement to the "effectiveness" of an algorithmic process. An algorithm must be computationally efficient mainly in the sense that it must satisfy certain computational complexity bounds, as well as certain error bounds concerning the approximation of exact operations by machine operations. The paper analyzes the meaning of efficiency in relation to some of the main trends in last century mathematics and computer science, such as the arithmetization of analysis, the science of algorithms developed after the design of the first digital computers, and the development of applied mathematics in the last decades.
Keywords: Algorithm, Computational complexity, Effectiveness, Efficiency, Error, Large-scale computation
Paolo Zellini, Effettività ed efficienza in "PARADIGMI" 3/2011, pp 73-87, DOI: 10.3280/PARA2011-003006