Languages with significant operations (such as execution order) that are predominantly nondeterministic; the same answer cannot always be expected in the same circumstance.
Note that this is not necessarily the same as "strictly random" (for that, see the subcategory Category:Probabilistic); it's more like "there are no guarantees".
It's also unfortunate that the term "nondeterministic" has a slightly different meaning in the world of automata and computability theory. Roughly speaking, a nondeterministic automaton is considered to do something (for example, recognize a string on its input) if there is any circumstance under which it might do that thing.
This category has only the following subcategory.
Pages in category "Nondeterministic"
The following 24 pages are in this category, out of 24 total.