Hartmanis-Stearns conjecture on real time and transcendence

Authors:
Rūsiņ$#353; Freivalds
Affiliations:
Institute of Mathematics and Computer Science, University of Latvia, Riga, Latvia
Venue:
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Year:
2012

Citing 9
Cited 0

Why sometimes probabilistic algorithms can be more effective

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Minimal nontrivial space complexity of probabilistic one-way turing machines

MFCS '90 Proceedings on Mathematical foundations of computer science 1990
How inductive inference strategies discover their errors

Information and Computation
Automaticity I: properties of a measure of descriptional complexity

Journal of Computer and System Sciences
Automata, Languages, and Machines

Automata, Languages, and Machines
An example of a computable absolutely normal number

Theoretical Computer Science
Effects of Kolmogorov Complexity Present in Inductive Inference as Well

ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Reversals and palindromes in continued fractions

Theoretical Computer Science
Amount of nonconstructivity in deterministic finite automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hartmanis-Stearns conjecture asserts that any number whose decimal expansion can be computed by a multitape Turing machine is either rational or transcendental. After half a century of active research by computer scientists and mathematicians the problem is still open but much more interesting than in 1965.