Hartmanis-Stearns Conjecture on Real Time and Transcendence
From MaRDI portal
Publication:2891306
DOI10.1007/978-3-642-27654-5_9zbMath1353.03052MaRDI QIDQ2891306
Publication date: 15 June 2012
Published in: Computation, Physics and Beyond (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27654-5_9
03D78: Computation over the reals, computable analysis
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(\mathfrak p\)-adic Thue-Siegel-Roth-Schmidt theorem
- Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms
- Transcendence of numbers with a low complexity expansion
- Automaticity. I: Properties of a measure of descriptional complexity
- How inductive inference strategies discover their errors
- Amount of nonconstructivity in deterministic finite automata
- Reversals and palindromes in continued fractions
- On the complexity of algebraic numbers. II: Continued fractions
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Mesures de transcendance et aspects quantitatifs de la méthode de Thue-Siegel-Roth-Schmidt
- Algorithms and Randomness
- The Construction of Decimals Normal in the Scale of Ten
- On the independence of expansions of algebraic numbers in an integer base
- On the Computational Complexity of Algorithms
- Linear forms in the logarithms of algebraic numbers
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Language identification in the limit
- Note on normal numbers
- Rational approximations to algebraic numbers
- An example of a computable absolutely normal number
