This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Beigel, W. I. Gasarch, J. Gill, J. C. Owings, Jr. Terse, superterse, and verbose sets. Information and Computation, 103:68–85, 1993.
R. Beigel, M. Kummer, F. Stephan. Quantifying the amount of verboseness. To appear in: Information and Computation. (A preliminary version appeared in: Lecture Notes in Computer Science, Vol. 620, pp. 21–32, 1992.)
A. Blumer, A. Ehrenfeucht, D. Haussler, M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36:929–966, 1989.
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.
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.
V. Harizanov, M. Kummer, J. C. Owings, Jr. Frequency computation and the cardinality theorem. J. Symb. Log., 57:677–681, 1992.
C. G. Jockusch, R. I. Soare. Π 01 classes and degrees of theories. Trans. Amer. Math. Soc., 173, 33–56, 1972.
S. Kaufmann. Uniformität bei rekursiv aufzählbaren Bäumen. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe, 1991.
E. B. Kinber. On frequency calculations of general recursive predicates. Sov. Math. Dokl., 13:873–876, 1972.
E. B. Kinber. Frequency-computable functions and frequency-enumerable sets. Candidate Dissertation, Riga, 1975. (in Russian)
M. Kummer. A proof of Beigel's cardinality conjecture. J. Symb. Log., 57:682–687, 1992.
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.)
D. W. Loveland. A variant of the Kolmogorov concept of complexity. In: Information and Control, 15:510–526, 1993.
P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989.
J. C. Owings. A cardinality version of Beigel's nonspeedup theorem. J. Symb. Log., 54:761–767, 1989.
J. S. Royer, J. Case. Subrecursive Programming Systems: Complexity and Succinctness. Birkhäuser-Verlag, Boston, 1994.
R. I. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, Berlin, 1987.
B. A. Trakhtenbrot. On frequency computation of functions. Algebra i Logika, 2:25–32, 1963. (in Russian)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaufmann, S., Kummer, M. (1995). On a quantitative notion of uniformity. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_123
Download citation
DOI: https://doi.org/10.1007/3-540-60246-1_123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60246-0
Online ISBN: 978-3-540-44768-9
eBook Packages: Springer Book Archive