An operator embedding theorem for complexity classes of recursive functions (Q1225934): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Diversity of speed-ups and embeddability in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of computable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifications of Recursive Functions by Means of Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented loop languages and classes of computable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational speed-up by effective operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / rank
 
Normal rank

Latest revision as of 18:41, 12 June 2024

scientific article
Language Label Description Also known as
English
An operator embedding theorem for complexity classes of recursive functions
scientific article

    Statements