An unpredictability approach to finite-state randomness (Q1117699): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Testing a simple symmetric hypothesis by a finite-memory deterministic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3264538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a paper of Niven and Zuckerman / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite-memory deterministic algorithm for the symmetric hypothesis testing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on normal numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-armed-bandit problem with time-invariant finite memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Example of Information and Computation Resource Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete degrees of finite-state transformability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite memory algorithms for testing bernoulli random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Kolmogorov concept of complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal \(k\)-tuples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Structure of the Faces of the<i>n</i>-Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition of normal numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of finite-state transformability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of functions on the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing simple hypotheses in finite time with Hellman-Cover automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to the definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory classification of Bernoulli sequences using reference samples (Corresp.) / rank
 
Normal rank

Latest revision as of 14:38, 19 June 2024

scientific article
Language Label Description Also known as
English
An unpredictability approach to finite-state randomness
scientific article

    Statements

    An unpredictability approach to finite-state randomness (English)
    0 references
    0 references
    1988
    0 references
    0 references
    normal sequence
    0 references
    randomness
    0 references
    finite-state automata
    0 references
    predicting machine
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references