On a quantitative notion of uniformity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 969, Issue , 1995, Pages 169-178

  Kaufmann, Susanne ^a   Kummer, Martin ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947940898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60246-1_123     Document Type: Conference Paper

References (18)

1. R. Beigel, W. I. Gazarch, J. Gill, J. C. Owings, Jr. Terse, superterse, and verbose sets. Information and Computation, 103:68-85, 1993.
2. R. Beigel, M. Kummer, F. Stephan. Quaxttifyirtg the amount of verboseness. To appear in: Luformation and Computation. (A preliminary version appeared in: Lecture Notes in Computer Science, Vol. 620, pp. 21-32, 1992.)
3. A. Blumer, A. Ehrenfeucht, D. Haussler, M. K. Warmuth. Learnability axtd the Vapnik-Chervonenkis dimension. Journal of the A CM, 36:929-966, 1989.
4. J. Case, S. Kaufmann, E. Kinber, M. Kummer. Learning recursive functions from approximations. In: Proceedings of EuroCOLT'95. LNCS 904, 140-153, Springer-Verlag, 1995.
5. W. I. Gasarch. Bounded queries in recursion theory: a survey. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference. IEEE Computer Society Press, 62-78, 1991.
6. V. Harizanov, M. Kummer, J. C. Owings Jr. Frequency computation and the cardinality theorem. J. Symb. Log., 57:677-681, 1992.
7. C. G. Jockusch, R. I. Soare. II 1 classes antd degrees of theories. Trans. Amer. Math. Soc., 173, 33-56, 1972.
8. S. Kaufmasm. Uniformität bei rekursiv aufzählbaren BSumen. Diplomarbeit, Fakultät fär Informatik, Universität Karlsruhe, 1991.
9. E. B. Kinber. On frequency calculations of general recursive predicates. Soy. Math. Dokl., 13:873-876, 1972.
10. E.B. Kinber. Frequency-computable functions and frequeney-enumerable sets. Candidate Dissertation, Riga, 1975. (in Russian)
11. M. Kummer. A proof of Beigel's cardinality conjecture. J. Symb. Log., 57:682-687, 1992.
12. M. Kummer, F. Stephan. Recursion theoretic properties of frequency computation and bounded queries. To appear in: Information and Computation. (A preliminary version appeared in: Lecture Notes in Computer Science, Vol. 713, pp. 243-254, 1993.)
13. D. W. Loveland. A variaztt of the Kolmogorov concept of complexity. In: Information and Control, 15:510-526, 1993.
14. P. Odifreddi. Classical Recursion Theory. North-HollaJad, Amsterdam, 1989.
15. J. C. Owings. A cardinality version of Beigel's nonspeedup theorem. J. Symb. Log., 54:761-767, 1989.
16. J. S. Royer, J. Case. Subrvcursive Programming Systems: Complexity and Succinctness. Birkhäuser-Verlag, Boston, 1994.
17. R. I. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, Berlin, 1987.
18. B. A. Trakhtenbrot. On frequency computation of functions. Algebra i Logika, 2:25-32, 1963. (in Russian)