Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Computable analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if $p \geq 1… Expand
2014
2014
In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We… Expand
Highly Cited
2012
Highly Cited
2012
Abstract We classify the computational content of the Bolzano–Weierstras Theorem and variants thereof in the Weihrauch lattice… Expand
Highly Cited
2011
Highly Cited
2011
Abstract In this paper we study a new approach to classify mathematical theorems according to their computational content… Expand
2009
2009
We prove general theorems about unique existence of effective subalgebras of classical algebras. The theorems are consequences of… Expand
Highly Cited
2005
Highly Cited
2005
One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain… Expand
Highly Cited
2000
Highly Cited
2000
Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for… Expand
Highly Cited
1997
Highly Cited
1997
While for countable sets there is a single well established computability theory (ordinary recursion theory), Computable Analysis… Expand
Highly Cited
1985
Highly Cited
1985
Abstract An attempt is made to lay a basis for a general, unified, concise, and simple theory of computable and continuous… Expand