From axiomatics to intrinsic characterization: some open problems in computable analysis
From MaRDI portal
Publication:1292411
DOI10.1016/S0304-3975(99)00294-7zbMath0916.68051MaRDI QIDQ1292411
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
- Recursion on the countable functionals
- The wave equation with computable initial data such that its unique solution is not computable
- Elementary induction on abstract structures
- A notion of mechanistic theory
- Computability on computable metric spaces
- The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
- Computable functionals
- On the definitions of computable real continuous functions
- Computability and Noncomputability in Classical Analysis
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- Higher Recursion Theory
- Recursive Functionals and Quantifiers of Finite Types II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: From axiomatics to intrinsic characterization: some open problems in computable analysis
