Abstract
For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in the case of learnable classes. Here the strength of the classes is compared using the strong and weak reducibility from intrinsic complexity. It is shown that, for explanatorily learnable classes, the complete classes are also mitotic with respect to weak and strong reducibility, respectively. But there is a weak complete class which cannot be split into two classes which are of the same complexity with respect to strong reducibility. It is shown that for complete classes for behaviourally correct learning, one half of each splitting is complete for this learning notion as well. Furthermore, it is shown that explanatorily learnable and recursively enumerable classes always have a splitting into two incomparable classes; this gives an inductive inference counterpart of Sacks Splitting Theorem from recursion theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambos-Spies, K.: P-mitotic sets. In: Logic and Machines. LNCS, vol. 177, pp. 1–23. Springer, Heidelberg (1984)
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
B\(\bar{a}\)rzdiņš, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, Vol. 1, Latvian State University, Riga, 210, 82–88 (1974)
Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)
Case, J., Lynes, C.: Inductive inference and language identification. In: Ninth International Colloquium on Automata, Languages and Programming (ICALP), Aarhus, Denmark, July 12-16. LNCS, vol. 140, pp. 107–115. Springer, Heidelberg (1982)
Freivalds, R., Kinber, E., Smith, C.: On the intrinsic complexity of learning. Information and Computation 123, 64–71 (1995)
Friedberg, R.: Three theorems on recursive enumeration. The Journal of Symbolic Logic 23, 309–316 (1958)
Fulk, M.: Prudence and other conditions on formal language learning. Information and Computation 85, 1–11 (1990)
Glaßer, C., Pavan, A., Selman, A., Zhang, L.: Mitosis in computational complexity. In: Theory and Applications of Models of Computation. Third International Conference, TAMC 2006, Beijing, China, May 15-20. LNCS, vol. 3959, pp. 61–67. Springer, Heidelberg (2006)
Glaßer, C., Ogihara, M., Pavan, A., Selman, A., Zhang, L.: Autoreducibility, mitoticity and immunity. In: Mathematical Foundations of Computer Science. Thirtieth International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2. LNCS, vol. 3618, pp. 387–398. Springer, Heidelberg (2005)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Jain, S., Kinber, E., Wiehagen, R.: Language learning from texts: degrees of intrinsic complexity and their characterizations. Journal of Computer and System Sciences 63, 305–354 (2001)
Jain, S., Sharma, A.: The intrinsic complexity of language identification. Journal of Computer and System Sciences 52, 393–402 (1996)
Ladner, R.: Mitotic recursively enumerable sets. The. Journal of Symbolic Logic 38, 199–211 (1973)
Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)
Osherson, D.N., Weinstein, S.: Criteria of language learning. Information and Control 52, 123–138 (1982)
Post, E.: Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society 50, 284–316 (1944)
Sacks, G.E.: On the degrees less than 0′. Annals of Mathematics 77, 211–231 (1977)
Smith, C.H., Wiehagen, R., Zeugmann, T.: Classifying predicates and languages. International Journal of Foundations of Computer Science 8, 15–41 (1997)
Soare, R.: Recursively Enumerable Sets and Degrees. Springer-Verlag, Heidelberg (1987)
Trakhtenbrot, B.A.: On autoreducibility. Soviet Mathematics, Doklady (Doklady Akademii Nauk. SSSR) 11, 814–817 (1970)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Stephan, F. (2007). Mitotic Classes. In: Bshouty, N.H., Gentile, C. (eds) Learning Theory. COLT 2007. Lecture Notes in Computer Science(), vol 4539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72927-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-72927-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72925-9
Online ISBN: 978-3-540-72927-3
eBook Packages: Computer ScienceComputer Science (R0)