On one-sided versus two-sided classification

Archive for Mathematical Logic

Volumn 40, Issue 7, 2001, Pages 489-513

  Stephan, Frank ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035623357     PISSN: 09335846     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001530100083     Document Type: Article

References (29)

1. Ben-David, S.: Can Finite Samples Detect Singularities of Real-Valued Functions? Proceedings of the 24th Annual ACM Symposium on the Theory of Computer Science, Victoria, B.C., 390-399 (1992)
2. Blum, L., Blum, M.: Toward a mathematical theory of inductive inference, Information and Control, 28, 125-155 (1975)
3. Büchi, J.R.: On a decision method in restricted second order arithmetic, Proceedings of the International Congress on Logic, Methodology and Philosophy of Science, Stanford University Press, Stanford, California (1960)
4. Büchi, J.R., Landweber, L.H.: Definability in the monadic second order theory of successor. Journal of Symbolic Logic, 34, 166-170 (1969)
5. Case, J., Kinber, E., Sharma, A., Stephan, F.: On the classification of computable languages. Proceedings of the 14th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science (Springer-Verlag, Heidelberg) 1200, 225-236 (1997)
6. Fortnow, L., Freivalds, R., Gasarch, W., Kummer, M., Kurtz, S., Smith, C., Stephan, F.: On the relative size of learnable sets, Theoretical Computer Science, 197, 139-156 (1998)
7. Gasarch, W., Pleszkoch, M., Stephan, F., Velauthapillai, M.: Classification using information. Annals of Mathematics and Artificial Intelligence, Selected papers from ALT 1994 and All 1994, 23, 147-168 (1998)
8. Gasarch, W., Pleszkoch, M., Velauthapillai, M.: Classification using information -conference version. Proceedings of the Fifth International Workshop on Algorithmic Learning Theory, Reinhardsbrunn, Lecture Notes in Computer Science (Springer Verlag, Heidelberg) 872, 290-300 (1994)
9. Gold, E.M.: Language identification in the limit, Information and Control, 10, 447-474 (1967)
10. Kelly, K.: The Logic of Reliable Inquiry, Oxford University Press, Oxford (1995)
11. Ko, K-I.: Complexity Theory of Real Functions, Birkhäuser, Boston (1991)
12. Landweber, L.H.: Decision problems for ω-automata, Mathematical Systems Theory, 3, 376-384 (1969)
13. Lutz, J.: Almost everywhere high nonuniform complexity, Journal of Computer and System Sciences, 44, 226-258 (1992)
14. McNaughton, R.: Testing and generating infinite sequences by a finite automaton, Information and Control, 9, 434-448 (1966)
15. Mehlhorn, K.: On the size of sets of computable functions, Proceedings of the Fourteenth Annual Symposium on Switching and Automata Theory, 190-196, IEEE Computer Society (1973)
16. Minicozzi, E.: Some natural properties of strong-identification in inductive inference, Theoretical Computer Science, 2, 345-360 (1976)
17. Nivat, M., Perrin, D. (editors): Automata on Infinite Words. Lecture Notes in Computer Science 192, Springer-Verlag, Heidelberg (1984)
18. Odifreddi, P.: Classical Recursion Theory, North-Holland, Amsterdam (1989)
19. Osherson, D.N., Stob, M., Weinstein, S.: Systems that learn. Bradford / MIT Press, London (1986)
20. Oxtoby, J.C.: Maß und Kategorie. Springer-Verlag, Heidelberg (1971)
21. Post, E.: Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, 50, 284-316 (1944)
22. Rice, H.G.: Classes of enumerable sets and their decision problems. Transactions of the American Mathematical Society, 74, 358-366 (1953)
23. Rogers, H. Jr.: Theory of recursive functions and effective computability, McGraw-Hill Book Company, New York (1967)
24. Sacks, G.E.: Higher Recursion Theory, Perspectives in Mathematical Logic, Springer-Verlag, Heidelberg (1990)
25. Schnorr, C.P.: Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, 218, Springer-Verlag, Heidelberg (1971)
26. Smith, C.H., Wichagen, R., Zeugmann, T.: Classifying predicates and languages, International Journal of Foundations of Computer Science, 8, 15-42 (1997)
27. Soare, R.I.: Recursively Enumerable Sets and Degrees, Springer-Verlag, Heidelberg (1987)
28. Trakhtenbrot, B.A.: Finite Automata and the logic of one place predicates, Siberian Mathematical Journal, 3, 103-131 [in Russian] (1962)
29. Wiehagen, R., Smith, C.: Generalization versus classification. Proceedings 5th Annual Workshop on Computational Learning Theory, (ACM-Press, New York, 1992) 224-230