2012
DOI: 10.1007/978-3-642-30870-3_17
|View full text |Cite
|
Sign up to set email alerts
|

Randomness, Computation and Mathematics

Abstract: Abstract. This article examines some of the recent advances in our understanding of algorithmic randomness. It also discusses connections with various areas of mathematics, computer science and other areas of science. Some questions and speculations will be discussed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 66 publications
(63 reference statements)
0
1
0
Order By: Relevance
“…The study of the power of strategies in (ii) is quite interesting from the point of view of stochastic processes, as it relates to key concepts such as martingale decompositions, variation and various forms of boundedness or integrability. Questions (1) and ( 2) under (ii) are also directly relevant to a question about the separation of two randomness notions in algorithmic information theory, asked by Kastermans (see [Downey, 2012] and [Downey and Hirschfeldt, 2010, §7.9]). As we point out in §5, a positive answer of (1) or (2) for the case of strategies under (ii) would give a very simple and elegant positive answer to Kasterman's question.…”
Section: Introductionmentioning
confidence: 99%
“…The study of the power of strategies in (ii) is quite interesting from the point of view of stochastic processes, as it relates to key concepts such as martingale decompositions, variation and various forms of boundedness or integrability. Questions (1) and ( 2) under (ii) are also directly relevant to a question about the separation of two randomness notions in algorithmic information theory, asked by Kastermans (see [Downey, 2012] and [Downey and Hirschfeldt, 2010, §7.9]). As we point out in §5, a positive answer of (1) or (2) for the case of strategies under (ii) would give a very simple and elegant positive answer to Kasterman's question.…”
Section: Introductionmentioning
confidence: 99%