Pages that link to "Item:Q3994907"

The following pages link to Computability in analysis and physics (Q3994907):

Displaying 50 items.

• A Friedberg enumeration of equivalence structures (Q4596664) (← links)
• Analytic computable structure theory and $L^p$ spaces (Q4615025) (← links)
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
• Computable and Continuous Partial Homomorphisms on Metric Partial Algebras (Q4650302) (← links)
• Computable topological groups and Pontryagin duality (Q4691089) (← links)
• Effectively closed subgroups of the infinite symmetric group (Q4691363) (← links)
• European Summer Meeting of the Association for Symbolic Logic (Q4837676) (← links)
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space (Q4888348) (← links)
• On 0′-computable reals (Q4916179) (← links)
• Computing Uniform Bounds (Q4916180) (← links)
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)
• Effectiveness for Embedded Spheres and Balls (Q4916189) (← links)
• A Natural Weak Limit Space with Admissible Representation which is not a Limit Space (Q4916192) (← links)
• The Solution Operator of the Korteweg-de Vries Equation is Computable (Q4916194) (← links)
• Two Notions of Sequential Computability of a Function with Jumps (Q4916195) (← links)
• Effectively Absolute Continuity and Effective Jordan Decomposability (Q4916196) (← links)
• Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces (Q4918004) (← links)
• How Incomputable is the Separable Hahn-Banach Theorem? (Q4918007) (← links)
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach (Q4918008) (← links)
• Integral of Two-dimensional Fine-computable Functions (Q4918011) (← links)
• Complexity of Blowup Problems (Q4918017) (← links)
• Computing Solutions of Symmetric Hyperbolic Systems of PDE's (Q4918019) (← links)
• On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions (Q4918025) (← links)
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
• On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
• Computing the Solution of the m-Korteweg-de Vries Equation on Turing Machines (Q4918039) (← links)
• Finitely Bounded Effective Computability (Q4918041) (← links)
• Computability of the Spectrum of Self-Adjoint Operators and the Computable Operational Calculus (Q4918048) (← links)
• Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) (Q4921435) (← links)
• Computability of Solutions of Operator Equations (Q4921442) (← links)
• Jordan Curves with Polynomial Inverse Moduli of Continuity (Q4921453) (← links)
• Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
• (Q4989411) (← links)
• Representations and evaluation strategies for feasibly approximable functions (Q4995603) (← links)
• The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
• Computability of Real Numbers (Q5024567) (← links)
• Computability of Subsets of Metric Spaces (Q5024568) (← links)
• Computability of Differential Equations (Q5024569) (← links)
• Computable Complex Analysis (Q5024570) (← links)
• Computable Measure Theory and Algorithmic Randomness (Q5024573) (← links)
• Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
• Fast online multiplication of real numbers (Q5047161) (← links)
• Computing the exact number of periodic orbits for planar flows (Q5100021) (← links)
• Computability of graphs (Q5112388) (← links)
• Physical Computability Theses (Q5119662) (← links)
• Degrees of and lowness for isometric isomorphism (Q5145850) (← links)
• Computing the exponent of a Lebesgue space (Q5145851) (← links)
• (Q5155667) (← links)
• Feferman on Computability (Q5214780) (← links)
• Computable analysis with applications to dynamic systems (Q5220187) (← links)