scientific article; zbMATH DE number 3726330

MaRDI QIDQ3914974zbMATHFDO

Authors Klaus Weihrauch

Publication date 1981

zbMATH Keywords

continuitycomputabilitycomplete partial orderseffective cpo's

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15) Abstract and axiomatic computability and recursion theory (03D75)

Cited in

(3)

• Admissible representations of effective cpo's
• A domain-theoretic approach to computability on the real line
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory

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