Computable planar curves intersect in a computable point
Klaus Weihrauch · Computability · 2018
Consider two paths f,g:[0;1]→[0;1]2 in the unit square such that f(0)=(0,0), f(1)=(1,1), g(0)=(0,1) and g(1)=(1,0). By continuity of f and g there is a point of intersection. We prove that there is a computable point of intersection if f and g are computable.