Computability structure of the Sobolev spaces and its applications
From MaRDI portal
Publication:1292420
DOI10.1016/S0304-3975(98)00302-8zbMath0916.68044OpenAlexW2026953223MaRDI QIDQ1292420
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00302-8
Sobolev spacescomputable continuous functionsecond-order hyperbolic and parabolic partial differential equations
Related Items
Computable sequences in the Sobolev spaces, Towards computability of elliptic boundary value problems in variational formulation, Computability of the Solutions to Navier-Stokes Equations via Effective Approximation, Computing Uniform Bounds, Computability of Differential Equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time computable curve whose interior has a nonrecursive measure
- Computational complexity of real functions
- On the computability of fractal dimensions and Hausdorff measure
- Computational complexity of fixed points and intersection points
- Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- L p -Computability in Recursive Analysis
- Computable functionals
- On the definitions of computable real continuous functions
- Computability and Noncomputability in Classical Analysis
- On the Definition of Computable Function of a Real Variable
- Derivatives of Computable Functions
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
