scientific article; zbMATH DE number 3726330

zbMATH Open0464.03041MaRDI QIDQ3914974FDOQ3914974

Authors: Klaus Weihrauch 

Publication date: 1981

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

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)

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

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)