Pages that link to "Item:Q3994907"
From MaRDI portal
The following pages link to Computability in analysis and physics (Q3994907):
Displaying 35 items.
- MAXIMAL COMPUTABILITY STRUCTURES (Q5283447) (← links)
- Annual Meeting of the Association for Symbolic Logic, Durham, 1992 (Q5287697) (← links)
- Computability of solutions of operator equations (Q5307604) (← links)
- Computability of compact operators on computable Banach spaces with bases (Q5307605) (← links)
- Primitive recursive real numbers (Q5307606) (← links)
- Computable analysis of the abstract Cauchy problem in a Banach space and its applications I (Q5307615) (← links)
- Degrees of unsolvability of continuous functions (Q5311741) (← links)
- Computational unsolvability of domains of attraction of nonlinear systems (Q5322874) (← links)
- USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS (Q5346702) (← links)
- When series of computable functions with varying domains are computable (Q5396227) (← links)
- Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
- Computability of Minimizers and Separating Hyperplanes (Q5687417) (← links)
- Representations of Analytic Functions and Weihrauch Degrees (Q5740198) (← links)
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (Q5855756) (← links)
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM (Q5858927) (← links)
- Computing on the Banach space C [ 0 , 1 ] (Q5859846) (← links)
- Point Degree Spectra of Represented Spaces (Q5864311) (← links)
- Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
- Iteration, inequalities, and differentiability in analog computers (Q5925968) (← links)
- Robustness analysis via the running time of the interior point methods (Q5958427) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q6076350) (← links)
- Computable Stone spaces (Q6109093) (← links)
- Computable approximations of a chainable continuum with a computable endpoint (Q6139238) (← links)
- Separating notions in effective topology (Q6142834) (← links)
- How much partiality is needed for a theory of computability? (Q6146825) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
- Complexity profiles and generic Muchnik reducibility (Q6182774) (← links)
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)
- How real is incomputability in physics? (Q6549689) (← links)
- Feasible real random access machines (Q6560189) (← links)
- Wormholes, superfast computations, and Selivanov's theorem (Q6561174) (← links)
- An arithmetic analysis of closed surfaces (Q6567114) (← links)
- Computably and punctually universal spaces (Q6614035) (← links)
- Comparing computability in two topologies (Q6642884) (← links)
