Computability of probability measures and Martin-Löf randomness over metric spaces (Q2389335): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ic.2008.12.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101900964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4663947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of the Kolmogorov complexity in analyzing control system dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of metric spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of Euclidean space. I: Closed and compact subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational model for metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical representations of Brownian motion I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of a generic Brownian motion: Recursive aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform test of algorithmic randomness over a general space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective symbolic dynamics, random points, statistical behavior, complexity and entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective metric spaces and representations of the reals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random elements in effective topological spaces with measure. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity Properties of Dimension Level Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible Representations of Probability Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4272798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on computable metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on the probability measures on the Borel sets of the unit interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective properties of sets and functions in metric spaces with computability structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: What are SRB measures, and which dynamical systems have them? / 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 19:35, 1 July 2024

scientific article
Language Label Description Also known as
English
Computability of probability measures and Martin-Löf randomness over metric spaces
scientific article

    Statements

    Computability of probability measures and Martin-Löf randomness over metric spaces (English)
    0 references
    0 references
    0 references
    15 July 2009
    0 references
    0 references
    computability
    0 references
    computable metric space
    0 references
    computable probability measure
    0 references
    almost computable function
    0 references
    enumerative lattice
    0 references
    Kolmogorov-Chaitin complexity
    0 references
    algorithmic randomness
    0 references
    universal test
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references