Computability in analysis and physics
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60) Research exposition (monographs, survey articles) pertaining to functional analysis (46-02) Constructive functional analysis (46S30)
Recommendations
Cited in
(26)- Computability of physical operations
- A refined model of computation for continuous problems
- On the inductive inference of recursive real-valued functions
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Index sets in computable analysis
- Concrete models of computation for topological algebras
- On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
- Computability in harmonic analysis
- Finite time blowup for an averaged three-dimensional Navier-Stokes equation
- Introduction to the special issue: Computability of the physical
- Randomness and differentiability
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- scientific article; zbMATH DE number 1390023 (Why is no real title available?)
- The prime number theorem is PRA-provable
- Semantics of computable physical models
- Effectiveness in RPL, with applications to continuous logic
- Computability of finite-dimensional linear subspaces and best approximation
- Comment on Feynman's ``Simulating physics with computers
- Imprecision in martingale- and test-theoretic prequential randomness
- A comparative study of the smallest probability intervals for which a binary sequence is random
- Randomness and imprecision: from supermartingales to randomness tests
- Computability of classification and deep learning: from theoretical limits to practical feasibility through quantization
- On effective convergence in Fekete's lemma and related combinatorial problems in information theory
- Computability and the morphological complexity of some dynamics on continuous domains
- Computation, hypercomputation, and physical science
This page was built for publication: Computability in analysis and physics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5274810)
