On the classification of recursive languages

Authors:
John Case;Efim Kinber;Arun Sharma;Frank Stephan
Affiliations:
Computer and Information Sciences Department, 101A Smith Hall, University of Delaware, Newark;Computer Science, Sacred Heart University, 5151 Park Avenue, Fairfield, CT;National ICT Australia Ltd., Sydney Research Laboratory at Kensington, The University of New South Wales, Sydney NSW 2052, Australia;National ICT Australia Ltd., Sydney Research Laboratory at Kensington, The University of New South Wales, Sydney NSW 2052, Australia
Venue:
Information and Computation
Year:
2004

Citing 14
Cited 1

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Higher recursion theory

Higher recursion theory
Monotonic and non-monotonic inductive inference

New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
On the role of procrastination in machine learning

Information and Computation
Machine learning of higher-order programs

Journal of Symbolic Logic
Characterizations of monotonic and dual monotonic language learning

Information and Computation
Elementary formal systems, intrinsic complexity, and procrastination

Information and Computation
Ordinal mind change complexity of language identification

Theoretical Computer Science
Classification using information

Annals of Mathematics and Artificial Intelligence
On the Classification of Computable Languages

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A Guided Tour Across the Boundaries of Learning Recursive Languages

Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Learning with Higher Order Additional Information

AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Generalized notions of mind change complexity

Information and Computation

Inferring answers to queries

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A one-sided classifier for a given class of languages converges to 1 on every language from the class and outputs 0 infinitely often on languages outside the class. A two-sided classifier, on the other hand, converges to 1 on languages from the class and converges to 0 on languages outside the class. The present paper investigates one-sided and two-sided classification for classes of recursive languages. Theorems are presented that help assess the classifiability of natural classes. The relationships of classification to inductive learning theory and to structural complexity theory in terms of Turing degrees are studied. Furthermore, the special case of classification from only positive data is also investigated.