The set of all possible binary functions on X has the cardinality $2^X$ (fancy way of saying the number of elements). Hence, in principle, finding Q should be more difficult just because of the size of the set. However, this is not entirely true. Arbitrary binary function on X is meaningless. Also, the function must be balanced, there are many objects corresponding to yes, and same for no. However, the most important factor is human perception and natural language. The question in god’s mind is some simple concept that can be clearly expressed in a few words at most. Therefore there is a structure in this space Q, some are preferred and some are not. How can we measure this? Is there a natural algorithm that a human or computer player can use to solve Eleksius?