Kolmogorov-Uspensky Machines

Interactive essay explaining Kolmogorov-Uspensky machines, a graph-based model of computation where algorithms act through local structural changes rather than tape-based scanning.

An interactive essay comparing Turing machines with Kolmogorov-Uspensky machines as concrete realizations of algorithmic structure.

The page works through unary addition and tree navigation examples to show how bounded local graph transformations differ from tape-based scanning.

Type: interactive