3 ms·
Huh. I wonder how fast the lookup tables for various operations could be if they were built using some kind of programmable logic. Then you could theoretically
by jacobolus 11y ago
Huh. I wonder how fast the lookup tables for various operations could be if they were built using some kind of programmable logic. Then you could theoretically just interpret the bit patterns to be whatever kind of number-like object you want, and program the lookup tables accordingly.
- DavidSJ 11y agoRight, now that I think about it, it's only coincidental that the objects in question represent the subsets in a partition of the reals. It seems what we have here is a finite set A (in arithmetic, A would be a finite collection of sets which constitute a partition of the reals) and two operations: f, g: P(A) × P(A) -> P(A), taking a pair of subsets of A to another subset of A, with the property that f(W ∪ X, Y) = f(W, Y) ∪ f(X, Y), and so on. This can all be represented as a bitmask table of size |A|^3, or half if commutativity is enforced. We also have the "inverse" which takes X and Z, and returns the set {a ∈ A : f(X, {a}) ∩ Z ≠ Ø}. If I'm not mistaken, the mechanisms for doing all of this in hardware would come for free, and it represents quite a variety of problem domains beyond arithmetic. Perhaps some arithmetic-specific optimization would be ruled out (e.g. the bit twiddling to get additive or multiplicative inverses).
- trsohmers 11y agoSo, instead of ROM, it would be SRAM... no "reprogrammable logic" required. The difference between ROM bit cell and a RAM bit cell is around ~3x larger, and uses a lot more power wise for read and writes.