scientific article; zbMATH DE number 841092

MaRDI QIDQ4863248zbMATH OpenFDO

Authors Dag Normann

Publication date 4 February 1996

zbMATH Keywords

rankrecursive functionalsScott domaintotal functionstotalityhigher order computationstransfinite hierarchy of domains

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Recommendations

• scientific article; zbMATH DE number 1405582
• Interpreting higher computations as types with totality
• Representation theorems for transfinite computability and definability
• Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
• Logical Approaches to Computational Barriers
• Closing the gap between the continuous functionals and recursion in \(^3E\)
• scientific article; zbMATH DE number 956826
• Publication:3028999
• scientific article; zbMATH DE number 2006631
• scientific article; zbMATH DE number 218515

Cited in

(6)

• Nonflatness and totality
• Hierarchies of total functionals over the reals
• Domain representations of topological spaces
• Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
• Computability and totality in domains
• Concrete models of computation for topological algebras

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