News for hackers. Stuff that matters.
Re:Hans Peter Luhn and the Birth of the Hashing Algorithm by munificent on Thursday February 01, 2018 @12:00PM (#16283434)
> What about it involves thinking of elements as bits and sets as whole numbers?

I said bitwise arithmetic, not binary numbers. :)

> Everything you just described is just a physical representation of sets and operations on sets.

Sure, and how is the set represented and its operations implemented? In the Oracle, each set is represented by a bitmask with a bit position for each element in the set. Set operations are implemented as bitwise operations on those bitmasks.

There are no comments on this comment yet.