Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
A 2001 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: