[Python] OT: Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states

[Nicola Larosa]

Roberto Polli wrote:
> FYI. Io ci metterò un po' a digerire ;)
> 
> http://advances.sciencemag.org/content/1/6/e1500031.full

Uh oh... :-o

"...they can solve NP-complete problems in polynomial time and, using the
appropriate architecture, with resources that only grow polynomially with
the input size. The reason for this computational power stems from
properties inspired by the brain..."

Grazie per il riferimento.

-- 
Nicola 'tekNico' Larosa <http://www.tekNico.net/>