Slashdot Mirror
Brain-Inspired 'Memcomputer' Constructed
New submitter DorkFest writes: "Inspired by the human brain, UC San Diego scientists have constructed a new kind of computer that stores information and processes it in the same place. This prototype 'memcomputer' solves a problem involving a large dataset more quickly than conventional computers, while using far less energy. ... Such memcomputers could equal or surpass the potential of quantum computers, they say, but because they don't rely on exotic quantum effects are far more easily constructed." The team, led by UC San Diego physicist Massimiliano Di Ventra published their results in the journal Science Advances.
I didn't see the point to this design until I noticed the part about it being "analog".
Until then, I wasn't seeing the difference between the memcomputer and older non-symmetric parallel processing machines which used to cluster a CPU with it's memory for each node/board of the system, but without the shared memory of an SMP system.
Still, I'm afraid I can't see much practical application to their system, and they don't give any examples of the types of problems they think it'll be suitable for.
I do not fail; I succeed at finding out what does not work.
At first I thought they might be doing some flavor of Computational RAM, but they did something rather different. The system is analog. And it is suggested memristors could provide useful in implementation of similar systems.
Just a couple sections I found interesting FTA:
As we discuss in the following paragraphs, the machine we built is analog and hence would be scalable to very large numbers of memprocessors only in the absence of noise or using some error-correcting codes. This problem derives from the fact that in the present realization, we use the frequencies of the collective state to encode information, and to maintain the energy of the system bounded, the amplitudes of the frequencies are dampened exponentially with the number of memprocessors involved. However, this latter limitation is due to the particular choice of encoding the information in the collective state and could be overcome by using other realizations of digital memcomputing machines and using error-correcting codes. For example in (8), two of the authors (F.T. and M.D.) proposed a different way to encode a quadratic information overhead in a network of memristors that is not subject to this energy bound.
These properties ultimately derive from a different type of architecture: the topology of memcomputing machines is defined by a network of interacting memory cells (memprocessors), and the dynamics of this network are described by a collective state that can be used to store and process information simultaneously. This collective state is reminiscent of the collective (entangled) state of many qubits in quantum computation, where the entangled state is used to solve efficiently certain types of problems such as factorization (9). Here, we prove experimentally that such collective states can also be implemented in classical systems by fabricating appropriate networks of memprocessors, thus creating either linear or nonlinear combinations out of the states of each memprocessor. The result is the first proof of concept of a machine able to solve an NP-complete problem in polynomial time using collective states.
In summary, we have demonstrated experimentally a deterministic memcomputing machine that is able to solve an N P -complete problem in polynomial time (actually in one step) using only polynomial resources. The actual machine we built clearly suffers from technological limitations, that impair its scalability due to unavoidable noise. These limitations derive from the fact that we encode the information directly into frequencies, and so ultimately into energy. This issue could, however, be overcome either using error correcting codes or with other UMMs that use other ways to encode such information and are digital at least in their input and output. Irrespective, this machine represents the first experimental realization of a UMM that uses the collective state of the whole memprocessor network to exploit the information overhead theoretically introduced in (8). Finally, it is worth mentioning that the machine we have fabricated is not a general purpose one. However, other realizations of UMMs are general purpose and can be easily built with available technology (22–26). Their practical realization would thus be a powerful alternative to current Turing-like machines.
much of left-wing thought is a kind of playing with fire by people who don't even know that fire is hot - George Orwell
It sounds awfully like an FPGA just from the snippet. There have been FPGA variants that are self-reconfigurable in the past also but they fell by the wayside from lack of demand.
... this is, of course, complete bullshit. Or to put it less friendly: This person is trying to con the public.
Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
low-hanging fruit.
Stores information and processes it in the same place? You mean like every other computer ever?
I'm trying to teach myself to set people on fire with my mind... Is it hot in here?
That sounds like something out of Fallout New Vegas. Like Mr House would have a "memcomputer" keeping his accounts.
The nerds at UCSD are gonna have to work on the name to sound a little less 1950s. Or maybe that's what they're going for?
You are welcome on my lawn.
Good Lord, people, Scott Aaronson refuted this memcomputer nonsense some time ago:
Memrefuting
The short story is that all they've done is a sleight of hand where they smuggle the exponential blowup somewhere else.
They invented a processor with level 1 cache? WOW! I assume they phrased it incorrectly and in reality it does computing logic in the RAM, not stored the data inside the processor....like modern processors do.
Parent post is the only post needed in response to this story. If even a quantum computer can merely get a polynomial speedup in the best case, it's kind of silly to suppose that a classical analog computer can get an exponential speedup. And what really grinds my gears is the implication that superturing computation might be possible, which would violate the Bekenstein bound.
"Politicians and diapers must be changed often, and for the same reason."
all frequencies involved in the collective state (1) are dampened by the factor 2-n
And this is where they stuff away the rabbit they pretend to be pulling out of the hat. For any moderately sized, non-trivial SSP ( Subset Sum Problem ), this brings down the produced output signal's readability to being so hard to detect that you need exponential time to decide upon a reading. Which debunks this entire piece of bullshit in one phrase. 'Nuff said, OP is BS. QED.
Religous speak to God. Insane are spoken to by God. When all shut up, one can finally hear Shostakovich in peace
It would also kill the comments section.
And did you exchange a walk on part in the war for a lead role in a cage? - Pink Floyd.
What's wrong with memputer?