A note on comparison of subrecursive hierarchies

DOI10.1016/0020-0190(71)90002-0MaRDI QIDQ2551316zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1971

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(71)90002-0

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites work

• Approximation and complexity of functions on the integers
• scientific article; zbMATH DE number 3247155 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• scientific article; zbMATH DE number 3355013 (Why is no real title available?)
• scientific article; zbMATH DE number 3355016 (Why is no real title available?)
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• The Equivalence Problem of Simple Programs

Cited in

(2)

• On primitive recursive wordfunctions
• scientific article; zbMATH DE number 3623543 (Why is no real title available?)

This page was built for publication: A note on comparison of subrecursive hierarchies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2551316)