Randomness, Computation and Mathematics (Q2904405)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Randomness, Computation and Mathematics	scientific article

Statements

scholarly article

0 references

Randomness, Computation and Mathematics (English)

0 references

Lecture Notes in Computer Science

0 references

publication date

14 August 2012

0 references

Rodney G. Downey

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-30870-3_17

0 references

Limits on the Computational Power of Random Strings

0 references

Power from Random Strings

0 references

What can be efficiently reduced to the Kolmogorov-random strings?

0 references

Effective Strong Dimension in Algorithmic Information and Computational Complexity

0 references

The metamathematics of ergodic theory

0 references

The importance of Π<sub>1</sub><sup>0</sup> classes in effective randomness

0 references

Turing’s Normal Numbers: Towards Randomness

0 references

From index sets to randomness in ∅<sup>n</sup>: random reals and possibly infinite computations part II

0 references

Kolmogorov Complexity and Solovay Functions

0 references

Reconciling Data Compression and Kolmogorov Complexity

0 references

Limit complexities revisited

0 references

Ergodic-Type Characterizations of Algorithmic Randomness

0 references

Randomness and differentiability

0 references

Non-computable Julia sets

0 references

0 references

A Theory of Program Size Formally Identical to Information Theory

0 references

Strong jump-traceability. I: The computably enumerable case

0 references

Increasing the gap between descriptional complexity and algorithmic probability

0 references

0 references

0 references

0 references

Algorithmic Randomness and Complexity

0 references

Calibrating Randomness

0 references

The descriptive complexity of Brownian motion

0 references

Dynamics of a generic Brownian motion: Recursive aspects

0 references

Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets

0 references

0 references

On the relation between descriptional complexity and algorithmic probability

0 references

Every sequence is reducible to a random one

0 references

Randomness on computable probability spaces -- a dynamical point of view

0 references

0 references

A characterization of the entropies of multidimensional shifts of finite type

0 references

Time-Bounded Kolmogorov Complexity and Solovay Functions

0 references

Kolmogorov Complexity with Error

0 references

Effective dimension of points visited by Brownian motion

0 references

Kolmogorov complexity and strong approximation of Brownian motion

0 references

0 references

Randomness and Recursive Enumerability

0 references

On the complexity of random strings

0 references

Lowness properties and randomness

0 references

0 references

0 references

Randomness, relativization and Turing degrees

0 references

The definition of random sequences

0 references

A Kolmogorov complexity characterization of constructive Hausdorff dimension.

0 references

Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension

0 references

Kolmogorov entropy in the context of computability theory

0 references

Mathematical metaphysics of randomness

0 references

Randomness and Computability: Open Questions

0 references

0 references

Effectively closed sets of measures and randomness

0 references

Effective randomness for continuous measures

0 references

A unified approach to the definition of random sequences

0 references

Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

0 references

Mass problems associated with effectively closed sets

0 references

Symbolic dynamics: entropy = dimension = complexity

0 references

0 references

On Computable Numbers, with an Application to the Entscheidungsproblem

0 references

Information Distance in Multiples

0 references

0 references

0 references

0 references

Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-30870-3_17

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2904405

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2904405&oldid=35293231"