Talk:Deterministic algorithm

In German you have to distinguish between de:Determinismus (Algorithmus) and de:Determiniertheit (Algorithmus). After reading the definition of "deterministic algorithm" in this article, I would say "deterministic algorithm" is equivalent to German Determinismus. But how would you say Determiniertheit in English? --Abdull 22:01, 27 October 2005 (UTC)[reply]

Imaginary?

 can be quickly solved using an imaginary massively parallel machine
 called a nondeterministic Turing machine, but efficient practical
 algorithms have never been found for any of them.

For a machine to be a nondeterministic Turing machine there is no requirement that it be massively parallel nor are they imaginary. The only thing different is that there is a chance that the algorithm will accept (or find) in polynomial time via incorporating some indeterminate aspect into the algorithm/machine. --ANONYMOUS COWARD0xC0DE 02:54, 10 January 2007 (UTC)[reply]