Handbook of computability and complexity in analysis

DOI10.1007/978-3-030-59234-9MaRDI QIDQ4990021zbMATH OpenOpenAlexFDO

Authors

Publication date 27 May 2021

Published in Theory and Applications of Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59234-9

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to mathematical logic and foundations (03-00) Computation over the reals, computable analysis (03D78)

Recommendations

• scientific article; zbMATH DE number 1460545
• New Computational Paradigms
• Handbook of computability theory
• scientific article; zbMATH DE number 1303206
• scientific article; zbMATH DE number 42077

Cited in

(29)

• Handbook of computability theory
• On the computability of the set of automorphisms of the unit square
• On envelopes and backward approximations
• Degrees of non-computability of homeomorphism types of Polish spaces
• Effective notions of weak convergence of measures on the real line
• Realizing semicomputable simplices by computable dynamical systems
• Notes on computable analysis
• Computability in analysis and physics
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Weihrauch goes Brouwerian
• Lawvere-Tierney topologies for computability theorists
• On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
• A syntactic approach to Borel functions: some extensions of Louveau's theorem
• Effective weak and vague convergence of measures on the real line
• Minimal covers in the Weihrauch degrees
• On the complexity of robust eventual inequality testing for C-finite functions
• Translation-like actions by \(\mathbb{Z} \), the subgroup membership problem, and Medvedev degrees of effective subshifts
• Computability of initial value problems
• Computation with real numbers and continuous-time dynamical systems
• Evaluative presentations
• On computability of equilibrium states
• On the algorithmic descriptive complexity of attractors in topological dynamics
• Effective dynamical systems beyond dimension zero and factors of SFTs
• On the complexity of spectra of bounded analytic functions
• Simulation of Turing machines with analytic discrete ODEs: polynomial-time and space over the reals characterised with discrete ordinary differential equations
• A practical extension of computational complexity theory for applications in mathematics and sciences
• Degree spectra of homeomorphism type of compact Polish spaces
• Solving SAT by restricted spiking neural P systems with temporal division rules
• Deciding robust instances of an escape problem for dynamical systems in Euclidean space

This page was built for publication: Handbook of computability and complexity in analysis

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