From axiomatics to intrinsic characterization: some open problems in computable analysis
type: Item
instance of: scholarly article
title: From axiomatics to intrinsic characterization: some open problems in computable analysis
zbMATH Open document ID: 0916.68051
DOI: 10.1016/S0304-3975(99)00294-7
author: Marian Boykan Pour-El
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1306138
zbMATH Keywords: Banach space
zbMATH Keywords: computability structure
MaRDI profile type: Publication
cites work: Q3880831
cites work: Computable functionals
cites work: On the definitions of computable real continuous functions
cites work: Q4217598
cites work: Recursive Functionals and Quantifiers of Finite Types II
cites work: A notion of mechanistic theory
cites work: Q3226754
cites work: Q4217607
cites work: Elementary induction on abstract structures
cites work: Recursion on the countable functionals
cites work: On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
cites work: The wave equation with computable initial data such that its unique solution is not computable
cites work: Computability and Noncomputability in Classical Analysis
cites work: Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
cites work: The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
cites work: Q3994907
cites work: Higher Recursion Theory
cites work: Q4849079
cites work: Q4888074
cites work: Q3751553
cites work: Computability on computable metric spaces
cites work: Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
description: scientific article; zbMATH DE number 1306138