Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms

DOI10.1016/0168-0072(94)00062-8zbMath0832.68057OpenAlexW1968367799MaRDI QIDQ1899150

Karl-Heinz Niggl

Publication date: 14 February 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)00062-8

zbMATH Keywords

structural complexitypartial primitive recursive functionalsprenormal terms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Separating NC along the \(\delta\) axis ⋮ \({\mathcal M}^\omega\) considered as a programming language

Cites Work

• Subrecursive hierarchies on Scott domains
• LCF considered as a programming language
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms