Question answeringQuestion answering (QA) is a computer science discipline within the fields of information retrieval and natural language processing (NLP) that is concerned with building systems that automatically answer questions that are posed by humans in a natural language. A question-answering implementation, usually a computer program, may construct its answers by querying a structured database of knowledge or information, usually a knowledge base. More commonly, question-answering systems can pull answers from an unstructured collection of natural language documents.
Integer factorizationIn number theory, integer factorization is the decomposition, when possible, of a positive integer into a product of smaller integers. If the factors are further restricted to be prime numbers, the process is called prime factorization, and includes the test whether the given integer is prime (in this case, one has a "product" of a single factor). When the numbers are sufficiently large, no efficient non-quantum integer factorization algorithm is known. However, it has not been proven that such an algorithm does not exist.
Brunnian linkIn knot theory, a branch of topology, a Brunnian link is a nontrivial link that becomes a set of trivial unlinked circles if any one component is removed. In other words, cutting any loop frees all the other loops (so that no two loops can be directly linked). The name Brunnian is after Hermann Brunn. Brunn's 1892 article Über Verkettung included examples of such links. The best-known and simplest possible Brunnian link is the Borromean rings, a link of three unknots.
