Pseudorandomness
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Points too even to be random
Independent random points clump, and the clumping is what makes the error fall only as the square root. Points chosen to be evenly spread rather than independently beat that rate, and the price is that nothing about them is random at all.
A memory of four bits
A register holding four bits, shifting them along and adding two of them back, runs through all fifteen nonzero states before it repeats. Which two are added back is a question about a polynomial, and getting it wrong costs fourteen of the fifteen.
Named alongside it
The objects these essays reach for when they reach for this one.
Convergence rateDe bruijn sequenceDiscrepancyDiscrete logarithmEquidistributionError boundFinite fieldGroupIntegralMonte CarloPeriodicityPolynomial