Show simple item record

dc.contributor.authorMoll, Roberten_US
dc.date.accessioned2023-03-29T14:03:18Z
dc.date.available2023-03-29T14:03:18Z
dc.date.issued1973-05
dc.identifier.urihttps://hdl.handle.net/1721.1/148861
dc.description.abstractLet 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.ispartofseriesMIT-LCS-TM-032
dc.relation.ispartofseriesMAC-TM-032
dc.titleAn Operator Embedding Theorem for Complexity Classes of Recursive Functionsen_US
dc.identifier.oclc09618696


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record