Exponential Assembly Top Down Nano
NanotechNews.com writes: "The article describes a new milestone in the Top Down nanotechnology process: "Exponential assembly is a manufacturing architecture starting with a single tiny robotic arm on a surface. This first robotic arm makes a second robotic arm on a facing surface by picking up miniature parts ? carefully laid out in advance in exactly the right locations so the tiny robotic arm can find them ? and assembling them. This is an exponential growth rate, hence the name exponential assembly." Standard MEMS, the largest independent
high-volume manufacturer of Micro Electro Mechanical Systems and Zyvex created a partnership, the second article available here. This partnership could lead to a better assembling technology in MEMS and the Top-Down Nanotechnology and Nanolithography."
My .02,
My .02,
zencode
iactivist.org/jason
Anybody else remember that scene in Mostly Harmless where Ford Prefect breaks down the door to the head editor's office?
There are little nanotech bots in the doorframe whose sole purpose in life is to wait until this happens. Then they crawl out of the frame, assemble each other into larger bots, rebuild the door, disassemble each other, crawl back into frame, and wait...
Anyhow, I know some people working with MEMS. Very cool stuff.
You cannot apply a technological solution to a sociological problem. (Edwards' Law)
Elsewhere on Xyzzy's site you can find the original nanotech (and, indeed, MEMS to nano) talk; "There's Plenty of Room at the Bottom". If you've read anything about Feynman, you're already a fan. If you haven't, this is a good place to start.
Here is my question. Assuming the arms are stationary, it is reasonable to assume that they can only build an arm adjacent to itself (and if they move, moving would be a O(n) process).... This means that for any grid area n^2, there are(n+2)^2 adjacent squares.
Because of this fact, I don't see how these things can achieve any more than a O(n^2) growth rate, because the adjacent resources available to these bots would be O(n^2).
Anyone know how these buggers get around this limitation?