Pages that link to "Item:Q3994907"
From MaRDI portal
The following pages link to Computability in analysis and physics (Q3994907):
Displaying 50 items.
- Classification of computably approximable real numbers (Q1015380) (← links)
- Computing fundamental domains for Fuchsian groups (Q1032657) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms (Q1036533) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Simple equations on real intervals (Q1042414) (← links)
- Computability of physical operations (Q1103616) (← links)
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664) (← links)
- Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
- Computable invariance (Q1274805) (← links)
- Feasible real random access machines (Q1279912) (← links)
- Computable Banach spaces via domain theory (Q1292403) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- An effective Riemann Mapping Theorem (Q1292405) (← links)
- Markov's constructive analysis; a participant's view (Q1292407) (← links)
- From axiomatics to intrinsic characterization: some open problems in computable analysis (Q1292411) (← links)
- Online computations of differentiable functions (Q1292412) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Effectiveness of the global modulus of continuity on metric spaces (Q1292416) (← links)
- Effective properties of sets and functions in metric spaces with computability structure (Q1292419) (← links)
- On the computability of fractal dimensions and Hausdorff measure (Q1295381) (← links)
- Approximation methods in inductive inference (Q1295388) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II (Q1302291) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- Quantum systems with diagonal singularity: Their logic and intrinsic irreversibility (Q1381875) (← links)
- Limiting semantics of numerical programs (Q1392276) (← links)
- Random elements in effective topological spaces with measure. (Q1401925) (← links)
- A blend of methods of recursion theory and topology. (Q1412834) (← links)
- On an ad hoc computability structure in a Hilbert space (Q1425415) (← links)
- Recursive quasi-metric spaces. (Q1427771) (← links)
- Computability on subsets of metric spaces. (Q1427773) (← links)
- Unique existence, approximate solutions, and countable choice. (Q1427789) (← links)
- Grzegorczyk's hierarchy of computable analysis (Q1575655) (← links)
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions (Q1575670) (← links)
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441) (← links)
- Quantified constraints under perturbation (Q1600045) (← links)
- A constructive algorithm for finding the exact roots of polynomials with computable real coefficients. (Q1603892) (← links)
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions. (Q1607286) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Effective metric spaces and representations of the reals. (Q1607294) (← links)
- Effective simultaneous approximability of reals. (Q1607296) (← links)
- On the computability of Walsh functions. (Q1607297) (← links)
- Real number computation through Gray code embedding. (Q1607300) (← links)
- Interpolation functor and computability. (Q1607301) (← links)
- The closure properties on real numbers under limits and computable operators. (Q1607302) (← links)
- Extended admissibility. (Q1607303) (← links)
- Presentations of computably enumerable reals. (Q1607305) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
