An unpredictability approach to finite-state randomness
type: Item
instance of: scholarly article
title: An unpredictability approach to finite-state randomness
zbMATH Open document ID: 0667.68064
DOI: 10.1016/0022-0000(88)90011-6
author: Mary G. O'Connor
published in: Journal of Computer and System Sciences
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 11K16
zbMATH DE Number: 4092779
zbMATH Keywords: normal sequence
zbMATH Keywords: randomness
zbMATH Keywords: finite-state automata
zbMATH Keywords: predicting machine
MaRDI profile type: Publication
full work available at URL: 0022-0000(88)90011-6
OpenAlex ID: W2041202072
cites work: Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Q5549816
cites work: Q3264538
cites work: On a paper of Niven and Zuckerman
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: A finite-memory deterministic algorithm for the symmetric hypothesis testing problem
cites work: Note on normal numbers
cites work: The two-armed-bandit problem with time-invariant finite memory
cites work: An Example of Information and Computation Resource Trade-Off
cites work: Q3729902
cites work: Complete degrees of finite-state transformability
cites work: Finite memory algorithms for testing bernoulli random variables
cites work: Q3862379
cites work: Q3214803
cites work: Q3935355
cites work: A variant of the Kolmogorov concept of complexity
cites work: The definition of random sequences
cites work: Normal \(k\)-tuples
cites work: Combinatorial Structure of the Faces of then-Cube
cites work: On the definition of normal numbers
cites work: Degrees of finite-state transformability
cites work: Q5573961
cites work: Approximation of functions on the integers
cites work: Q5588675
cites work: On testing simple hypotheses in finite time with Hellman-Cover automata
cites work: A unified approach to the definition of random sequences
cites work: Finite-memory classification of Bernoulli sequences using reference samples (Corresp.)
description: scientific article; zbMATH DE number 4092779