Bi-immunity over different size alphabets
From MaRDI portal
Publication:2243580
DOI10.1016/j.tcs.2021.09.005OpenAlexW3197076988MaRDI QIDQ2243580
Ludwig Staiger, Karen Frilya Celine, Sanjay Jain, Cristian S. Calude, Frank Stephan, Ziyuan Gao
Publication date: 11 November 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.005
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On normal numbers
- Immunity and hyperimmunity for sets of minimal indices
- Classical recursion theory. The theory of functions and sets of natural numbers
- How many squares can a string contain?
- Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
- The Kolmogorov complexity of real numbers.
- Liouville, computable, Borel normal and Martin-Löf random numbers
- A new quantum random number generator certified by value indefiniteness
- On the degrees of constructively immune sets
- Classical, quantum and biological randomness as relative unpredictability
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Diagonally Non-Computable Functions and Bi-Immunity
- A Stronger Square Conjecture on Binary Words
- On the Unpredictability of Individual Quantum Measurement Outcomes
- Effective Bi-immunity and Randomness
- Algorithmic Randomness and Complexity
- On a problem of Steinhaus about normal numbers
- Über die Normalität von Zahlen zu verschiedenen Basen
- A variant of the Kochen-Specker theorem localising value indefiniteness
- Every sequence is reducible to a random one
- Algorithmic Information Theory
- Schnorr randomness
- From Bi-Immunity to Absolute Undecidability
- A Machine-Independent Theory of the Complexity of Recursive Functions
- The definition of random sequences
- Upward Closure of bi‐Immune Degrees
- A Reducibility Arising from the Boone Groups.
- A quantum random number generator certified by value indefiniteness
- Recursively enumerable sets of positive integers and their decision problems
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Bi-immunity over different size alphabets
