News for hackers. Stuff that matters.
Re:How Bell’s Theorem proved ‘spooky action at a distance’ i... by ericb on Wednesday July 21, 2021 @11:38AM (#27907727)
Maybe, but if you can segment out the unobserved items, and back-calculate it lazily, you could save a lot of processing and memory.

The place to implement an optimization like this would be at the items with the biggest O in your world, which is usually the smallest building block--what you'd have the "most" of, which would drive the largest memory and processing demands.

There are no comments on this comment yet.