DocumentCode
2178439
Title
Recursion theoretic characterizations of complexity theoretic properties
Author
Bennison, Victor L. ; Soare, Robert I.
fYear
1977
fDate
Oct. 31 1977-Nov. 2 1977
Firstpage
100
Lastpage
106
Abstract
In this paper we exhibit recursion theoretic characterizations for two types of r.e. complexity sequences and use these characterizations to prove interesting facts about the classes of sets (or functions) possessing such complexity sequences.
Keywords
Computational complexity; Cost function; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1977., 18th Annual Symposium on
Conference_Location
Providence, RI, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1977.26
Filename
4567931
Link To Document