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

[Carlo Miron]

On Wed, Jul 15, 2015 at 12:51 PM, Nicola Larosa <nico a teknico.net> wrote:

> 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..."

credo che lo stress point sia "using the appropriate architecture". in
particolare, è ben noto che è possibile computare al di sotto dei
limiti della macchina di turing (deterministica). il problema è che
osservarne i risultati è infinitamente costoso...

©

-- 
|:**THE BEER-WARE LICENSE** (Revision 42):
| <miron a python.it> wrote this mail. As long as you retain
| this notice you can do whatever you want with this stuff.
| If we meet some day, and you think this stuff is worth it,
| you can buy me a beer in return.
|                                            --Carlo Miron :