## On the Classification of Computable Languages (1997)

### Cached

### Download Links

- [i11www.ira.uka.de]
- [www.cis.udel.edu]
- [www.math.uni-heidelberg.de]
- DBLP

### Other Repositories/Bibliography

Citations: | 6 - 4 self |

### BibTeX

@MISC{Case97onthe,

author = {John Case and Efim Kinber and Arun Sharma and Frank Stephan},

title = {On the Classification of Computable Languages},

year = {1997}

}

### OpenURL

### Abstract

A one-sided classifier for a given class of languages converges to 1 on every language from the class and outputs 0 innitely 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 computable 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.