Combinatorial number system 601 and 1010001011 = 651, which again shows that "C" comes before "C"<nowiki>'</nowiki>. This number is not however the one one wants to represent the "k"-combination with, since many binary numbers have a number of raised bits different from "k"; one wants to find the relative position of "C" in the ordered list of (only) "k"-combinations. The number associated in the combinatorial number system of degree "k" to a "k"-combination "C" is the number of "k"-combinations strictly less than "C" in the given ordering. This number can be computed from "C" = { "c", ..., "c", "c" } with "c"
Binary number combinations of a number of simple basic principles or categories, for which he has been considered a predecessor of computing science and artificial intelligence (see Bonner 2007 <http://lullianarts.net/>, Fidora et al. 2011 <https://www.iiia.csic.es/es/publications/ramon-llull-ars-magna-artificial-intelligence/>). In 1605 Francis Bacon discussed a system whereby letters of the alphabet could be reduced to sequences of binary digits, which could then be encoded as scarcely visible variations in the font in any random text. Importantly for the general theory of binary encoding, he added that this method could be used with any objects at all: "provided those objects be capable of a twofold difference only;