Effective simultaneous approximability of reals.

DOI10.1016/S0304-3975(01)00097-4zbMATH Open1042.68047MaRDI QIDQ1607296FDOQ1607296

Authors: Vladimir Nikolaevich Krupskiĭ 

Publication date: 31 July 2002

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

Recommendations

• Classification of computably approximable real numbers
• The approximation structure of a computably approximable real
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Approximation representations for reals and their wtt‐degrees
• On the hierarchy and extension of monotonically computable real numbers.

zbMATH Keywords

Kolmogorov complexityComputabilityScaleHierarchyDiophantine approximation problem

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Title not available (Why is that?)
• Diophantine approximation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Effective infinitesimals in \(\mathbb{R}\)
• Title not available (Why is that?)
• The approximation structure of a computably approximable real

This page was built for publication: Effective simultaneous approximability of reals.

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