Uniform test of algorithmic randomness over a general space (Q2566004): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q200200
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter Gács / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967782843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of metric spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Expressions for Some Randomness Tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relation between descriptional complexity and algorithmic probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conservation inequalities; information and independence in mathematical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A User's Guide to Measure Theoretic Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-based induction systems: Comparisons and convergence theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence of Probability Measures with Given Marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology and measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4272798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank

Latest revision as of 16:32, 10 June 2024

scientific article
Language Label Description Also known as
English
Uniform test of algorithmic randomness over a general space
scientific article

    Statements

    Uniform test of algorithmic randomness over a general space (English)
    0 references
    22 September 2005
    0 references
    Bernoulli distributions
    0 references
    Levin's theory
    0 references
    0 references

    Identifiers