Dorrington Paradox

From Wikipedia, the free encyclopedia

It is proposed that this article be deleted, because of the following concern:

original research

If you can address this concern by improving, copyediting, sourcing, renaming or merging the page, please edit this page and do so. You may remove this message if you improve the article, or if you otherwise object to deletion of the article for any reason. To avoid confusion, it helps to explain why you object to the deletion, either in the edit summary or on the talk page. If this template is removed, it should not be replaced.

The article may be deleted if this message remains in place for five days (This template was added: 10 December 2006).

If you created the article, please don't take offense. Instead, consider improving the article so that it is acceptable according to the deletion policy. Nominator: Please consider notifying the author(s) of this page using

{{subst:prodwarning|Dorrington Paradox}} ~~~~

The Dorrington Paradox relates to situations where the fastest way to finish is to do nothing at all, at least initially.

The easiest example to visualize is that of difficult, processor-intensive computer problems. Remembering that according to Moore's law, processor speed approximately doubles every 18 months, if the problem will take more than three years, it's faster to wait for processor speed to increase and then solve the problem.

Retrieved from "http://en.wikipedia.org../../../d/o/r/Dorrington_Paradox_c873.html"