Pages that link to "Item:Q3994907"
From MaRDI portal
The following pages link to Computability in analysis and physics (Q3994907):
Displaying 50 items.
- A topological view on algebraic computation models (Q1679677) (← links)
- On the functions generated by the general purpose analog computer (Q1680506) (← links)
- Reducibility of computable metrics on the real line (Q1703268) (← links)
- Semicomputable manifolds in computable topological spaces (Q1704608) (← links)
- Warsaw discs and semicomputability (Q1709073) (← links)
- The binary expansion and the intermediate value theorem in constructive reverse mathematics (Q1712938) (← links)
- Computability in planar dynamical systems (Q1761693) (← links)
- A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points (Q1762734) (← links)
- Computability of a function with jumps: Effective uniformity and limiting recursion (Q1763621) (← links)
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (Q1764798) (← links)
- A Banach-Mazur computable but not Markov computable function on the computable real numbers (Q1765159) (← links)
- Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines (Q1770395) (← links)
- Some computational aspects of metric fixed-point theory (Q1775881) (← links)
- Efficient exact computation of iterated maps (Q1779563) (← links)
- Using PVS to validate the algorithms of an exact arithmetic. (Q1853641) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Computable sequences in the Sobolev spaces (Q1884118) (← links)
- Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma (Q1919765) (← links)
- Computable preference and utility (Q1961959) (← links)
- On the time complexity of partial real functions (Q1977153) (← links)
- An example of noncomputability of exponents of a system of ordinary differential equations (Q1980446) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← links)
- A note on computable distinguishing colorings (Q2030129) (← links)
- Computability of products of chainable continua (Q2035483) (← links)
- Dense computability structures (Q2041062) (← links)
- The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q2055849) (← links)
- Randomness is inherently imprecise (Q2069032) (← links)
- On the computability of the set of automorphisms of the unit square (Q2072068) (← links)
- Irrational-based computability of functions (Q2097063) (← links)
- Computable topological abelian groups (Q2099260) (← links)
- On envelopes and backward approximations (Q2104271) (← links)
- Computational complexity of classical solutions of partial differential equations (Q2104279) (← links)
- Effective compactness and orbits of points under the isometry group (Q2105085) (← links)
- Computable analysis and classification problems (Q2106595) (← links)
- Degrees of non-computability of homeomorphism types of Polish spaces (Q2106604) (← links)
- Computable reducibility of metrics on the reals (Q2165612) (← links)
- Computability of pseudo-cubes (Q2187274) (← links)
- Computable subcontinua of semicomputable chainable Hausdorff continua (Q2235769) (← links)
- Pointwise complexity of the derivative of a computable function (Q2238149) (← links)
- Models of computation for partial functions on the reals (Q2258841) (← links)
- Chainable and circularly chainable semicomputable sets in computable topological spaces (Q2274137) (← links)
- Analytic computable structure theory and \(L^p\)-spaces. II (Q2309503) (← links)
- Moduli of regularity and rates of convergence for Fejér monotone sequences (Q2317680) (← links)
- Cryptography and algorithmic randomness (Q2354584) (← links)
- Fundamental notions of analysis in subsystems of second-order arithmetic (Q2368910) (← links)
- Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
- A domain-theoretic approach to Brownian motion and general continuous stochastic processes (Q2402275) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
