Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-25T05:36:07.718Z Has data issue: false hasContentIssue false
  • English
  • Français

On subcreative sets and S-reducibility

Published online by Cambridge University Press:  12 March 2014

John T. Gill III  and
Paul H. Morris
John T. Gill III
Affiliation:
Stanford University, Stanford, California 94305
Paul H. Morris
Affiliation:
University of California, Irvine, California 92664
Get access Rights & Permissions [Opens in a new window]

Abstract

Subcreative sets, introduced by Blum, are known to coincide with the effectively speedable sets. Subcreative sets are shown to be the complete sets with respect to S-reducibility, a special case of Turing reducibility. Thus a set is effectively speedable exactly when it contains the solution to the halting problem in an easily decodable form. Several characterizations of subcreative sets are given, including the solution of an open problem of Blum, and are used to locate the subcreative sets with respect to the complete sets of other reducibilities. It is shown that q-cylindrification is an order-preserving map from the r.e. T-degrees to the r.e. S-degrees. Consequently, T-complete sets are precisely the r.e. sets whose q-cylindrifications are S-complete.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 39 , Issue 4 , December 1974 , pp. 669 - 677
Copyright
Copyright © Association for Symbolic Logic 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Blum, M., A machine-independent theory of the complexity of recursive functions, Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336.Google Scholar
[2] Blum, M. and Marques, I., On complexity properties of recursively enumerable sets, this Journal, vol. 38 (1973), pp. 579–593.Google Scholar
[3] Filotti, I., On effectively levellable sets, Recursive Function Theory Newsletter No. 2, 07 1972, University of California, Berkeley, pp. 12–13.Google Scholar
[4] Gill, J. T. III, Probabilistic Turing machines and complexity of computation, Ph.D. Dissertation, University of California, Berkeley; 1972.Google Scholar
[5] Lachlan, A. H., Some notions of reducibility and productiveness, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 17–44.Google Scholar
[6] Lachlan, A. H., Complete recursively enumerable sets, Proceedings of the American Mathematical Society, vol. 19 (1968), pp. 99–102.Google Scholar
[7] Meyer, A. R. and McCreight, E. M., Computationally complex and pseudo-random zero-one valued functions, Theory of machines and computations (Kohavi, Z. and Pax, A., Editors), Academic Press, New York, 1972.Google Scholar
[8] Morris, P. H., Complexity theoretic properties of recursively enumerable sets, Ph.D. Dissertation, University of California, Irvine, 1974.Google Scholar
[9] Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[10] Shoenfield, J. R., Quasicrealive sets, Proceedings of the American Mathematical Society, vol. 8. (1957), pp. 964–967.Google Scholar
[11] Soare, R. I., Automorphisms of the lattice of recursively enumerable sets. II. Complete sets, Recursive Function Theory Newsletter No. 3, 10 1972, University of California, Berkeley, pp. 5–6.Google Scholar