Computable planar curves intersect in a computable point

DOI10.3233/COM-180102MaRDI QIDQ5211073zbMATH OpenOpenAlexWikidataFDO

Authors Klaus Weihrauch

Publication date 17 January 2020

Published in Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.07460

zbMATH Keywords

computable analysisplanar curves

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78)

Abstract: Consider two paths $f,g:[0;1]o[0;1{]}^2$ on the unit square such that $f(0)=(0,0)$, $f(1)=(1,1)$, $g(0)=(0,1)$, $g(1)=(1,0)$, $f(0;1)subseteq(0;1{)}^2$ and $g(0;1)subseteq(0;1{)}^2$. By continuity of $f$ and $g$ there is a point of intersection. We prove that there is a computable point of intersection if the paths are computable.

Recommendations

• Intersection points of planar curves can be computed
• Incomputability of Simply Connected Planar Continua
• Computable intersection points
• Computing links and accessing arcs
• Points on Computable Curves of Computable Lengths

Cited in

(6)

• Point-separable classes of simple computable planar curves
• Computable intersection points
• Computing links and accessing arcs
• Computability of Subsets of Metric Spaces
• Intersection points of planar curves can be computed
• A polynomial-time computable curve whose interior has a nonrecursive measure

This page was built for publication: Computable planar curves intersect in a computable point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211073)