dc.contributor.author | Moll, Robert | en_US |
dc.date.accessioned | 2023-03-29T14:03:18Z | |
dc.date.available | 2023-03-29T14:03:18Z | |
dc.date.issued | 1973-05 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/148861 | |
dc.description.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... | en_US |
dc.relation.ispartofseries | MIT-LCS-TM-032 | |
dc.relation.ispartofseries | MAC-TM-032 | |
dc.title | An Operator Embedding Theorem for Complexity Classes of Recursive Functions | en_US |
dc.identifier.oclc | 09618696 | |