Talk:Deterministic algorithm

From Wikipedia, the free encyclopedia

ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles	WikiProject Computing	(Rated Start-Class)
	Information technology portal v • d • e This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of Computing on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.  Start  This article has been rated as Start-Class on the project's quality scale.  ???  This article has not yet received a rating on the project's importance scale.

Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles	WikiProject Computer science	(Rated Start-Class, High-importance)
	Computer science portal v • d • e This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.  Start  This article has been rated as Start-Class on the project's quality scale.  High  This article has been rated as High-importance on the project's importance scale.

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)

[edit] 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)

[edit] Lack of references

For example, if you are playing an on-line game of blackjack that shuffles its deck using a pseudorandom number generator, a clever gambler might guess precisely the numbers the generator will choose and so determine the entire contents of the deck ahead of time, allowing him to cheat (this has actually happened!)

What's the reference for 'this has actually happened'? I do remember this being a plot device in the TV series Numbers, except this was for an electronic card shuffler, but can't find a record of an real case with an on-line shuffler of this. 131.217.6.9 09:06, 4 June 2007 (UTC)