Normality in non-integer bases and polynomial time randomness
From MaRDI portal
Publication:2353390
DOI10.1016/J.JCSS.2015.04.005zbMath1322.68112arXiv1410.8594OpenAlexW2962961113MaRDI QIDQ2353390
Javier Ignacio Almarza, Santiago Figueira
Publication date: 13 July 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.8594
normalitymartingalePisot numbersubshiftalgorithmic randomnessdeterministic finite automatonpolynomial time randomness
Formal languages and automata (68Q45) Generalizations of martingales (60G48) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Symbolic dynamics (37B10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- A polynomial-time algorithm for computing absolutely normal numbers
- A decomposition theorem for numbers in which the summands have prescribed normality properties
- The Hausdorff dimension of a set of normal numbers
- Computational complexity of real functions
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Feasible analysis, randomness, and base invariance
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Endliche Automaten und Zufallsfolgen
- On theβ-expansions of real numbers
- Randomness and differentiability
- Développement en base $\theta$, répartition modulo un de la suite $(x\theta \sp n)$, n$\ge 0$, langages codés et $\theta$-shift
- Endomorphisms of irreducible subshifts of finite type
- Markov Chains
- An Introduction to Symbolic Dynamics and Coding
- Intrinsic Markov Chains
This page was built for publication: Normality in non-integer bases and polynomial time randomness