Handbook of Computability and Complexity in Analysis
From MaRDI portal
Publication:4990021
DOI10.1007/978-3-030-59234-9zbMath1472.03001OpenAlexW4212786232MaRDI QIDQ4990021
No author found.
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
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)
Related Items (10)
Realizing semicomputable simplices by computable dynamical systems ⋮ 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 ⋮ On the computability of the set of automorphisms of the unit square ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ 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 ⋮ Lawvere-Tierney topologies for computability theorists
This page was built for publication: Handbook of Computability and Complexity in Analysis
