The classic Landauer bound can be lowered when erasure errors are permitted. Here we point out that continuous phase transitions characterized by an order parameter can also be viewed as information erasure by resetting a certain number of bits to a standard value. The information-theoretic expression for the generalized Landauer bound in terms of error probability implies thus a universal form for the thermodynamic entropy in the partially ordered phase. We explicitly show that the thermodynamic entropy as a function of interaction parameters and temperature is identical to the information-theoretic expression in terms of error probability alone in the specific example of the Hopfield neural network model of associative memory, a distributed information-processing system of many interacting stochastic bits. In this framework the Landauer bound sets a lower limit for the work associated with “remembering” rather than “forgetting.”