Constructivity, computability, and computational complexity in analysis
Author:
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 480-493
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Uniform computational complexity of Taylor series1987
- Subpolynomial complexity classes of real functions and real numbers1986
- Foundations of Constructive Mathematics1985
- Constructive Analysis1985
- Computational complexity of real functionsTheoretical Computer Science, 1982
- Fast Multiple-Precision Evaluation of Elementary FunctionsJournal of the ACM, 1976
- Berechenbare Reelle FunktionenMathematical Logic Quarterly, 1973
- Principles of Intuitionism1969
- On the definitions of computable real continuous functionsFundamenta Mathematicae, 1957
- On computable sequencesFundamenta Mathematicae, 1957