Some lowness properties and computational complexity sequences
- 1 January 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 6 (3) , 233-254
- https://doi.org/10.1016/0304-3975(78)90007-5
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On degrees of unsolvability and complexity propertiesThe Journal of Symbolic Logic, 1975
- Automorphisms of the lattice of recursively enumerable setsBulletin of the American Mathematical Society, 1974
- On complexity properties of recursively enumerable setsThe Journal of Symbolic Logic, 1973
- Recursive Properties of Abstract Complexity ClassesJournal of the ACM, 1972
- Computational speed-up by effective operatorsThe Journal of Symbolic Logic, 1972
- The use of lists in the study of undecidable problemsin automata theoryJournal of Computer and System Sciences, 1971
- On Some Games Which Are Relevant to the Theory of Recursively Enumerable SetsAnnals of Mathematics, 1970
- The degrees of hyperhyperimmune setsThe Journal of Symbolic Logic, 1969
- Degrees of recursively enumerable sets which have no maximal supersetsThe Journal of Symbolic Logic, 1968
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967