omplexity. If one assumes the entire AtomSpace A constituting a given CogPrime system as given background information, then the basic com- plexity °(BI IA) may be considered as the number of bits required to list the handles of the elements of B, for lookup in A; whereas c(B) is the number of bits requ