On the complexity of computable real sequences

DOI10.1051/ita/1987210201751zbMath0634.68032OpenAlexW82070814MaRDI QIDQ3773335

Jacobo Toran

Publication date: 1987

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92282

zbMATH Keywords

complexityeffective convergencecomputable real sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Computational complexity of real functions
• On computable sequences
• On the definitions of some complexity classes of real numbers
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Nicht konstruktiv beweisbare Sätze der Analysis
• Recursive Real Numbers

This page was built for publication: On the complexity of computable real sequences