Question: What selection is weak?
About the article "Evolution", section "Biased mutation".

Candidate passages:
The notion of weak solution based on distributions is sometimes inadequate.
In the case of hyperbolic systems, the notion of weak solution based on distributions does not guarantee uniqueness, and it is necessary to supplement it with entropy conditions or some other selection criterion.
In fully nonlinear PDE such as the Hamilton-Jacobi equation, there is a very different definition of weak solution called viscosity solution. 
In quantum mechanics (and computation), weak measurements are a type of quantum measurement, where the measured system is very weakly coupled to the measuring device.
After the measurement the measuring device pointer is shifted by what is called the "weak value", so that a pointer initially pointing at zero before the measurement would point at the weak value after the measurement.
The system is not disturbed by the measurement.
Although this may seem to contradict some basic aspects of quantum theory, the formalism lies within the boundaries of the theory and does not contradict any fundamental concept, in particular not Heisenberg's uncertainty principle.
The idea of weak measurements and weak values, first developed by Yakir Aharonov, David Albert and Lev Vaidman, published in 1988, is especially useful for gaining information about pre- and post-selected systems described by the two-state vector formalism.
This was the original reason that Aharonov et al.
developed weak measurement.
Since a "strong" perturbative measurement can both upset the outcome of the post-selection and tamper with all subsequent measurement, weak nonperturbative measurements may be used to learn about such systems during their evolution.
If formula_1 and formula_2 are the pre- and post-selected quantum mechanical states, the "weak value" of the observable Â is defined as formula_3 The weak value of the observable becomes large when the post-selected state, formula_2, approaches being orthogonal to the pre-selected state, formula_1.
In this way, by properly choosing the two states, the weak value of the operator can be made arbitrarily large, and otherwise small effects can be amplified.
Related to this, the research group of Aephraim Steinberg at the University of Toronto confirmed Hardy's paradox experimentally using joint weak measurement’ of the locations of entangled pairs of photons.
Independently, a team of physicists from Japan reported in December, 2008, and published in March, 2009, that they were able to use joint weak measurement to observe a photonic version of Hardy's paradox.
In this version, two photons were used instead of a positron and an electron and relied not upon non-annihilation but on polarization degrees of freedom values measured.
Building on weak measurements, Howard M. Wiseman proposed a weak value measurement of the velocity of a quantum particle at a precise position, which he termed its "naïvely observable velocity".
In 2010, a first experimental observation of trajectories of a photon in a double-slit interferometer was reported, which displayed the qualitative features predicted in 2001 by Partha Ghose for photons in the de Broglie-Bohm interpretation.
In 2011, weak measurements of many photons prepared in the same pure state, followed by strong measurements of a complementary variable, were used to reconstruct the state in which the photons were prepared. 
Tournament selection is a method of selecting an individual from a population of individuals in a genetic algorithm.
Tournament selection involves running several "tournaments" among a few individuals chosen at random from the population.
The winner of each tournament (the one with the best fitness) is selected for crossover.
Selection pressure is easily adjusted by changing the tournament size.
If the tournament size is larger, weak individuals have a smaller chance to be selected.
Tournament selection pseudo code:Deterministic tournament selection selects the best individual (when p=1) in any tournament.
A 1-way tournament (k=1) selection is equivalent to random selection.
The chosen individual can be removed from the population that the selection is made from if desired, otherwise individuals can be selected more than once for the next generation.
Tournament selection has several benefits: it is efficient to code, works on parallel architectures and allows the selection pressure to be easily adjusted. 
All-time Pitt All-American selections.
Key.-1 = First Team Selection <br>-2 = Second Team Selection<br>-3 = Third Team Selection<br>-4 = Fourth Team Selection-t = tied for selection[ ] other brakets following selectors indicated selections for alternate position if different from what is listed for each player (T=Tackle, HB=Halfback, FB=Fullback) 
Languages are often colloquially referred to as "strongly typed" or "weakly typed".
In fact, there is no universally accepted definition of what these terms mean.
In general, there are more precise terms to represent the differences between type systems that lead people to call them "strong" or "weak".