Preview
Unable to display preview. Download preview PDF.
References
V. Bennison, On the computational complexity of recursively enumerable sets, Ph.D. Dissertation, University of Chicago, 1976.
___________, Recursively enumerable complexity sequences and measure independence, preprint to appear.
V. Bennison and R.I. Soare, Some lowness properties and computational complexity sequences, J. Theoretical Computer Science 6 (1978) 233–254.
M. Blum, A machine-independent theory of the complexity of recursive functions, J. Assoc. for Computing Machinery 14 (1967), 322–336.
_______, On defining the complexity of partial recursive functions, preprint.
M. Blum and I. Marques, On complexity properties of recursively enumerable sets, J. Symbolic Logic 38 (1973), 579–593.
I. Filotti, On effectively levelable sets, Recursive Function Newsletter No. 2 (1972), 12–13.
J. Hartmanis and F.D. Lewis, The use of lists in the study of undecidable problems in automata theory, J. Computer and Systems Science 5 (1971), 54–66.
I. Marques, Complexity properties of recursively enumerable sets, Ph.D. Dissertation, University of California, Berkeley, 1973.
A.R. Meyer and P.C. Fischer, Computational speed-up by effective operators, J. Symbolic Logic 37 (1972), 55–68.
P.H. Morris, Complexity theoretic properties of recursively enumerable sets, Ph.D. Dissertation, University of California, Irvine, 1974.
H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.
R.I. Soare, Computational complexity, speedable and levelable sets, J. Symbolic Logic 42 (1977), 545–563.
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bennison, V.L. (1979). Information content characterizations of complexity theoretic properties. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive