scientific article; zbMATH DE number 17564

zbMATH Open0751.03031MaRDI QIDQ3974889FDOQ3974889

Authors: Klaus Weihrauch 

Publication date: 26 June 1992

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

Recommendations

• A simple and powerful approach for studying constructivity, computability, and complexity
• scientific article; zbMATH DE number 1460545
• A tutorial on computable analysis
• scientific article; zbMATH DE number 2013199
• Closed sets and operators thereon: representations, computability and complexity

zbMATH Keywords

computabilityconstructive analysiscomputational complexity in analysisType 2 Theory of Effectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60)

Cited In (16)

• Small complexity classes for computable analysis
• Computability on computable metric spaces
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
• Constructive mathematics: a foundation for computable analysis
• Complexity theory for operators in analysis
• Proceedings of the 6th workshop on computability and complexity in analysis (CCA 2004), Lutherstadt Wittenberg, Germany, August 16--20, 2004
• Title not available (Why is that?)
• Complexity theory for operators in analysis
• Title not available (Why is that?)
• Weihrauch Complexity in Computable Analysis
• Title not available (Why is that?)
• Type‐2 computability on spaces of integrable functions
• A simple and powerful approach for studying constructivity, computability, and complexity
• On the complexity of the differential-algebraic description of analytic complexity classes
• On Computational Constructions in Function Spaces
• Notes on computable analysis

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