Complexity of the calculus of continued fraction representation of real numbers

DOI10.1016/0304-3975(91)90275-7zbMath0745.03046OpenAlexW2026159946MaRDI QIDQ1814099

Salah Labhalla

Publication date: 25 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90275-7

zbMATH Keywords

additionrecursive analysisCauchy sequencecontinued fraction representation of real numbersprimitive recursive real numbers

Mathematics Subject Classification ID

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

Related Items

A note of best fractions of a computable real number ⋮ Complexity of the calculus of continued fraction representation of real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of real functions
• A comparison of polynomial time reducibilities
• Complexity of the calculus of continued fraction representation of real numbers
• 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