We study if the combinatorial entropy of a finite cover can be computed using finite partitions finer than the cover. This relates to an unsolved question in [R] for open covers. We explicitly compute the topological entropy of a fixed clopen cover showing that it is smaller than the infimum of the topological entropy of all finer clopen partitions.