In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while still guaranteeing that the request will eventually be serviced. Unbounded nondeterminism became an important issue in the development of the denotational semantics of concurrency, and later became part of research into the theoretical concept of hypercomputation.
Read more about Unbounded Nondeterminism: Fairness, On The Possibility of Implementing Unbounded Nondeterminism, Nondeterministic Automata, Indeterminacy Versus Nondeterministic Automata, Unbounded Nondeterminism and Noncomputability, Arguments For Dealing With Unbounded Nondeterminism, Hewitt's Analysis of Fairness