in the simplest terms
101Many-worlds interpretation — The quantum mechanical Schrödinger s cat paradox according to the many worlds interpretation. In this interpretation every event is a branch point; the cat is both alive and dead, even before the box is opened, but the alive and dead cats are in… …
102Second law of thermodynamics — The second law of thermodynamics is an expression of the universal law of increasing entropy, stating that the entropy of an isolated system which is not in equilibrium will tend to increase over time, approaching a maximum value at… …
103Balassa-Samuelson effect — The Balassa Samuelson effect (also known as Harrod Balassa Samuelson effect (Kravis and Lipsey 1983), the Ricardo Viner Harrod Balassa Samuelson Penn Bhagwati effect (Samuelson 1994, p. 201), productivity biased purchasing power parity (PPP)… …
104Muzzle brake — The muzzle brake of the 105 mm gun on an AMX 10 RC fighting vehicle …
105Extended Euclidean algorithm — The extended Euclidean algorithm is an extension to the Euclidean algorithm for finding the greatest common divisor (GCD) of integers a and b : it also finds the integers x and y in Bézout s identity: ax + by = gcd(a, b). ,(Typically either x or… …
106System of imprimitivity — The concept of system of imprimitivity is used in mathematics, particularly in algebra and analysis, both within the context of the theory of group representations. It was used by George Mackey as the basis for his theory of induced unitary… …
107Dialogical self — The dialogical self is a psychological concept which describes the mind s ability to imagine the different positions of participants in an internal dialogue, in close connection with external dialogue. The dialogical self is the central concept… …
108World War I prisoners of war in Germany — The situation of World War I prisoners of war in Germany is an aspect of the conflict little covered by historical research. However, the number of soldiers imprisoned reached a little over seven million [Jochen Oltmer estimates a figure between… …
109Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… …
110Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …
