Researchers at the Indian Institute of Technology Kanpur have devised a new test for primality. They claim their algorithm achieves the "ultimate goal" for a test of primes. The paper can be found here: PRIMES is in P (Postscript file). [...] This really is a breakthough, as mathematicians have believed that polynomial time primality testing was possible, but could not show it. [kuro5hin.org]
The highest rated comment is a quote from Dijkstra that is worth reprinting here:
I mean, if 10 years from now, when you are doing something quick and dirty, you suddenly visualize that I am looking over your shoulders and say to yourself, "Dijkstra would not have liked this", well that would be enough immortality for me.
Personally, the way I sense it when I look at a design (be it code, equations, poems or musical pieces) is by asking whether it is as simple as it could be. When it's not, I know the design is not 100% signal. There's noise.
Kaveh Khodjasteh has been posting quick reports on the Sixth International Conference on Quantum Communication, Measurement and Computing (QCMC’02) that was held in Cambridge, Massachusetts from July 22 to July 26. I wish every scientific conference were blogged by a few attendees. It would be very useful to people who can't attend for one reason or another. It might happen sooner than we think... What do you think? [] links to this post 12:00:33 AM
Copyleft
2006
Sebastien Paquet. Last update:
4/22/2006; 12:03:04 PM.
This theme is based on the SoundWaves
(blue) Manila theme.
