Kinetic energyIn physics, the kinetic energy of an object is the form of energy that it possesses due to its motion. It is defined as the work needed to accelerate a body of a given mass from rest to its stated velocity. Having gained this energy during its acceleration, the body maintains this kinetic energy unless its speed changes. The same amount of work is done by the body when decelerating from its current speed to a state of rest.
Valence electronIn chemistry and physics, a valence electron is an electron in the outer shell associated with an atom, and that can participate in the formation of a chemical bond if the outer shell is not closed. In a single covalent bond, a shared pair forms with both atoms in the bond each contributing one valence electron. The presence of valence electrons can determine the element's chemical properties, such as its valence—whether it may bond with other elements and, if so, how readily and with how many.
Inelastic scatteringIn chemistry, nuclear physics, and particle physics, inelastic scattering is a fundamental scattering process in which the kinetic energy of an incident particle is not conserved (in contrast to elastic scattering). In an inelastic scattering process, some of the energy of the incident particle is lost or increased. Although the term is historically related to the concept of inelastic collision in dynamics, the two concepts are quite distinct; inelastic collision in dynamics refers to processes in which the total macroscopic kinetic energy is not conserved.
Computer GoComputer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, the programs of the era were weak. The best efforts of the 1980s and 1990s produced only AIs that could be defeated by beginners, and AIs of the early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI.
Longest path problemIn graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called simple if it does not have any repeated vertices; the length of a path may either be measured by its number of edges, or (in weighted graphs) by the sum of the weights of its edges. In contrast to the shortest path problem, which can be solved in polynomial time in graphs without negative-weight cycles, the longest path problem is NP-hard and the decision version of the problem, which asks whether a path exists of at least some given length, is NP-complete.
