Consider two paths in the unit square such that , , and . 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.
O.Aberth, Computable Analysis, McGraw-Hill, New York, 1980.
2.
V.Brattka, G.Gherardi and A.Pauly, Weihrauch complexity in computable analysis, 2017, arXiv:1707.03202v1 [math.LO].
3.
V.Brattka, P.Hertling and K.Weihrauch, A tutorial on computable analysis, in: New Computational Paradigms: Changing Conceptions of What Is Computable, S.B.Cooper, B.Löwe and A.Sorbi, eds, Springer, New York, 2008, pp. 425–491. doi:10.1007/978-0-387-68546-5_18.
A.Grzegorczyk, On the definitions of computable real continuous functions, Fundamenta Mathematicae44 (1957), 61–71. doi:10.4064/fm-44-1-61-71.
6.
Z.Iljazović and B.Pažek, Computable intersection points, Preprint, 2017.
7.
B.A.Kušner, Lectures on Constructive Mathematical Analysis, Izdat. Nauka, 1973(in Russian). Translated: by E. Mendelson and edited by L.J. Leifman, Transl. Math. Monographs, Vol. 60, 1984.
D.Lacombe, Extension de la notion de fonction récursive aux fonctions d’une ou plusieurs variables réelles I, Comptes Rendus Académie des Sciences Paris240 (1955), 2478–2480, Théorie des fonctions.
10.
S.N.Manukyan, O nekotorykh topologicheskikh osobennostyakh konstruktivnykh prostykh dug, in: Issledovaniya po Teorii Algorifmov i Matematicheskoy Logike, Vol. 2, B.A.Kushner and A.A.Markov, eds, Vychislitel’ny Tsentr AN SSSR, Moscow, 1976, pp. 122–129(in Russian).
11.
E.Specker, Der Satz vom Maximum in der rekursiven Analysis, in: Constructivity in Mathematics, Aug. 26–31, 1957, Amsterdam, A.Heyting, ed., Studies in Logic and the Foundations of Mathematics, North-Holland. Proc. Colloq., Amsterdam, 1959, pp. 254–265.
