Kolmogorov complexityIn algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
Constraint satisfactionIn artificial intelligence and operations research, constraint satisfaction is the process of finding a solution through a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a set of values for the variables that satisfies all constraints—that is, a point in the feasible region. The techniques used in constraint satisfaction depend on the kind of constraints being considered.
Oracle boneOracle bones () are pieces of ox scapula and turtle plastron, which were used for pyromancy – a form of divination – in ancient China, mainly during the late Shang dynasty. Scapulimancy is the specific term if ox scapulae were used for the divination, plastromancy if turtle plastrons were used. A recent count estimated that there were about 13,000 bones with a total of a little over 130,000 inscriptions in collections in China and some fourteen other countries.
