☆

0

Nice paper along the work of [Dasgupta](https://papers-gamma.link/paper/155) and [Cohen-Addad et al.](https://arxiv.org/pdf/1704.02147.pdf).
A function to quantify the quality of a hierarchical graph clustering / dendrogram is proposed.
An interesting application to compress a dendrogram is proposed.
Section 8. If the input graph is a complete bipartite graph, then the quality function Q is maximum if the graph is partitioned in the two independent sets.

☆

1

Apparently, a single 'mov' assembler instruction is already Turing complete.
Implementation of mov-only compilator is [available](https://github.com/xoreaxeaxeax/movfuscator/blob/master/README.md).
> The M/o/Vfuscator (short 'o', sounds like "mobfuscator") compiles programs into "mov" instructions, and only "mov" instructions. Arithmetic, comparisons, jumps, function calls, and everything else a program needs are all performed through mov operations; there is no self-modifying code, no transport-triggered calculation, and no other form of non-mov cheating.

## Comments: