English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Memcomputing is a novel computing paradigm that employs time non-locality(memory) to solve combinatorial optimization problems. It can be realized inpractice by means of non-linear dynamical systems whose point attractorsrepresent the solutions of the original problem. It has been previously shownthat during the solution search digital memcomputing machines go through atransient phase of avalanches (instantons) that promote dynamical long-rangeorder. By employing mean-field arguments we predict that the distribution ofthe avalanche sizes follows a Borel distribution typical of critical branchingprocesses with exponent $\tau= 3/2$. We corroborate this analysis by solvingvarious random 3-SAT instances of the Boolean satisfiability problem. Thenumerical results indicate a power-law distribution with exponent $\tau = 1.51\pm 0.02$, in very good agreement with the mean-field analysis. This indicatesthat memcomputing machines self-tune to a critical state in which avalanchesare characterized by a branching process, and that this state persists acrossthe majority of their evolution.

Critical branching processes in digital memcomputing machines