scientific article; zbMATH DE number 3127537
From MaRDI portal
Publication:3243267
zbMATH Open0078.00703MaRDI QIDQ3243267FDOQ3243267
Authors: Daniel Lacombe 
Publication date: 1957
Title of this publication is not available (Why is that?)
Cited In (10)
- Approximation to measurable functions and its relation to probabilistic computation
- Computational complexity of real functions
- Effectiveness for embedded spheres and balls
- Singular coverings and non-uniform notions of closed set computability
- Some results in the effective descriptive set theory
- Weihrauch Complexity in Computable Analysis
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
- Computability and Analysis, a Historical Approach
- Notes on computable analysis
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 Q3243267)
