That wiki article even indicates how one would turn the "non-deterministic algorithm" into a deterministic one in order to actually implement it.
Please correct me if I have this wrong.
The wiki article appears to be saying that a random number generator inside an algorith (probabilistic deterministic algorith) is going to send the output in one of a finite number of possible directions such that for any one set of input criteria,
N possible outcomes are possible because that is the total number of random possibilities that exist within the randomiser.
This is then deterministic because you can run the algorith
N number of times, you will get every possible outcome.
Does that sound about right or am I way off base?