Computer Science for Continuous Data
From MaRDI portal
Computer Science for Continuous Data
Recommendations
- Back and forth between continuous and discrete for the working computer scientist
- Alan Turing and the foundations of computable analysis
- Computing over the reals: foundations for scientific computing.
- Applications of continuous mathematics to computer science
- scientific article; zbMATH DE number 1368926
Cites work
- scientific article; zbMATH DE number 3870001 (Why is no real title available?)
- scientific article; zbMATH DE number 5309066 (Why is no real title available?)
- scientific article; zbMATH DE number 3825797 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746043 (Why is no real title available?)
- scientific article; zbMATH DE number 7559471 (Why is no real title available?)
- scientific article; zbMATH DE number 7311152 (Why is no real title available?)
- scientific article; zbMATH DE number 3349776 (Why is no real title available?)
- scientific article; zbMATH DE number 2247480 (Why is no real title available?)
- A Note on the Computable Categoricity of \ell ^p ℓ p Spaces
- A fundamental effect in computations on real numbers
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Admissibly Represented Spaces and Qcb-Spaces
- Analytic root clustering: a complete algorithm using soft zero tests
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Complexity theory for spaces of integrable functions
- Computability in linear algebra
- Computability of probability distributions and characteristic functions
- Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
- Computable Measure Theory and Algorithmic Randomness
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Computational complexity of real functions
- Computer Science Logic
- Computing Haar Measures
- Computing a solution of Feigenbaum's functional equation in polynomial time
- Computing over the reals: foundations for scientific computing.
- Computing periods
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Feasible real random access machines
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Is the Mandelbrot set computable?
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Logical Approaches to Computational Barriers
- Numerical verification methods and computer-assisted proofs for partial differential equations
- On computable sequences
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Quantifier elimination for the reals with a predicate for the powers of two
- Real benefit of promises and advice
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- RealLib: An efficient implementation of exact real arithmetic
- Relative computability and uniform continuity of relations
- Representations of measurable sets in computable measure theory
- Singular coverings and non-uniform notions of closed set computability
- Solutions in \(L_ r\) of the Navier-Stokes initial value problem
- Soundness and Completeness of an Axiom System for Program Verification
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- The SIAM 100-Digit Challenge
- The computable multi-functions on multi-represented sets are closed under programming
- The computational complexity of maximization and integration
- The field of reals with a predicate for the powers of two
- The maximum value problem and NP real numbers
- The wave equation with computable initial data such that its unique solution is not computable
- Theory of representations
- Topological complexity with continuous operations
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Uniform domain representations of ℓp-spaces
- Verified compilation of floating-point computations
Cited in
(4)- Second-order parameterizations for the complexity theory of integrable functions
- A Coq formalization of Taylor models and power series for solving ordinary differential equations
- Extracting efficient exact real number computation from proofs in constructive type theory
- Verified exact real computation with nondeterministic functions and limits
This page was built for publication: Computer Science for Continuous Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487409)
