 A much more promising methodological argument for compositionality goes as follows. The fact that we are able to communicate in real time makes it overwhelmingly likely that the computational complexity of the interpretation algorithm we employ is relatively low. In fact, it seems reasonable to think that semantic theories with minimal complexity are, other things being equal, preferable. And there are certain results that show that, under certain conditions, semantics theories that conform to a certain strengthening of  (C)  will be minimally complex; cf. Pagin (2012). Alas, the conditions in question tend to be unrealistic for natural languages. Nonetheless, we can think of them as idealizations, which makes adoption of compositionality as a working hypothesis still a reasonable one. 