An Operator Embedding Theorem for Complexity Classes of Recursive Functions
Name
MIT-LCS-TM-032.pdf
Size
453.13 KB
Format
Adobe PDF
Checksum (MD5)
bbae4872e7611922161d3623b327c970
Author(s)
Moll, Robert
Date Issued
May 1973
Series/Report no.
MIT-LCS-TM-032
MAC-TM-032
Abstract
Let F (t) be the set of functions computable by some machine using no more than t(x) machine steps on all but finitely many arguments x. If we order the - classes under set inclusion as t varies over the recursive functions, then it is natural to ask how rich a structure is obtained. We show that this structure is very rich indeed. If R is any countable partial order and F is any total effective operator, then we show that there is a recursively enumerable sequence of...
Persistent DSpace Link
