2 ms·
Foe: Functional Opcode Encoding
- deleted 1y ago[deleted]
- compressedgas 1y agohttps://en.wikipedia.org/wiki/Kolmogorov_complexity https://en.wikipedia.org/wiki/Kolmogorov_complexity
- Aston89 1y agoYou're absolutely right to bring up Kolmogorov complexity, it's the theoretical ceiling of what any compression algorithm could achieve. But FOE doesn’t claim to compute it. Instead, it explicitly works within a restricted symbolic grammar, mapping bit sequences to reversible mathematical expressions using pre-defined opcode structures. In other words: FOE doesn’t chase uncomputable minima. It trades universality for practical symbolic compression using interpretable, stack-based formulae. It's not magic. It's not theoretical. It’s a prototype — bounded, testable, and intentionally inefficient — to explore what happens when compression is done with math instead of byte patterns. So no, this isn’t “Kolmogorov with training wheels.” It’s Kolmogorov with a calculator and a time budget.