On the computational complexity of algebraic numbers : the Hartmanis-Stearns problem revisited

Abstract : — We consider the complexity of integer base expansions of algebraic irrational numbers from a computational point of view. We show that the Hartmanis–Stearns problem can be solved in a satisfactory way for the class of multistack machines. In this direction, our main result is that the base-b expansion of an algebraic irrational real number cannot be generated by a deterministic pushdown automaton. We also confirm an old claim of Cobham proving that such numbers cannot be generated by a tag machine with dilation factor larger than one.
Liste complète des métadonnées

Cited literature [41 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01254293
Contributor : Boris Adamczewski <>
Submitted on : Tuesday, January 12, 2016 - 2:40:01 PM
Last modification on : Thursday, April 11, 2019 - 12:34:16 PM
Document(s) archivé(s) le : Thursday, November 10, 2016 - 11:40:25 PM

File

HartmanisStearns12:01:2016.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01254293, version 1
  • ARXIV : 1601.02771

Citation

Boris Adamczewski, Julien Cassaigne, Marion Le Gonidec. On the computational complexity of algebraic numbers : the Hartmanis-Stearns problem revisited. Transactions of the American Mathematical Society, American Mathematical Society, In press. ⟨hal-01254293⟩

Share

Metrics

Record views

1388

Files downloads

265