Essential complexity has been defined in various ways by various people. One definition is as an antonym to accidental complexity. Another definition is a number attempting to measure how close (or far) a given program is from being a structured program.
Antonym to accidental complexity
Essential complexity refers to a situation where all reasonable solutions to a problem must be complicated (and possibly confusing) because the "simple" solutions would not adequately solve the problem.[citation needed] It stands in contrast to accidental complexity, which arises purely from mismatches in the particular choice of tools and methods applied in the solution.
This term has been used since, at least, the mid-1980s. Turing Award winner Fred Brooks has used this term and its antonym of accidental complexity since the mid-1980s. He has also updated his views in 1995 for an anniversary edition of Mythical Man-Month, chapter 17 "'No Silver Bullet' Refired".[1][2][3] [4]
Measure of a closeness to being a structured program
Essential complexity is also used with a different meaning in connection with cyclomatic complexity. In this context, essential complexity refers to the cyclomatic complexity after iteratively replacing all well structured control structures with a single statement. Structures such as if-then-else and while loops are considered well structured and then do not increase the essential cyclomatic complexity. Unconstrained use of goto, break and continue statements can produce programs which can not be reduced in this way.
However, the structured program theorem proves that goto is never necessary; any program including goto can be re-written as an equivalent program that does not contain goto. Hence, this sense of essential complexity is not essential.
For example, the following C program fragment has an essential complexity of 1, because the inner if statement and the for can be reduced:
for(i=0;i<3;i++) {
if(a[i] == 0) b[i] += 2;
}
The following C program fragment has an essential complexity of more than one. It finds the first row of z which is all zero and puts that index in i; if there is none, it puts -1 in i.
for(i=0;i<m;i++) {
for(j=0;j<n;j++) {
if(z[i][j] != 0) goto non_zero;
}
goto found;
non_zero:
}
i = -1;
found:
See also
- History of software engineering
- Software prototyping (one of the main strategies against essential complexity in "No Silver Bullet")
- Decision-to-decision path
- Occam's Razor
- No silver bullet
- Cyclomatic complexity
References
- ^ Brooks, Proc. IFIP
- ^ Brooks, IEEE Computer
- ^ Brooks, Mythical Man-Month, Silver Bullet Refired
- ^ McCabe, Watson (1996). "Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric Chapter 10: Essential Complexity".
Further reading
For the first sense of the term:
- Brooks, Fred P. (1986). "No Silver Bullet - Essence and Accident in Software Engineering". Proceedings of the IFIP Tenth World Computing Conference: 1069–1076.
- Brooks, Fred P. (April 1987). "No Silver Bullet - Essence and Accidents of Software Engineering". IEEE Computer. 20 (4): 10–19.
{{cite journal}}: Unknown parameter|authormask=ignored (|author-mask=suggested) (help)
- Brooks, Fred P. (1995). "Chap. 17". 'No Silver Bullet' Refired (Anniversary Edition with four new chapters ed.). Addison-Wesley. ISBN 0-201-83595-9.
{{cite book}}:|work=ignored (help); Unknown parameter|authormask=ignored (|author-mask=suggested) (help)