A restricted computation model on Scott domains and its partial primitive recursive functionals

DOI10.1007/s001530050108zbMath0924.03088OpenAlexW1987785781MaRDI QIDQ1283120

Karl-Heinz Niggl

Publication date: 13 April 1999

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

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

zbMATH Keywords

parallelismcomputabilitycomputation model on Scott domainsenumeration functionalhierarchies of strictly increasing classesparallel typed while programspartial primitive recursive functionalsimultaneous course-of-values recursionterm system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65)

Related Items (1)

\({\mathcal M}^\omega\) considered as a programming language

This page was built for publication: A restricted computation model on Scott domains and its partial primitive recursive functionals