Subrecursive functions on partial sequences

DOI10.1007/s001530050122zbMath0938.03062OpenAlexW2069474971MaRDI QIDQ1306824

Karl-Heinz Niggl

Publication date: 5 October 1999

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050122

zbMATH Keywords

complexityparallelismfunction algebraGrzegorczyk classesScott domainsGrzegorczyk hierarchyprimitive recursion over partial sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

This page was built for publication: Subrecursive functions on partial sequences