Subrecursive functions on partial sequences

DOI10.1007/S001530050122MaRDI QIDQ1306824zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Subrecursive hierarchies on Scott domains
• A restricted computation model on Scott domains and its partial primitive recursive functionals
• scientific article; zbMATH DE number 873331

Cited in

(5)

• scientific article; zbMATH DE number 4134024 (Why is no real title available?)
• Parallel functions in recursive program schemes
• scientific article; zbMATH DE number 3920456 (Why is no real title available?)
• Subsequence summation and the m function
• scientific article; zbMATH DE number 873331 (Why is no real title available?)

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

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