Bekenstein bound

In physics, the Bekenstein bound (named after Jacob Bekenstein) is an upper limit on the thermodynamic entropy S, or Shannon entropy H, that can be contained within a given finite region of space which has a finite amount of energy—or conversely, the maximal amount of information required to perfectly describe a given physical system down to the quantum level. It implies that the information of a physical system, or the information necessary to perfectly describe that system, must be finite if the region of space and the energy are finite. In computer science this implies that non-finite models such as Turing machines are not realizable as finite devices. The universal form of the bound was originally found by Jacob Bekenstein in 1981 as the inequality where S is the entropy, k is the Boltzmann constant, R is the radius of a sphere that can enclose the given system, E is the total mass–energy including any rest masses, ħ is the reduced Planck constant, and c is the speed of light. Note that while gravity plays a significant role in its enforcement, the expression for the bound does not contain the gravitational constant G, and so, it ought to apply to quantum field theory in curved spacetime. In informational terms, the relation between thermodynamic entropy S and Shannon entropy H is given by whence where H is the Shannon entropy expressed in number of bits contained in the quantum states in the sphere. The ln 2 factor comes from defining the information as the logarithm to the base 2 of the number of quantum states. Using mass–energy equivalence, the informational limit may be reformulated as where is the mass (in kg), and is the radius (in meter) of the system. Bekenstein derived the bound from heuristic arguments involving black holes. If a system exists that violates the bound, i.e., by having too much entropy, Bekenstein argued that it would be possible to violate the second law of thermodynamics by lowering it into a black hole. In 1995, Ted Jacobson demonstrated that the Einstein field equations (i.e.