For more than a decade, metrics of software complexity has been an intriguing topic for discussion. Many metrics have been proposed. Among them, the cyclomatic complexity metric is the easiest to understand and compute. In this paper, the cyclomatic complexity metric and its extensions are reviewed. The strengths and weaknesses of the cyclomatic metric are identified. One of the major weaknesse...

This paper describes self-organized complexity of an ecosystem consisting of computer programs that exhibit life-like behavior. As an artificial life approach to simulating the life-like behavior on a computer, attention should be given to the emergent dynamics by which a new action is brought forth. In considering how to implement such a notion onto a computer, it could be interpreted as the g...

In this paper, we show that while almost all functions require exponential size branching programs to compute, for all functions f there is a branching program computing a doubly exponential number of copies of f which has linear size per copy of f . This result disproves a conjecture about non-uniform catalytic computation, rules out a certain type of bottleneck argument for proving non-monoto...

Polynomial interpretations and their generalizations like quasi-interpretations have been used in the setting of first-order functional languages to design criteria ensuring statically some complexity bounds on programs [8]. This fits in the area of implicit computational complexity, which aims at giving machine-free characterizations of complexity classes. In this paper, we extend this approac...

In 1944, E. Post proposed a program that would lead to the identi cation of separate degrees equivalence classes de ned by reductions of recursively enumerable sets. Post proposed to identify structural properties that sets of di erent degrees would not share. Thus proving that some sets in one degree have such a property, and all sets in another degree do not have the property would imply that...

Previous studies on writing and understanding programs presented evidence that programmers beyond a novice stage utilize plans or plan-like structures. Other code composition showed learners have difficulties with writing, reading, debugging where interacting are merged into short piece of code. In this article, we focus the question how different code-composition strategies familiarity affect ...