In this short paper we consider Linnebo's thin/thick dichotomy: first, we show that it does not overlap with the very common one between abstract/concrete objects; second, on the basis of some difficulties with the distinction, we propose, as a possible way out, to move from thin/thick objects to thin/thick concepts.

We consider the relationship between the computational complexity classes NP and EL . Taking into account the inclusion or incomparability of these classes, the existence or nonexistence of immune sets in their differences, and the existence or nonexistence of sparse sets in the differences, there are exactly 24 different cases for their relationship. We show that 16 cases are impossible in the real nonrelativized world as well as in any relativized world. Each of the remaining 8 cases is realizable in (...) appropriate relativized worlds. Further we examine which of the 8 cases is most probably for a random oracle. (shrink)