Sub-computable Bounded Pseudorandomness
From MaRDI portal
Publication:3455839
DOI10.1007/978-3-642-35722-0_8zbMath1437.03135OpenAlexW2222689550MaRDI QIDQ3455839
Douglas Cenzer, Jeffery B. Remmel
Publication date: 11 December 2015
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35722-0_8
Cites Work
- Unnamed Item
- Algorithmic randomness of continuous functions
- On the notion of infinite pseudorandom sequences
- Resource bounded randomness and computational complexity
- On Kurtz randomness
- Compressibility and Resource Bounded Measure
- Bounded Randomness
- Truth-table Schnorr randomness and truth-table reducible randomness
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Category and Measure in Complexity Classes
- On-Line Probability, Complexity and Randomness
- Measure on P: Robustness of the notion
- Reconciling Data Compression and Kolmogorov Complexity
- Algorithmic Randomness of Closed Sets
- On the Length of Programs for Computing Finite Binary Sequences
- Random Sets in Subrecursive Hierarchies
- A unified approach to the definition of random sequences
- The definition of random sequences
- On the concept of a random sequence