Tag
A detailed historical and mathematical explanation of hash functions, from their invention by Arnold Dumey in 1956 as a memory indexing technique to modern cryptographic hashes, including Python implementations.
Daniel Lemire explores what fraction of 64-bit integers can be expressed as the product of two 32-bit integers, finding that only about 17% are, with implications for hash function design.
OpenAI researchers demonstrate that a simple count-based exploration approach using hash codes can achieve near state-of-the-art performance on high-dimensional deep RL benchmarks, challenging the assumption that count-based methods cannot scale to continuous state spaces.