False Positives
Recent Links for August 8th : Beautiful Code; NP-complete; sleazy FaceBook; ten different New Yorks
Posted under Bookmarked, Code, on Wednesday, August 8th, 2007;- Safari Books Online - Author Interview with Andy Oram and Greg Wilson - Safari Books Online has just posted an interview with Andy Oram and (Toronto’s) Greg Wilson, the two editors who put together the recent O’Reilly book, Beautiful Code.
- An Optical Solution For The Traveling Salesman Problem - They’re claiming an O(NN) solution to a problem that is NP-complete. via Charlie Stross “Apparently the method is polynomial in time, but exponential in energy …” .. “Ah, so that’s what the short duration GRBs (Gamma Ray Bursters) are! “
- xkcd : Mildly (?) sleazy uses of FaceBook, part 14 -
- A Guide to Ten Different New Yorks — New York Magazine - For ten different New York archetypes. Neat Idea! I wonder what Toronto’s Ten Cities would look like?
August 12th, 2007 at
This idea is not so new. It has been arround since 2006.
See here:
http://www.cs.ubbcluj.ro/~moltean/optical
I cite from their 2006 paper:
“In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it following the routes given by the connections between nodes. In each node the rays are uniquely marked so that they can be easily identified. At the destination node we will search only for particular rays that have passed only once through each node. We show that the proposed device can solve small and medium instances of the problem in reasonable time.”