On the complexity of computable real sequences

DOI10.1051/ITA/1987210201751MaRDI QIDQ3773335zbMATH OpenOpenAlexFDO

Authors Jacobo Torán

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

complexitycomputable real sequenceeffective convergence

Mathematics Subject Classification ID

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

Recommendations

• Weakly computable real numbers
• Descriptive complexity of computable sequences
• scientific article; zbMATH DE number 1304316
• The Effective Sequence of Uniformities and its Limit as a Methodology in Computable Analysis
• Descriptive complexity of computable sequences revisited

Cites work

• Computational complexity of real functions
• scientific article; zbMATH DE number 3720907 (Why is no real title available?)
• Nicht konstruktiv beweisbare Sätze der Analysis
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On computable sequences
• On the definitions of some complexity classes of real numbers
• Recursive Real Numbers

Cited in

(7)

• Sequentiality and piecewise-affinity in segments of Real-PCF
• Rice sequences of relations
• scientific article; zbMATH DE number 66690 (Why is no real title available?)
• scientific article; zbMATH DE number 1157657 (Why is no real title available?)
• scientific article; zbMATH DE number 1746031 (Why is no real title available?)
• Production en temps réel et complexité de structure de suites infinies
• scientific article; zbMATH DE number 1850721 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773335)