The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...

The shift of emphasis away from written to oral skills has stimulated an incipient concern in second language research to investigate ways of helping second and foreign language learners achieve higher degrees of oral proficiency. Priority solely taken over accuracy, complexity, or fluency of speech might be justifiable with regard to the context in which learning takes place.  Accuracy and com...

There is currently interest in measuring the complexity of a computer program with the evaluation of a program's control structure via its flowgraph representation. 1,2 How~ ever, the inclusion of the effects of data on these measures is often lacking. This paper proposes a new measure of program complexity that attempts to identify regions of lo~ cality by combining a contro~ structure approac...

We define a program size complexity function H∞ as a variant of the prefix-free Kolmogorov complexity, based on Turing monotone machines performing possibly unending computations. We consider definitions of randomness and triviality for sequences in {0, 1} relative to the H∞ complexity. We prove that the classes of Martin-Löf random sequences and H∞-random sequences coincide, and that the H∞-tr...

The complexity metrics has an important role in assessing the quality of source code. Obtainable complexity metrics is failed to accumulate precise system failure information. In this work proposes adequate complexity metrics for structural measure which collect the exact system information that cause the system failure in source code. Then, by censure McCabe’s cyclomatic number and the framewo...

We consider the problem of finding the maximum of a multivariate polynomial inside a convex polytope. We show that there is no polynomial time approximation algorithm for this problem, even one with a very poor guarantee, unless P = NP. We show that even when the polynomial is quadratic (i.e. quadratic programming) there is no polynomial time approximation unless NP is contained in quasi-polyno...

Module checking is a well investigated technique for verifying the correctness of open systems, which are systems characterized by an ongoing interaction with an external environment. In the classical module checking framework, in order to check whether an open system satisfies a required property, we first translate the entire system into an open model (module) that collects all possible behav...

This short work in progress paper presents a series of experiments that are intended to explore two related research questions. The first research question is whether software complexity metrics have a cognitive basis or are ‘real’ in a psychological sense. The second research question aims to explore in greater detail how programmer memory may relate to measures of spatial software complexity....