Computational complexity, speedable and levelable sets

Journal of Symbolic Logic 42 (4):545-563 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,075

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Computational vs. causal complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
Computability Results Used in Differential Geometry.Barbara F. Csima & Robert I. Soare - 2006 - Journal of Symbolic Logic 71 (4):1394 - 1410.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.

Analytics

Added to PP
2009-01-28

Downloads
45 (#354,073)

6 months
10 (#270,763)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degree structures of conjunctive reducibility.Irakli Chitaia & Roland Omanadze - 2021 - Archive for Mathematical Logic 61 (1):19-31.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Some structural properties of quasi-degrees.Roland Sh Omanadze - 2018 - Logic Journal of the IGPL 26 (1):191-201.

View all 14 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21-24):339-356.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21‐24):339-356.
Spectra and halting problems.Louise Hay - 1975 - Mathematical Logic Quarterly 21 (1):167-176.

View all 7 references / Add more references