SpicyG

5 ms·

1. 1.▲
   Show HN: Context-Free Recovery via Constant-Time Enforcement(gist.github.com)

   1 points by SpicyG 8mo ago|0 comments
2. 2.▲
   Show HN: A minimal example of why reactive systems oscillate

   1 points by SpicyG 8mo ago|0 comments
3. 3.▲
   by SpicyG 9mo ago

   I think that’s a real tradeoff, but I’d frame it slightly differently. The rigidity here is intentional at the gate, not across the whole system. The constraint is that admissibility rules must be explicit and versioned, not that they never
4. 4.▲
   by SpicyG 9mo ago

   I agree, and I think this is where the distinction matters. I’m not claiming that state disappears, or that computation can be purely stateless all the way down. There is always state somewhere - registers, buffers, disks, networks. The que
5. 5.▲
   by SpicyG 9mo ago

   I agree, and I think you’ve named the core constraint cleanly. The distinction I’m trying to draw isn’t “no memory ever,” but no implicit memory required for correctness. If there’s no memory, there’s nothing to corrupt. If memory is carrie
6. 6.▲
   Ask HN: Can systems function correctly without memory?

   1 points by SpicyG 9mo ago|6 comments
7. 7.▲
   Entropy Is the Real Engagement Metric(medium.com)

   2 points by SpicyG 9mo ago|0 comments