Interestingly, Knuth swapped dancing links for dancing cells and implemented a bunch of SAT solvers (and counting solutions to polyomino tiling problems) using zero suppressed binary decision diagrams. So algorithms X has newer and more efficient successors.

If you want to participate, paste this into a LLM and ask it questions. Might be a barrier that has nothing to do with language.

It’s interesting that Hellen Keller describes her experience, before language acquisition as timeless, no perception of time at all.

https://news.ycombinator.com/item?id=40466814

I’m curious if this experiment actually tests for time perception at all or if it’s a very different effect that we attribute as being actual experience of time.

ORM gives:

1. migration

2. Validation when inserting

3. Validation when loading

3.1. Serialization

4. Joins

5. Abstracts away db fully if you want, not use db specific features

6. Lazy loading as an encapsulation promoting mechanism

None of these things are especially hard and I’d argue query builders that compose and some other tools deal with these points in a simpler and more efficient manner. Migrations in most cases require careful consideration with multiple steps. Simple cases are simple without ORM.

I’m pretty confident most users of ORM are dealing with problems inflicted by ORM behavior, not db. The biggest infliction is natural push towards single-entity logic that is prevalent in OOP and ORM design.