Affiliation:
1. Department of Philosophy II, RUB Bochum, Germany
Abstract
Kleene’s computability theory based on the S1–S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing’s ‘machine model’ which formalises computing with real numbers. A fundamental distinction in Kleene’s framework is between normal and non-normal functionals where the former compute the associated Kleene quantifier ∃ n and the latter do not. Historically, the focus was on normal functionals, but recently new non-normal functionals have been studied based on well-known theorems, the weakest among which seems to be the uncountability of the reals. These new non-normal functionals are fundamentally different from historical examples like Tait’s fan functional: the latter is computable from ∃ 2 , while the former are computable in ∃ 3 but not in weaker oracles. Of course, there is a great divide or abyss separating ∃ 2 and ∃ 3 and we identify slight variations of our new non-normal functionals that are again computable in ∃ 2 , i.e. fall on different sides of this abyss. Our examples are based on mainstream mathematical notions, like quasi-continuity, Baire classes, bounded variation, and semi-continuity from real analysis.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference51 articles.
1. J. Appell, J. Banaś and N. Merentes, Bounded Variation and Around, De Gruyter Series in Nonlinear Analysis and Applications, Vol. 17, De Gruyter, Berlin, 2014.
2. J. Avigad and S. Feferman, Gödel’s functional (“Dialectica”) interpretation, in: Handbook of Proof Theory, Stud. Logic Found. Math., Vol. 137, 1998, pp. 337–405.
3. Sur les fonctions de variables réelles;Baire;Ann. di Mat.,1899
4. E. Bishop, Foundations of Constructive Analysis, McGraw-Hill, 1967.
5. Sums of quasicontinuous functions defined on pseudometrizable spaces;Borsík;Real Anal. Exchange,1997