It is well known that dynamical systems may be employed as computing machines. However, not all dynamical systems offer particular advantages compared to the standard paradigm of computation, in regard to efficiency and scalability. Recently, it was suggested that a new type of machines, named digital -hence scalable-memcomputing machines (DMMs), that employ non-linear dynamical systems with memory, can solve complex Boolean problems efficiently. This result was derived using functional analysis without, however, providing a clear understanding of which physical features make DMMs such an efficient computational tool. Here, we show, using recently proposed topological field theory of dynamical systems, that the solution search by DMMs is a composite instanton. This process effectively breaks the topological supersymmetry common to all dynamical systems, including DMMs. The emergent long-range order -a collective dynamical behaviorallows logic gates of the machines to correlate arbitrarily far away from each other, despite their non-quantum character. We exemplify these results with the solution of prime factorization, but the conclusions generalize to DMMs applied to any other Boolean problem.Unconventional computing paradigms that employ topological features have considerable advantages over standard ones. The prototypical example is topological quantum computation [1,2] that exploits, in an essential way, the topological character of the ground states of some strongly-correlated quantum electron systems, such as p-wave superconductors and fractional quantum Hall systems, to realize computation unencumbered by decoherence and noise. [3] Recently, a new computing paradigm has been advanced, named memcomputing [4][5][6] that employs non-linear (nonquantum) dynamical systems to compute in and with memory. Implemented in digital (hence scalable) form, memcomputing machines (DMMs) are a collection of logic gates networked