From axiomatics to intrinsic characterization: some open problems in computable analysis
From MaRDI portal
(Redirected from Publication:1292411)
Cites work
- A notion of mechanistic theory
- Computability and Noncomputability in Classical Analysis
- Computability on computable metric spaces
- Computable functionals
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- Elementary induction on abstract structures
- Higher recursion theory
- scientific article; zbMATH DE number 3112803 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 3685474 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 1222103 (Why is no real title available?)
- scientific article; zbMATH DE number 1222111 (Why is no real title available?)
- scientific article; zbMATH DE number 800363 (Why is no real title available?)
- scientific article; zbMATH DE number 908753 (Why is no real title available?)
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- On the definitions of computable real continuous functions
- Recursion on the countable functionals
- Recursive Functionals and Quantifiers of Finite Types II
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
- The wave equation with computable initial data such that its unique solution is not computable
This page was built for publication: From axiomatics to intrinsic characterization: some open problems in computable analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292411)
