Skip to main content

Questions tagged [non-determinism]

In computer science, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run.

Filter by
Sorted by
Tagged with
8 votes
1 answer

What is the reasoning behind making non-determinism a feature of Haskell?

We know that in Prolog - non-deterministic predicates are a feature used to whittle down combinatorial problems. In Haskell we see some similar non-deterministic behaviour to Prolog in the List ...
hawkeye's user avatar
  • 4,829