Hartmanis-Stearns Conjecture on Real Time and Transcendence

Recommendations

Ambarzumyan-type theorems on a time scale
On hyperarithmetical realizability
Real hypercomputation and continuity
Version réelle de la conjecture de Ramadanov
scientific article; zbMATH DE number 3962130
Hartogs extension theorems on Stein spaces
On finite-time hyperbolicity
On the Hartshorne-Hirschowitz theorem
Transcendental aspects of the Riemann-Hilbert correspondence
scientific article; zbMATH DE number 1541644

Cites work

scientific article; zbMATH DE number 18635 (Why is no real title available?)
scientific article; zbMATH DE number 3497806 (Why is no real title available?)
scientific article; zbMATH DE number 3588741 (Why is no real title available?)
scientific article; zbMATH DE number 1104353 (Why is no real title available?)
scientific article; zbMATH DE number 1542825 (Why is no real title available?)
scientific article; zbMATH DE number 4118449 (Why is no real title available?)
scientific article; zbMATH DE number 3383900 (Why is no real title available?)
scientific article; zbMATH DE number 3068971 (Why is no real title available?)
Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms
Algorithms and Randomness
Amount of nonconstructivity in deterministic finite automata
An example of a computable absolutely normal number
Automaticity. I: Properties of a measure of descriptional complexity
How inductive inference strategies discover their errors
Language identification in the limit
Linear forms in the logarithms of algebraic numbers
Most numbers obey no probability laws
Note on normal numbers
On the Computational Complexity of Algorithms
On the base-dependence of sets of numbers recognizable by finite automata
On the complexity of algebraic numbers. I: Expansions in integer bases
On the complexity of algebraic numbers. II: Continued fractions
On the independence of expansions of algebraic numbers in an integer base
Rational approximations to algebraic numbers
Reversals and palindromes in continued fractions
The Construction of Decimals Normal in the Scale of Ten
The \(\mathfrak p\)-adic Thue-Siegel-Roth-Schmidt theorem
Transcendence measures and quantitative aspects of the Thue-Siegel-Roth-Schmidt method
Transcendence of numbers with a low complexity expansion
Uniform tag sequences

Cited in

(2)

On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1

This page was built for publication: Hartmanis-Stearns Conjecture on Real Time and Transcendence

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