scientific article; zbMATH DE number 3113501
From MaRDI portal
Publication:3227567
Cited in
(6)- Approximation to measurable functions and its relation to probabilistic computation
- Computational complexity of real functions
- Computable invariance
- Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
- Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
- Computability and analysis, a historical approach
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3227567)