Worth having a look at http://scribblethink.org/Work/Softestim/kcsest.pdf,
which attempts to demonstrate:"Algorithmic (KCS) complexity results can be interpreted as indicating some limits to software estimation. While these limits are abstract they nevertheless contradict enthusiastic claims occasionally made by commercial software estimation advocates. Specifically, if it is accepted that algorithmic complexity is an appropriate definition of the complexity of a programming project, then claims of purely objective estimation of project complexity, development time, and programmer productivity are necessarily incorrect."Which effectively means it's impossible to predict cost / timelines for sufficiently complex problems, without actually doing the problem. A bit of a 'duuh' maybe for those here, but it's still nice to have this backed up by a fancy paper with a cool mathematical proof. Ian On 12/1/2013, 4:13 AM, Ihe Onwuka
wrote:
-- Ian Graham // <http://www.iangraham.org> |