Analyse de complexité pour un théorème de Hall sur les fractions continues

Mathematical Logic Quarterly 42 (1):134-144 (1996)
  Copy   BIBTEX

Abstract

We give a polynomial time controlled version of a theorem of M. Hall: every real number can be written as the sum of two irrational numbers whose developments into a continued fraction contain only 1, 2, 3 or 4

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Real numbers, continued fractions and complexity classes.Salah Labhalla & Henri Lombardi - 1990 - Annals of Pure and Applied Logic 50 (1):1-28.
Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - Journal of Symbolic Logic 71 (2):399 - 424.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Computability of Minimizers and Separating Hyperplanes.Kam-Chau Wong - 1996 - Mathematical Logic Quarterly 42 (1):564-568.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Continued fractions of primitive recursive real numbers.Ivan Georgiev - 2015 - Mathematical Logic Quarterly 61 (4-5):288-306.
Some subrecursive versions of Grzegorczyk's Uniformity Theorem.Dimiter Skordev - 2004 - Mathematical Logic Quarterly 50 (4-5):520-524.

Analytics

Added to PP
2013-12-01

Downloads
21 (#1,002,183)

6 months
5 (#1,035,700)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Varieties of constructive mathematics.Douglas Bridges & Fred Richman - 1987 - New York: Cambridge University Press. Edited by Fred Richman.

Add more references