2 papers
math.LO2026
Computably totally disconnected locally compact groups
Alexander Melnikov, Andre Nies
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ group…
math.LO2025
Computable classifications of continuous, transducer, and regular functions
Johanna N. Y. Franklin, Rupert Hölzl, Alexander Melnikov +2
We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary…