The problem is that you can easily create negative effects that hurt all developers while only imagining the impact on profitable AAA games which seems to be how most of these discussions go since people always bring up blockbuster games like Lineage 2 and World of Warcraft.
Ensuring that the multiplayer server component of your game is a standalone end-user distributable is a huge task to impose on every game that wants to have a multiplayer component. Especially once you consider the vast majority of games that never even get traction much less turn a profit.
So, the second someone buys your prerelease indie slither.io game, what exactly does this checklist look like? It needs to also day 1 launch with a self-hostable standalone server distro instead of the crappy spaghetti mess you live coded on an EC2 machine?
The requirement is not to be standalone end-user distributable, the requirement is that it be somehow possible for an end user to set it up, which is a lot easier, unless the developers don't even know how to set up the backend. But that's a low bar still.
We can just go straight to the Sipser (from the chapter 1, all emphasis is Sipser's)[1]:
> Nondeterminism is a useful concept that has had great impact on the theory of computation. So far in our discussion, every step of a computation follows in a unique way from the preceding step. When the machine is in a given state and reads the next input symbol, we know what the next state will be--it is determined. We call this deterministic computation. In a nondeterministic machine several choices may exist for the next state at any point.
> How does an NFA compute? Suppose that we are running an NFA on an input string and come to a state with multiple ways to proceed. For example, say that we are in state q_1 in NFA N_1 and that the next input symbol is a 1. After reading that symbol, the machine splits into multiple copies of itself and follows all the possibilities in parallel. Each copy of the machine proceeds and continues as before.
This is why the list monad also provides a useful way to explore non-determinism that mirrors in functional programming terms what NFAs do in a classical theory of computation framework.
To this point, LLMs can form this type of nondeterministic computing when they follow multiple paths at once doing beam search, but are unquestionably deterministic when doing greedy optimization, and still deterministic when using other single path sampling techniques and a known seed.
[0]. https://en.wikipedia.org/wiki/Nondeterministic_programming
[1]. https://cs.brown.edu/courses/csci1810/fall-2023/resources/ch...