Algorithmically determining whether a rational point is inside an open, constructive set or on the boundary of it is generally impossible
DOI:
https://doi.org/10.61173/qxr5t711Keywords:
Constructive Mathematics, Open Set, Ratio-nal Point, Unextendible ProgramAbstract
We can determine whether this point is in the interior, boundary, or exterior of this set. In constructive mathematics, this is not always the case. The aim of this research is to demonstrate that it is generally impossible to algorithmically determine whether a point is in an open, constructive set or at its boundaries.
References
[1] Bishop, E. 1967. Foundations of constructive analysis, McGraw-Hill, New York
[2] Shanin N.A., “A hierarchy of ways of understanding judgments in constructive mathematics” Problems of the constructive direction in mathematics. Part 6, Trudy Mat. Inst. Steklov., 129, 1973,203–266; Proc. Steklov Inst. Math., 129(1973), 209–271
[3] Kushner, B.A. 1985, Lectures on Constructive Mathematical Analysis, Providence, RI: American Mathematical Society.
[4] A. M. Turing: On computable numbers, with an application to the Entscheidungsproblem, Proc. Lond. Math. Soc., ser. 2, 42 (1936), 230–265
[5] Shen, A., and Vereshchagin N.K. Computable Functions. AMS Press, 2003
[6] A. M. Turing: Corrections, Proc. Lond. Math. Soc., ser. 2, 43 (1937), 544–546
Downloads
Published
Issue
Section
License
Copyright (c) 2025 by the authors.
This work is licensed under a Creative Commons Attribution 4.0 International License.
