Notes on computable analysis

DOI10.1007/S00224-016-9732-YMaRDI QIDQ519888zbMATH OpenOpenAlexFDO

Authors Michelle Porter, Rodney G. Downey, Adam R. Day

Publication date 31 March 2017

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-016-9732-y

zbMATH Keywords

computable analysisconvex setsDarboux propertyBlaschke selection theoremBorel computablecomputable realcomputable real-valued functionMarkov computabletype II computable

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Foundations: limits and generalizations, elementary topology of the line (26A03)

Recommendations

• A tutorial on computable analysis
• scientific article; zbMATH DE number 1460545
• scientific article; zbMATH DE number 17564
• Handbook of computability and complexity in analysis
• scientific article; zbMATH DE number 1101599

Cites work

• scientific article; zbMATH DE number 446693 (Why is no real title available?)
• scientific article; zbMATH DE number 3112803 (Why is no real title available?)
• scientific article; zbMATH DE number 3127537 (Why is no real title available?)
• scientific article; zbMATH DE number 3140980 (Why is no real title available?)
• scientific article; zbMATH DE number 3143695 (Why is no real title available?)
• scientific article; zbMATH DE number 3145227 (Why is no real title available?)
• scientific article; zbMATH DE number 3163761 (Why is no real title available?)
• scientific article; zbMATH DE number 3871350 (Why is no real title available?)
• scientific article; zbMATH DE number 3183055 (Why is no real title available?)
• scientific article; zbMATH DE number 3183057 (Why is no real title available?)
• scientific article; zbMATH DE number 3661295 (Why is no real title available?)
• scientific article; zbMATH DE number 3720907 (Why is no real title available?)
• scientific article; zbMATH DE number 3744099 (Why is no real title available?)
• scientific article; zbMATH DE number 3743557 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 3485716 (Why is no real title available?)
• scientific article; zbMATH DE number 1746034 (Why is no real title available?)
• scientific article; zbMATH DE number 3285221 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• scientific article; zbMATH DE number 3329922 (Why is no real title available?)
• scientific article; zbMATH DE number 3355007 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• scientific article; zbMATH DE number 3083612 (Why is no real title available?)
• scientific article; zbMATH DE number 3090158 (Why is no real title available?)
• scientific article; zbMATH DE number 3110188 (Why is no real title available?)
• scientific article; zbMATH DE number 3110193 (Why is no real title available?)
• A Banach-Mazur computable but not Markov computable function on the computable real numbers
• A Function That Is Surjective on Every Interval
• A tutorial on computable analysis
• Algorithmic randomness and complexity.
• Computability of Julia sets
• Computable functionals
• Degrees of unsolvability of continuous functions
• Effective genericity and differentiability
• Nicht konstruktiv beweisbare Sätze der Analysis
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• Recursive Real Numbers
• Recursive analysis
• Recursively enumerable sets and degrees
• Square root approximations in Old Babylonian mathematics: YBC 7289 in context
• Subsystems of second order arithmetic
• The question of finitely many steps in polynomial ideal theory
• Turing's legacy. Developments from Turing's ideas in logic
• Uniform limits of Darboux functions
• Zur rekursiven Funktionentheorie

Cited in

(7)

• Turing reducibility in the fine hierarchy
• Computability in harmonic analysis
• Cousin’s lemma in second-order arithmetic
• Unprincipled
• Computability of Subsets of Metric Spaces
• Computability and analysis, a historical approach
• scientific article; zbMATH DE number 1124612 (Why is no real title available?)

This page was built for publication: Notes on computable analysis

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