What problem does it solve?
The classic Treisman feature-integration theory predicts that searching for a unique feature (e.g., a red item among green items) is essentially parallel and "pops out," while searching for a conjunction of features (e.g., a red X among red O's and blue X's) requires serial attention. We let you see that difference in your own data.