scientific article; zbMATH DE number 873331

zbMATH Open0855.03023MaRDI QIDQ4876432FDOQ4876432

Authors: Karl-Heinz Niggl 

Publication date: 5 May 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational complexityalgorithmcomplexity classesparallelismstructural complexityoperational semanticscomplete partial ordersScott domainsfunctional programming languagepartial primitive recursive functionalsimply typed term systempartial continuous functionalsparallel typed while program-computable functionalsreduction relation between terms

Mathematics Subject Classification ID

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

Cited In (7)

• Subrecursive hierarchies on Scott domains
• Computability over the partial continuous functionals
• Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals
• A total functional programming language computing APRA
• \({\mathcal M}^\omega\) considered as a programming language
• Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms
• Title not available (Why is that?)

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)