On classes of computable functions

DOI10.1145/800169.805421zbMath1282.68108OpenAlexW2084913650MaRDI QIDQ5402505

Sanat K. Basu

Publication date: 14 March 2014

Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800169.805421

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

An operator embedding theorem for complexity classes of recursive functions

This page was built for publication: On classes of computable functions