On the complexity of learning in classifier systems

Abstract

Genetic algorithms are employed in classifier systems in order to discover new classifiers. The paper formalises this rule discovery or learning problem for classifier systems and uses methods of computational complexity theory to analyse its inherent difficulty. It is proved that two distinct learning problems are NP-complete, i.e. not likely to be solvable efficiently. The practical relevance of these theoretical results is briefly discussed.