scientific article; zbMATH DE number 873331

MaRDI QIDQ4876432zbMATH OpenFDO

Authors Karl-Heinz Niggl

Publication date 5 May 1996

zbMATH Keywords

algorithmcomplete partial orderscomplexity classescomputational complexityfunctional programming languageoperational semanticsparallel typed while program-computable functionalsparallelismpartial continuous functionalspartial primitive recursive functionalreduction relation between termsScott domainssimply typed term systemstructural complexity

Mathematics Subject Classification ID

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

Recommendations

• Recursion on the partial continuous functionals
• scientific article; zbMATH DE number 3920456
• Subrecursive functions on partial sequences
• Hierarchies of total functionals over the reals
• Lower semicontinuous functionals with uniform sublevel sets
• Subrecursive hierarchies on Scott domains
• scientific article; zbMATH DE number 3857756
• Axiomatic recursion theory and the continuous functionals
• Subordination and H p Functions
• Subcontra-continuous functions

Cited in

(9)

• \({\mathcal M}^\omega\) considered as a programming language
• Subrecursive functions on partial sequences
• Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
• Degrees of parallelism in the continuous type hierarchy
• Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms
• A total functional programming language computing APRA
• scientific article; zbMATH DE number 3920456 (Why is no real title available?)
• Computability over the partial continuous functionals
• Subrecursive hierarchies on Scott domains

This page was built for publication:

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