Abstract
The present work determines the arithmetic complexity of the index sets of u.c.e. families which are learnable according to various criteria of algorithmic learning. Specifically, we prove that the index set of codes for families that are TxtFex\(^a_b\)-learnable is \(\Sigma _4^0\)-complete and that the index set of TxtFex\(^*_*\)-learnable and the index set of TxtFext\(^*_*\)-learnable families are both \(\Sigma _5^0\)-complete.
Similar content being viewed by others
References
Baliga, G.R., Case, J., Jain, S.: The synthesis of language learners. Inf. Comput. 152(1), 16–43 (1999)
Beros, A.A.: Anomalous vacillatory learning. J. Symb. Logic 78(04), 1183–1188 (2013)
Beros, A.A.: Learning theory in the arithmetic hierarchy. J. Symb. Logic 79(03), 908–927 (2014)
Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Inf. Control 28(2), 125–155 (1975)
Carlucci, L., Case, J., Jain, S., Stephan, F.: Non U-shaped vacillatory and team learning. In: International Conference on Algorithmic Learning Theory, pp. 241–255. Springer, Berlin (2005)
Case, J.: The power of vacillation in language learning. SIAM J. Comput. 28(6), 1941–1969 (1999)
Case, J., Jain, S., Sharma, A.: Anomalous learning helps succinctness. Theor. Comput. Sci. 164(1–2), 13–28 (1996)
Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447–474 (1967)
Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems That Learn: An Introduction to learning Theory. MIT Press, Cambridge (1999)
Kapur, S., Bilardi, G.: On uniform learnability of language families. Inf. Process. Lett. 44(1), 35–38 (1992)
Kummer, M., Stephan, F.: On the structure of degrees of inferability. J. Comput. Syst. Sci. 52(2), 214–238 (1996)
Soare, R.I.: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets. Springer, Berlin (1999)
Acknowledgements
The authors would like to thank the anonymous referee for dilligent readings of the paper and thoughtful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Beros, A.A., Beros, K.A., Flores, D. et al. Learning theory in the arithmetic hierarchy II. Arch. Math. Logic 60, 301–315 (2021). https://doi.org/10.1007/s00153-020-00745-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-020-00745-4