This paper examines the assumption that we continuously while listening tend to focus on the most complex (least repetitive) voice, experiencing this as foreground. We present a computational model calculating the level of attraction a voice in a score is likely to require at a given time. The model is based on a music information complexity measure. Calculating the complexity in each voice ove...

Proof complexity is the study of non-deterministic computational models, called proof systems, for proving that a given formula of propositional logic is unsatisfiable. As one of the subfields of computational complexity theory, the main questions of study revolve around the amount of resources needed to prove the unsatisfiability of various formulas in different proof systems. This line of inq...

Many studies have noted significant differences among human electroencephalograph (EEG) results when participants or patients are exposed to different stimuli, undertaking different tasks, or being affected by conditions such as epilepsy or Alzheimer's disease. Such studies often use only one or two measures of complexity and do not regularly justify their choice of measure beyond the fact that...

A b s t r a c t The f i r s t p a r t of t h i s paper g i v e s r e s u l t s about promise problems. A "promise problem" i s a formulation of a p a r t i a l d e c i s i o n problem t h a t i s u s e f u l f o r d e s c r i b i n g cracking problems f o r public-key cryptosystems (PKCS). We prove t h a t every NP-hard promise problem i s uniformly NP-hard, and w e show t h a t a number of r e...

We test sensitivity and powerfulness of recently suggested Structure Measures of Complexity (SMC) with simulated test objects, represented by simple structures or modelled on the basis of a real bone image. We check how these SMC reflect the local and global disordering processes, as well as a deterioration of the bone structure. We show that applications of SMC provide additional information a...

We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions— approximability and distinguishability. Built upon the formal treatment of partial separability, we measure the complexity of an entangled quantum state by determining (i) how hard to approximate it from a fix...

In [2], [3] and [4] several measures of descriptional complexity of context-free grammars (cfg's) and context-free languages (cfl's) have been investigated, most of them having the following properties: 1. The corresponding hierarchy of complexity classes of languages over two-letter alphabets is infinite. 2. The basic algorithmic problems are undecidable. (For example, the problems to determin...

Software maintenance and mainly software comprehension pose the largest costs in the software lifecycle. In order to assess the cost of software comprehension, various complexity measures have been proposed in the literature. This paper proposes new cognitive-spatial complexity measures, which combine the impact of spatial as well as architectural aspect of the software to compute the software ...

The (ǫ, n)-complexity functions describe total instability of trajectories in dynamical systems. They reflect an ability of trajectories going through a Borel set to diverge on the distance ǫ during the time interval n. Behavior of the (ǫ, n)-complexity functions as n → ∞ is reflected in the properties of special measures. These measures are constructed as limits of atomic measures supported at...