scientific article; zbMATH DE number 1460545

Publication date: 18 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Turing machines computability computable analysis type-2 theory of effectivity computable metric spaces naming systems

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Constructive and recursive analysis (03F60) Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Constructive real analysis (26E40)

Related Items

Characterizing time computational complexity classes with polynomial differential equations, Abstract State Machines with Exact Real Arithmetic, Algebraic properties of the first-order part of a problem, On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1, Primitive recursive reverse mathematics, Semantics of computable physical models, Numberings, c.e. oracles, and fixed points, Recursive solution of initial value problems with temporal discretization, The ksmt calculus is a $\delta $-complete decision procedure for non-linear constraints, On the complexity of the theory of a computably presented metric structure, The dependence of computability on numerical notations, Generalized effective completeness for continuous logic, THE DISCONTINUITY PROBLEM, Computable approximations of a chainable continuum with a computable endpoint, Effective weak and vague convergence of measures on the real line, Separating notions in effective topology, On the main scientific achievements of Victor Selivanov, Notes on overt choice, How much partiality is needed for a theory of computability?, The complexity of finding supergraphs, A domain-theoretic framework for robustness analysis of neural networks, Computable soft separation axioms, A continuous characterization of PSPACE using polynomial ordinary differential equations, Extracting total Amb programs from proofs, COMPUTABLY COMPACT METRIC SPACES, Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing, Arithmetical hierarchy of the Besicovitch-stability of noisy tilings, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Unnamed Item, Primitive recursive ordered fields and some applications, Quantitative continuity and Computable Analysis in Coq, Computability of measurable sets via effective metrics, Weakly computable real numbers, Algorithmic randomness over general spaces, Probability, statistics and computation in dynamical systems, Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization, Wadge hardness in Scott spaces and its effectivization, Kolmogorov complexity and the geometry of Brownian motion, Positive predicate structures for continuous data, Wadge-like reducibilities on arbitrary quasi-Polish spaces, Effective metric model theory, Some hierarchies of QCB₀-spaces, Computable analysis and Blaschke products, Experimental computation of real numbers by Newtonian machines, The Church-Turing Thesis over Arbitrary Domains, Non-computable Julia sets, The fan theorem and unique existence of maxima, ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES, WEIHRAUCH GOES BROUWERIAN, COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM, Computing on the Banach space C [ 0 , 1 ], Point Degree Spectra of Represented Spaces, Effectivizing Lusin’s Theorem, Computability of measurable sets via effective topologies, The Hausdorff-Ershov hierarchy in Euclidean spaces, A stream calculus of bottomed sequences for real number computation, A semilattice of degrees of computable metrics, New degree spectra of Polish spaces, Reducibilities relating to Schnorr randomness, Primitive recursive ordered fields and some applications, Exact real computation of solution operators for linear analytic systems of partial differential equations, Computability versus exact computability of martingales, On the computing power of fuzzy Turing machines, Optimization problems with fixed volume constraints and stability results related to rearrangement classes, Computing with polynomial ordinary differential equations, Some remarks on real numbers induced by first-order spectra, Can we compute the similarity between surfaces?, Towards a descriptive set theory for domain-like structures, Representing probability measures using probabilistic processes, On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain, Effectively open real functions, Towards computability of elliptic boundary value problems in variational formulation, Pre-apartness structures on spaces of functions, Effective continuities on effective topological spaces, The basic feasible functionals in computable analysis, Computing Schrödinger propagators on type-2 Turing machines, Computation with perturbed dynamical systems, Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Computability of analog networks, On the complexity of computing the logarithm and square root functions on a complex domain, CGMurphi: automatic synthesis of numerical controllers for nonlinear hybrid systems, Independent subbases and non-redundant codings of separable metrizable spaces, Dimension spectra of random subfractals of self-similar fractals, PAC learning, VC dimension, and the arithmetic hierarchy, Computable Carathéodory theory, The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma, Fixed point theorems on partial randomness, Effective subsets under homeomorphisms of $\mathbb{R}^n$, Closed choice and a uniform low basis theorem, Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra, An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable, Beta-shifts, their languages, and computability, Effectiveness in RPL, with applications to continuous logic, Recursive analysis of singular ordinary differential equations, Computability of finite-dimensional linear subspaces and best approximation, The derivational complexity of string rewriting systems, Computational complexity of iterated maps on the interval, Metric spaces in synthetic topology, Computability of Brolin-Lyubich measure, Computability of entropy and information in classical Hamiltonian systems, Borel complexity and computability of the Hahn-Banach theorem, The elementary computable functions over the real numbers: applying two new techniques, Computability and the morphological complexity of some dynamics on continuous domains, Characterizations of semicomputable sets of real numbers, On computability of the Galerkin procedure, Sheaf toposes for realizability, Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy, A Wadge hierarchy for second countable spaces, On the computational complexity of the Riemann mapping, Are unbounded linear operators computable on the average for Gaussian measures?, Fractal dimension versus process complexity, Fine hierarchies and m-reducibilities in theoretical computer science, Computable neighbourhoods of points in semicomputable manifolds, The computable kernel of abstract state machines, Computability on random events and variables in a computable probability space, Automata theory based on complete residuated lattice-valued logic: Turing machines, Addendum to: ``The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma, Topological properties of concept spaces (full version), Representation theorems for analytic machines and computability of analytic functions, Computability of countable subshifts in one dimension, Computing interpolating sequences, A differential operator and weak topology for Lipschitz maps, On the asymptotic behavior of odd operators, Curves that must be retraced, The computational complexity of distance functions of two-dimensional domains, The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited, On computational complexity of Siegel Julia sets, A characterization of computable analysis on unbounded domains using differential equations, Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society, The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience), Co-c.e. sets with disconnected complements, Jordan curves with polynomial inverse moduli of continuity, Abstract geometrical computation. III: Black holes for classical and analog computing, The metamathematics of ergodic theory, A computable version of Banach's inverse mapping theorem, Operational domain theory and topology of sequential programming languages, Coinduction for exact real number computation, Classification of computably approximable real numbers, A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties, A computable approach to measure and integration theory, Computable de Finetti measures, Computing fundamental domains for Fuchsian groups, Computing the uncomputable; or, the discrete charm of second-order simulacra, Computations via Newtonian and relativistic kinematic systems, The influence of domain interpretations on computational models, What is a universal computing machine?, Computational bounds on polynomial differential equations, Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms, Three concepts of decidability for general subsets of uncountable spaces, Stability versus speed in a computable algebraic model, Divergence bounded computable real numbers, A certified, corecursive implementation of exact real numbers, Admissible digit sets, Is the Mandelbrot set computable?, Genericity of weakly computable objects, Demuth’s Path to Randomness, Polynomial differential equations compute all real computable functions on computable compact intervals, Semantics of a sequential language for exact real-number computation, Towards Formalizing Non-monotonic Reasoning in Physics: Logical Approach Based on Physical Induction and Its Relation to Kolmogorov Complexity, Computability and Dynamical Systems, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, The Kolmogorov complexity of infinite words, $\mathbf P =\mathbf{NP}$ for some structures over the binary words, Denotational semantics of hybrid automata, Computability of probability measures and Martin-Löf randomness over metric spaces, Statistical properties of dynamical systems -- Simulation and abstract computation, APPROXIMATING BEPPO LEVI’S PRINCIPIO DI APPROSSIMAZIONE, Relative computability and uniform continuity of relations, Effective genericity and differentiability, Real-time computability of real numbers by chemical reaction networks, A variational principle in the parametric geometry of numbers, with applications to metric Diophantine approximation, Spectrum of the field of computable real numbers, A domain-theoretic approach to Brownian motion and general continuous stochastic processes, On images of partial computable functions over computable Polish spaces, Effective wadge hierarchy in computable quasi-Polish spaces, A semi-potential for finite and infinite games in extensive form, The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable, On Effective Convergence of Numerical Solutions for Differential Equations, Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract), Computability of pseudo-cubes, Descriptive complexity of $\mathsf{qc} \mathsf{b}_0$-spaces, Combining Interval and Probabilistic Uncertainty: What Is Computable?, Computability on measurable functions, Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations, On the complexity of computing the Hausdorff distance, The Vitali Covering Theorem in the Weihrauch Lattice, Computable Model Theory over the Reals, On degree spectra of topological spaces, Guessing singular dependencies, Many-one reductions and the category of multivalued functions, Execution trace sets for real computation, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, Computable irrational numbers with representations of surprising complexity, Bounding the dimension of points on a line, Intuitionistic fixed point logic, Completion of choice, Stability of representations of effective partial algebras, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting), Computable subcontinua of semicomputable chainable Hausdorff continua, Pointwise complexity of the derivative of a computable function, Generalised entropies and asymptotic complexities of languages, Models of computation for partial functions on the reals, The P$\neq$ NP conjecture in the context of real and complex analysis, Embedding infinitely parallel computation in Newtonian kinematics, A hypercomputational alien, How much can analog and hybrid systems be proved (super-)Turing, The many forms of hypercomputation, Chainable and circularly chainable semicomputable sets in computable topological spaces, On the computational content of the Lawson topology, A computable version of the Daniell-Stone theorem on integration and linear functionals, DEMUTH’S PATH TO RANDOMNESS, On uniform relationships between combinatorial problems, Analytical properties of resource-bounded real functionals, Parametrised second-order complexity theory with applications to the study of interval computation, An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages, Computable structures and operations on the space of continuous functions, Weihrauch degrees, omniscience principles and weak computability, Sorting real numbers in $O(n \sqrt{\log n})$ time and linear space, Investigations on the approximability and computability of the Hilbert transform with applications, Effective Choice and Boundedness Principles in Computable Analysis, Discreteness is undecidable, On the Kolmogorov Complexity of Continuous Real Functions, Complexity Issues for Preorders on Finite Labeled Forests, Randomness and the Ergodic Decomposition, Computability of the Radon-Nikodym Derivative, Multi-Resolution Cellular Automata for Real Computation, Uniqueness, continuity and the existence of implicit functions in constructive analysis, Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System, Mutual Dimension, Moduli of regularity and rates of convergence for Fejér monotone sequences, A game-semantic model of computation, $K$-triviality in computable metric spaces, An experimental investigation of the normality of irrational algebraic numbers, Uniform test of algorithmic randomness over a general space, Continuity and computability of reachable sets, Randomness for non-computable measures, Computable scalar fields: A basis for PDE software, On TAE machines and their computational power, Unified characterizations of lowness properties via Kolmogorov complexity, Exact real arithmetic using centred intervals and bounded error terms, Computing geometric Lorenz attractors with arbitrary precision, Computability aspects for 1st-order partial differential equations via characteristics, Elementarily computable functions over the real numbers and $\mathbb R$-sub-recursive functions, A Convenient Category of Domains, Unexpected distribution phenomenon resulting from Cantor series expansions, On the Computable Theory of Bounded Analytic Functions, Probabilistic computability and choice, Characterizing polynomial time complexity of stream programs using interpretations, The Kripke schema in metric topology, Universality, optimality, and randomness deficiency, Generalized finite automata over real and complex numbers, Schnorr triviality and its equivalent notions, Cryptography and algorithmic randomness, Effective Borel measurability and reducibility of functions, Alan Turing and the Foundations of Computable Analysis, Unnamed Item, Towards Using Exact Real Arithmetic for Initial Value Problems, Partial Randomness and Dimension of Recursively Enumerable Reals, Points on Computable Curves of Computable Lengths, Computability and Analysis, a Historical Approach, The Brouwer Fixed Point Theorem Revisited, Towards Computational Complexity Theory on Advanced Function Spaces in Analysis, On the Lattices of Effectively Open Sets, Base-Complexity Classifications of QCB $$_0$$ 0 -Spaces, Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$, Randomness and Differentiability of Convex Functions, Rice’s Theorem in Effectively Enumerable Topological Spaces, Towards the Effective Descriptive Set Theory, On Computability of Navier-Stokes’ Equation, UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES, On computability and disintegration, Computations with oracles that measure vanishing quantities, A comparison of concepts from computable analysis and effective descriptive set theory, On the computational complexity of the Dirichlet Problem for Poisson's Equation, Computable elements and functions in effectively enumerable topological spaces, Effective Riemann mappings of multiply connected domains and Riemann surfaces, Towards a descriptive theory of cb₀-spaces, A uniformly computable Implicit Function Theorem, Programming Experimental Procedures for Newtonian Kinematic Machines, Internal Density Theorems for Hierarchies of Continuous Functionals, Seven Kinds of Computable and Constructive Infelicities in Economics, Dimensions of Points in Self-similar Fractals, ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM, Hierarchies of function classes defined by the first-value operator, Probability and algorithmics: a focus on some recent developments, Computable symbolic dynamics, On Turing degrees of points in computable topology, Sequential real number computation and recursive relations, Uniformly computable aspects of inner functions: estimation and factorization, On Σ‐definability without equality over the real numbers, Singular coverings and non‐uniform notions of closed set computability, Topological Properties of Concept Spaces, Well-Quasi Orders and Hierarchy Theory, Computability of the Solutions to Navier-Stokes Equations via Effective Approximation, Theses for Computation and Recursion on Concrete and Abstract Structures, Generalizing Computability Theory to Abstract Algebras, A SOLUTION TO THE SURPRISE EXAM PARADOX IN CONSTRUCTIVE MATHEMATICS, Characterization of sets of limit measures of a cellular automaton iterated on a random configuration, The power of backtracking and the confinement of length, On the algebraic structure of Weihrauch degrees, Computable and Continuous Partial Homomorphisms on Metric Partial Algebras, Effectivity and effective continuity of multifunctions, On 0′-computable reals, Computing Uniform Bounds, Hypergeometric Functions in Exact Geometric Computation, A Comparison of Certain Representations of Regularly Closed Sets, Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis, Effectiveness for Embedded Spheres and Balls, Real Numbers and BDDs, The Computational Complexity of Some Julia Sets, A Natural Weak Limit Space with Admissible Representation which is not a Limit Space, Representations of Complete Uniform Spaces via Uniform Domains, The Solution Operator of the Korteweg-de Vries Equation is Computable, Effectively Absolute Continuity and Effective Jordan Decomposability, A Relationship between Equilogical Spaces and Type Two Effectivity, Stability for Effective Algebras, On the Effective Existence of Schauder Bases, Characterizing Computable Analysis with Differential Equations, Computability and Representations of the Zero Set, Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces, How Incomputable is the Separable Hahn-Banach Theorem?, Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach, Towards Computability over Effectively Enumerable Topological Spaces, Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains, Jordan Areas and Grids, Complexity of Blowup Problems, An Effective Tietze-Urysohn Theorem for QCB-Spaces, Computing Solutions of Symmetric Hyperbolic Systems of PDE's, On the Difference Hierarchy in Countably Based T0-Spaces, On the Continuity of Effective Multifunctions, On Finite-time Computability Preserving Conversions, Computable Riesz Representation for Locally Compact Hausdorff Spaces, On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions, Uniformly Computable Aspects of Inner Functions, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi mathvariant="script">E</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>-computability of e, π and Other Famous Constants, Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs, Singular Coverings and Non-Uniform Notions of Closed Set Computability, First-Order Universality for Real Programs, Computability of Continuous Solutions of Higher-Type Equations, Computable Exchangeable Sequences Have Computable de Finetti Measures, Computability of Analytic Functions with Analytic Machines, An Application of Martin-Löf Randomness to Effective Probability Theory, Fixed Point Theorems on Partial Randomness, Computable topological groups and Pontryagin duality, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, Prediction of Recursive Real-Valued Functions from Finite Examples, Unnamed Item, Unnamed Item, Computability, noncomputability and undecidability of maximal intervals of IVPs, In Praise of Numerical Computation, Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems, Local stability of ergodic averages, Effective Borel degrees of some topological functions, An analog characterization of the Grzegorczyk hierarchy, The fixed-point property for represented spaces, Proof mining in $L_{1}$-approximation, Quantitative analysis of a subgradient-type method for equilibrium problems, Recursion and topology on $2^{\leq\omega}$ for possibly infinite computations, Domain theoretic second-order Euler's method for solving initial value problems, On the uniform computational content of the Baire category theorem, Comparing representations for function spaces in computable analysis, On the maximality of degrees of metrics under computable reducibility, Axiomatic reals and certified efficient exact real computation, Betwixt Turing and Kleene, Between Turing and Kleene, Computable reducibility of metrics on the reals, Abstract geometrical computation. VIII: Small machines, accumulations \& rationality, The Hausdorff and dynamical dimensions of self-affine sponges: a dimension gap result, A topological view on algebraic computation models, The rate of convergence of the walk on spheres algorithm, On the information carried by programs about the objects they compute, On the uniform computational content of computability theory, Random elements in effective topological spaces with measure., Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Characterization of Kurtz randomness by a differentiation theorem, Reducibility of computable metrics on the real line, Semicomputable manifolds in computable topological spaces, A blend of methods of recursion theory and topology., On constructive number fields and computability of solutions of PDEs, Warsaw discs and semicomputability, On the hierarchy and extension of monotonically computable real numbers., Recursive quasi-metric spaces., Computability on subsets of metric spaces., A constructive theory of point-set nearness., Hierarchies of total functionals over the reals, $\Sigma$-definability in hereditarily finite superstructures and computable analysis, Algorithmic identification of probabilities is hard, Algorithmic randomness and Fourier analysis, Abstract geometrical computation. V: Embedding computable analysis, Computability in planar dynamical systems, A survey of recursive analysis and Moore's notion of real computation, A blend of methods of recursion theory and topology: a $\Pi_1^0$ tree of shadow points, On approximations for functions in the space of uniformly convergent Fourier series, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, A Banach-Mazur computable but not Markov computable function on the computable real numbers, Outline of partial computability in computable topology, Towards computable analysis on the generalised real line, On higher effective descriptive set theory, Game characterizations and lower cones in the Weihrauch degrees, Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines, Some computational aspects of metric fixed-point theory, Computability, noncomputability, and hyperbolic systems, An optical model of computation, Efficient exact computation of iterated maps, Real number computation with committed choice logic programming languages, Recent progress in exact geometric computation, Non computable Mandelbrot-like sets for a one-parameter complex family, A note on computable distinguishing colorings, Bounded Turing reductions and data processing inequalities for sequences, Effective Hausdorff dimension in general metric spaces, Computable metrics above the standard real metric, Computability of products of chainable continua, Precomplete numberings, Polynomial time over the reals with parsimony, Dense computability structures, Highness properties close to PA completeness, The \texttt{ksmt} calculus is a $\delta $-complete decision procedure for non-linear constraints, On the computability of the set of automorphisms of the unit square, Language equations, An effective Riemann Mapping Theorem, Online computations of differentiable functions, Problems, solutions, and completions, Constructing locally connected non-computable Julia sets, Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Constructive hybrid games, Irrational-based computability of functions, Computable topological abelian groups, A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations, On envelopes and backward approximations, Computational complexity of classical solutions of partial differential equations, Effective compactness and orbits of points under the isometry group, Metric spaces are universal for bi-interpretation with metric structures, Real computations with fake numbers, Quantified constraints under perturbation, Some notes on spaces of ideals and computable topology, Liouville numbers and the computational complexity of changing bases, On the complexity of conversion between classic real number representations, Computable analysis and classification problems, Degrees of non-computability of homeomorphism types of Polish spaces, Quantitative coding and complexity theory of compact metric spaces, Computability and Beltrami fields in Euclidean space, Effective notions of weak convergence of measures on the real line, Domain representations of partial functions, with applications to spatial objects and constructive volume geometry., Topological properties of real number representations., Effectively closed sets and graphs of computable real functions., Real number computation through Gray code embedding., The closure properties on real numbers under limits and computable operators., Extended admissibility., Generated quasi-metric hyper and function spaces., Bit-complexity of solving systems of linear evolutionary partial differential equations, Dedekind cuts and long strings of zeros in base expansions, Computable procedures for fields, Non-collapse of the effective wadge hierarchy, Computable Riesz Representation for the Dual of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>C</mml:mi><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>;</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false"></mml:mo></mml:math>], Compactness in the Theory of Continuous Automata, MAXIMAL COMPUTABILITY STRUCTURES, On the Versatility of Open Logical Relations, Constructive Game Logic, Computability of convergence rates in the ergodic theorem for Martin-Löf random points, Three topological reducibilities for discontinuous functions, Effective aspects of Hausdorff and Fourier dimension, Non-collapse of the effective Wadge hierarchy, Robustness and Randomness, Computability of solutions of operator equations, Computability of compact operators on computable Banach spaces with bases, Primitive recursive real numbers, Computable metrization, Computable Riesz representation for the dual of C [0; 1], Admissible representations for probability measures, Computing the topological entropy of shifts, Computable analysis of the abstract Cauchy problem in a Banach space and its applications I, Degrees of unsolvability of continuous functions, Dimension spectra of lines1, Intersection points of planar curves can be computed, Computational unsolvability of domains of attraction of nonlinear systems, A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES, Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems, Computability of topological pressure on compact shift spaces beyond finite type*, USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS, Unnamed Item, Computing the exact number of periodic orbits for planar flows, Unnamed Item, THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER, Computability of graphs, Unnamed Item, Computability at zero temperature, Game characterizations and lower cones in the Weihrauch degrees, A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma, Solovay reducibility and continuity, Computing the exponent of a Lebesgue space, When series of computable functions with varying domains are computable, Average-case polynomial-time computability of hamiltonian dynamics, Relating syntactic and semantic perturbations of hybrid automata, Computing with continuous objects: a uniform co-inductive approach, Physical Computational Complexity and First-order Logic, Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp>, On the computability of a construction of Brownian motion, Effective Symbolic Dynamics, Complexity of Operators on Compact Sets, On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane, Notions of Probabilistic Computability on Represented Spaces, Sequential Real Number Computation and Recursive Relations, Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines, Effectivity on Continuous Functions in Topological Spaces, On the Relationship between Filter Spaces and Weak Limit Spaces, On the Computability of Blochs Constant, Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus, Implementing Real Numbers With RZ, Computability of Topological Pressure for Shifts of Finite Type with Applications in Statistical Physics, Computability and the Implicit Function Theorem, Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I), Admissible Representations of Probability Measures, Computing the Topological Entropy of Shifts, Computability of Solutions of Operator Equations, Revising Type-2 Computation and Degrees of Discontinuity, Primitive Recursiveness of Real Numbers under Different Representations, Classification of the Computable Approximations by Divergence Boundings, On Computable Metrization, On Computable Compact Operators on Banach Spaces, Jordan Curves with Polynomial Inverse Moduli of Continuity, Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer, Unnamed Item, Unnamed Item, Unnamed Item, On the computability of rotation sets and their entropies, Feferman on Computability, Computable analysis with applications to dynamic systems, ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY, Connected choice and the Brouwer fixed point theorem, FOUNDATIONS OF ONLINE STRUCTURE THEORY, Continuous and monotone machines, Decomposing Borel functions using the Shore–Slaman join theorem, Weak colored local rules for planar tilings, Weihrauch and constructive reducibility between existence statements, Representations and evaluation strategies for feasibly approximable functions, Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision, THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE, Measures and their random reals, Unnamed Item, A NOTE ON p-ADIC SIMPLICIAL VOLUMES, Uniqueness in Planar Endogenous Business Cycle Theories, Computability of Real Numbers, Computability of Subsets of Metric Spaces, Computability of Differential Equations, Computable Complex Analysis, Computable Geometric Complex Analysis and Complex Dynamics, A Survey on Analog Models of Computation, Computable Measure Theory and Algorithmic Randomness, Algorithmic Fractal Dimensions in Geometric Measure Theory, Admissibly Represented Spaces and Qcb-Spaces, Weihrauch Complexity in Computable Analysis, On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem, Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages