## Untangling untanglables.

I conjecture (i.) a stochastic “mechanical algorithm” that untangles untanglable strings in finite iterations, (ii.) a class of heuristics that reliably reduce stochasticity and increase efficiency of this algorithm, and furthermore (iii.) a subclass of such heuristics that renders the algorithm superior in average- and worst-case time-complexity to any algorithm that must analyze a topological […]

Continue Reading →