How many parallelizable threads exist for a given process that has allocated n bytes of memory ?
Formally, what I'm asking is this: Let X be a finite set of n elements (this set represents allocated memory for a computer process). How many pairs of functions f,g : X -> X are there such that (Dom f and Im g are disjoint) and (Dom g and Im f are disjoint) ?