We propose a formal game in which two objects begin in a shared relational state but evolve under different combinatorial laws. As time progresses, the number of possible trajectories grows faster than any polynomial verification process can explore. As a result, the original relation may not be ontologically erased, yet it becomes computationally inaccessible. We call this phenomenon combinatorial forgetting: an informational event horizon separating what is easy to verify from what is hard to recover.
Aviad Shetrit (2026) studied this question.