Towards a formal theory of computability

MaRDI QIDQ3081644zbMATH OpenFDO

Authors Simon Huber, Basil Karádais, Helmut Schwichtenberg

Publication date 9 March 2011

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Other constructive mathematics (03F65)

Recommendations

• Recursion on the partial continuous functionals
• scientific article; zbMATH DE number 4160688
• Computability over the partial continuous functionals
• Computability and totality in domains
• scientific article; zbMATH DE number 1169381

Cited in

(12)

• Toward a generalized computability theory
• Atomicity, coherence of information, and point-free structures
• Formalizing Turing Machines
• scientific article; zbMATH DE number 4212032 (Why is no real title available?)
• scientific article; zbMATH DE number 4160688 (Why is no real title available?)
• Nonflatness and totality
• scientific article; zbMATH DE number 817189 (Why is no real title available?)
• Normal forms, linearity, and prime algebraicity over nonflat domains
• Conversations with Bill about functionals and terms
• Recursion on the partial continuous functionals
• On the Omni-directional Emergence of Form in Computation
• Verified program extraction in number theory: the fundamental theorem of arithmetic and relatives

This page was built for publication: Towards a formal theory of computability

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