Hartmanis-Stearns Conjecture on Real Time and Transcendence
From MaRDI portal
Publication:2891306
DOI10.1007/978-3-642-27654-5_9zbMATH Open1353.03052OpenAlexW102338327MaRDI QIDQ2891306FDOQ2891306
Authors: Rūsiņš Freivalds 
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
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
- On the Computational Complexity of Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniform tag sequences
- Language identification in the limit
- An example of a computable absolutely normal number
- Most numbers obey no probability laws
- On the base-dependence of sets of numbers recognizable by finite automata
- Note on normal numbers
- The Construction of Decimals Normal in the Scale of Ten
- Title not available (Why is that?)
- On the complexity of algebraic numbers. II: Continued fractions
- On the complexity of algebraic numbers. I: Expansions in integer bases
- The \(\mathfrak p\)-adic Thue-Siegel-Roth-Schmidt theorem
- Linear forms in the logarithms of algebraic numbers
- Rational approximations to algebraic numbers
- Reversals and palindromes in continued fractions
- Automaticity. I: Properties of a measure of descriptional complexity
- Transcendence of numbers with a low complexity expansion
- Transcendence measures and quantitative aspects of the Thue-Siegel-Roth-Schmidt method
- Title not available (Why is that?)
- Amount of nonconstructivity in deterministic finite automata
- Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms
- Algorithms and Randomness
- Title not available (Why is that?)
- Title not available (Why is that?)
- How inductive inference strategies discover their errors
- Title not available (Why is that?)
- On the independence of expansions of algebraic numbers in an integer base
- Title not available (Why is that?)
Cited In (3)
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)
