3 papers
cs.CC2026
Termination of Real Linear Loops
Eike Neumann, Margret Tembo
We study the problem of deciding universal termination of linear and affine loops over the reals in the bit-model of real computation. We show that both problems are as close to de…
cs.LO2025
Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
Eike Neumann
We study the problem of deciding whether a point escapes a closed subset of under the iteration of a continuous map in the b…
math.LO2025
Computably discrete represented spaces
Eike Neumann, Arno Pauly, Cécilia Pradic +1
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial s…