Complextropy is an information theoretical quantity defined as the length of the shortest computer program that describes a set S of which x is a “random” or “generic” member, factoring in computational resource bounds. It is intended to be a measure of "sophistication" that ignores the contribution of arbitrary or random bits to Kolmogorov complexity.