№ Quantum Mathematics UTSA

Deep Computations Explorer

Interactive figures

Software · Eduardo Dueñez, José Iovino, Tonatiuh Matos-Wiederhold, Luciano Salvetti, and Franklin D. Tall

A computation is a map applied over and over, and its deep computations are the pointwise limits of its iterates along ultrafilters. The interactive figures let the reader move a parameter and watch these limits form: the logistic family across the levels of the hierarchy, the exact equality tests produced by the Euclidean algorithm, the two rounding conventions of Bresenham’s algorithm, and the independent patterns of the doubling map.

  • Open the interactive figures HTML
  • arXiv preprint arXiv
deep computationsNIPRosenthal compactatame dynamical systems