A resource model of complexity (RMC)
Aimo Törn, Thorbjorn Andersson, K. Enholm · WIT transactions on information and communication technologies · 1970
In this paper we will review proposed software complexity measures and explore what concepts might lay behind them. We will also look at proposed axioms of complexity measures and try to deduce what complexity concepts would comply with these. The result of this study will then be discussed relative to the length-independent measure RMC defined by w(P} = /(P)c(P), where P is any piece of software, w(P) the effort in developing it, l(P) its length, and c(P) its complexity. Application of RMC to both structured programming constructs and to collections of programs