✦ LIBER ✦

Recursion theoretic characterizations of complexity classes of counting functions

✍ Scribed by Heribert Vollmer; Klaus W. Wagner

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 918 KB
Volume: 163
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00237-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A learning-theoretic characterization of

A learning-theoretic characterization of classes of recursive functions

✍ Martin Kummer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 673 KB

Complexity classes of provable recursive

Complexity classes of provable recursive functions

✍ Dan Gordon 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Recursive estimation for a class of coun

Recursive estimation for a class of counting processes

✍ Peter Spreij 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 68 KB

Characterizations of Learnability for Cl

Characterizations of Learnability for Classes of {0, ..., n)-Valued Functions

✍ S. Bendavid; N. Cesabianchi; D. Haussler; P.M. Long 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 885 KB

We investigate the PAC learnability of classes of \(\{0, \ldots, n\}\)-valued functions \((n<\infty)\). For \(n=1\) it is known that the finiteness of the Vapnik-Chervonenkis dimension is necessary and sulficient for learning. For \(n>1\) several generalizations of the VC-dimension, each yielding a

Classes of One-Argument Recursive Functi

Classes of One-Argument Recursive Functions

✍ Nadejda V. Georgieva 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

Information-theoretic characterizations

Information-theoretic characterizations of recursive infinite strings

✍ Gregory J. Chaitin 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 534 KB