Abstract
In any learnability setting, hypotheses are conjectured from some hypothesis space. Studied herein are the effects on learnability of the presence or absence of certain control structures in the hypothesis space. First presented are control structure characterizations of some rather specific but illustrative learnability results. Then presented are the main theorems. Each of these characterizes the invariance of a learning class over hypothesis space V (and a little more about V) as: V has suitable instances of all denotational control structures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Allen. Anatomy of Lisp. McGraw-Hill, New York, NY, 1978.
D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46–62, 1980.
D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117–135, 1980.
M. Blum. A machine independent theory of the complexity of recursive functions. Journal of the ACM, 14:322–336, 1967.
G. Baliga and A. Shende. Learning-theoretic perspectives of acceptable numberings. In Third International Symposium on Artificial Intelligence and Mathematics, January 1994.
A. Church. The Calculi of Lambda Conversion. Princeton Univ. Press, 1941.
D. Kedzier C. Sammut, S. Hurst and D. Michie. Learning to fly. In D. Sleeman and P. Edwards, editors, Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, 1992.
M. Davis, R. Sigal, and E. Weyuker. Computability, Complexity, and Languages. Academic Press, second edition, 1994.
R. Freivalds, M. Karpinski, and C. H. Smith. Co-learning of total recursive functions. In Proceedings of the Seventh Annual Conference on Computational Learning Theory, New Brunswick, New Jersey, pages 190–197. ACM-Press, July 1994.
R Freivalds, E. Kinber, and C. H. Smith. On the intrinsic complexity of learning. In Paul Vitanyi, editor, Proceedings of the Second European Conference on Computational Lear ning Theory, pages 154–169. Springer-Verlag, March 1995. Lecture Notes in Artificial Intelligence 904.
R. Freivalds, E. Kinber, and R. Wiehagen. Inductive inference and computable one-one numberings. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 28:463–479, 1982.
R. Freivalds, E. Kinber, and R. Wiehagen. Connections between identifying functionals, standardizing operations, and computable numberings. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 30:145–164, 1984.
R. M. Friedberg. Three theorems on recursive enumeration. Journal of Symbolic Logic, 23(3):309–316, September 1958.
E. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.
J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979.
S. Jain and A. Sharma. On the intrinsic complexity of language identification. In Proceedings of the Seventh Annual Conference on Computational Learning Theory, New Brunswick, New Jersey, pages 278–286. ACM-Press, July 1994.
M. Kummer. A note on direct sums of friedbergnumberings. Journal of Symbolic Logic, 54(3): 1009–1010, September 1989.
Y. Marcoux. Composition is almost as good as s-1-1. In Proceedings, Structure in Complexity Theory-Fourth Annual Conference. IEEE Computer Society Press, 1989.
P. Odifreddi. Classical Recursion Theory, volume 125 of Studies in Logic and the Foundations of Mathematics. North Holland, Amsterdam, 1989.
D. Osherson, M. Stob, and S. Weinstein. Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge, Mass., 1986.
J. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Mateo, CA, 1992.
G. Riccardi. The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY Buffalo, 1980.
G. Riccardi. The independence of control structures in abstract programming systems. Journal of Computer and System Sciences, 22:107–143, 1981.
H. Rogers. Gödel numberings of partial recursive functions. Journal of Symbolic Logic, 23:331–341, 1958.
H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted, MIT Press, 1987.
J. Royer. A Connotational Theory of Program Structure. Lecture Notes in Computer Science 273. Springer Verlag, 1987.
J. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.
K. Weihrauch. Computability. Springer-Verlag, 1987.
R. Wiehagen. Characterization problems in the theory of inductive inference. Lecture Notes in Computer Science, 62:494–508, 1978.
R. Wiehagen. Characterizations of learnability in various hypothesis spaces. Private communication, 1996.
T. Zeugmann and S. Lange. A guided tour across the boundaries of learning recursive languages. In Klaus P. Jantke and Steffen Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 190–258. Springer-Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Case, J., Jain, S., Suraj, M. (1997). Control structures in hypothesis spaces: The influence on learning. In: Ben-David, S. (eds) Computational Learning Theory. EuroCOLT 1997. Lecture Notes in Computer Science, vol 1208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62685-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-62685-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62685-5
Online ISBN: 978-3-540-68431-2
eBook Packages: Springer Book Archive