The potential of internet-based collaboration was vividly demonstrated this month when complexity theorists used blogs and wikis to pounce on a claimed proof for one of the most profound and difficult problems facing mathematicians and computer scientists, reports the New York Times. Vinay Deolalikar, a mathematician and electrical engineer at Hewlett-Packard, posted a proof of what is known as the “P vs. NP” problem on a web site, and he quietly notified a number of the key researchers in a field of study that focuses on problems that are solvable only with the application of immense amounts of computing power....
Subscribe to Read More
Are You an Educator?
Get Free online access to all our
news and resources