• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Algorithmic Randomness for Some Measures on Infinite 0-1-sequences

Student: Iakusheva Olga

Supervisor: Nikolay Vereshchagin

Faculty: Faculty of Mathematics

Educational Programme: Mathematics (Bachelor)

Year of Graduation: 2017

We find it quite interesting to study algorithmic randomness of different measures. Of an especial interest is the difference between the algorithmic randomness of various measures which have visual interpretation, such as tossing a coin or taking a ball out of an urn. The aim of our research is to study the algorithmic randomness for the Polya urn, namely, to find out which 0-1-sequences taken out of the Polya urn are random.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses