Cascading Molecules Drive IBM's Smallest Computer
Benoit Fries writes "EE Times reports that IBM researchers have created a simple computation engine that's more than 250,000 times smaller than the most advanced silicon circuitry. Called the world's smallest computer, the system relies on a 'molecular cascade' that pushes a handful of carbon monoxide molecules across a copper surface to perform digital logic functions. 'Even if CMOS density follows Moore's Law for 40 more years, molecular cascades are still going to be smaller,' they said."
'Even if CMOS density follows Moore's Law for 40 more years, molecular cascades are still going to be smaller,'
Chances are it'll be more than 40 years until they could make an actual product with this technology so I don't think that I'm going to hold off on getting that new conventional cpu quite yet
People seem much brighter once you light them on fire.
"The slow operation of the gates -- some required seconds to settle -- underscores the fact that the work was part of a research project."
You pretty much have your choice of one chip that does something 250,000 times in a second, or 250,000 chips that do one thing each a second... Until they can speed these things up, they're more of a curiosity than a useful technology.
And exactly how will you achieve massive parallelism without packing more logic per area? Making computers as big as houses again is not the answer.
Well, only if your city is about the size of something you can only see in a microscope, and the computer is really large and complex, and you somehow manages to get the CO-molecules off the copper plate by cutting the power.
We really need your help
http://www.gofundme.com/help-sherry
Kind of like when Alexander Fleming wrote up a journal paper back in 1928(?) about how mould killed bacteria, and Walter Florey found it in a literature search a decade later and set his research team to isolate the responsible compound and figure out how to produce it in bulk.
I've had this experience myself. I needed to find an efficient algorithm for a relatively obscure problem. The usual textbooks didn't help, but I finally located a survey paper which finally revealed a 1981 journal article which described exactly the algorithm I was looking for.
Any sufficiently advanced technology is indistinguishable from a rigged demo
--Andy Finkel (J. Klass?)