Schnorr randomness versions of K, C, LR, vL-reducibilities

News
19 June 2014, the slide file was uploaded
13 June 2014, the talk was given

Title
Schnorr randomness versions of K, C, LR, vL-reducibilities

Type
Conference on Computability, Complexity and Randomness CCR 2014

Download
miyabe-ccr2014

Posted in Talks | Leave a comment

Mathematical formulation of “unpredictability” ~Non-use of probabilistic models~

News
13 May 2014, Abstract in Japanese was uploaded

Title
Mathematical formulation of “unpredictability” ~Non-use of probabilistic models~

Type
Seminar Talk
語ろう「数理解析」

Download

Posted in Talks | Leave a comment

Algorithmic randomness over general spaces

News
7 May 2014. Published online
Dec 2013. Accepted
May, 2012. Resubmit
Sep, 2011. Resubmitted a revised version
25 May, 2010. Submitted to a Journal

Title
Algorithmic randomness over general spaces

Type
Fullpaper

Journal
Math. Log. Quart. 60, No. 3, 184–204 (2014)
DOI 10.1002/malq.201200051

Download
preprint

Abstract
The study of Martin-Löf randomness on a computable metric space with a computable measure has had much progress recently.
In this paper we study Martin-Löf randomness on a more general space, that is, a computable topological space with a computable measure.
On such a space, Martin-Löf randomness may not be a natural notion because there is not a universal test, and Martin-Löf randomness and complexity randomness (defined in this paper) do not coincide in general. We show that SCT3 is a sufficient condition for the existence and the coincidence and study how much we can weaken the condition.

Posted in Papers | Leave a comment

Reducibilities relating to Schnorr randomness

News
24 Mar 2014. Submitted

Title
Reducibilities relating to Schnorr randomness

Type
Full paper

Journal
Submitted.

Abstract
Some measures of randomness have been introduced for Martin- L ̈of randomness such as K-reducibility, C-reducibility and vL-reducibility. In this paper we study Schnorr-randomness versions of these reducibilities. In particular, we characterize the computably-traceable reducibility via relative Schnorr randomness, which was asked in Nies’ book (Problem 8.4.22). We also show that Schnorr reducibility implies uniform-Schnorr-randomness version of vL-reducibility, which is the Schnorr-randomness version of the result that K-reducibility implies vL-reducibility.

Download
preprint

Posted in Papers | Leave a comment

Characterization of Lebesgue points for integral tests

News
6 Mar 2014, the slide file was uploaded

Title
Characterization of Lebesgue points for integral tests

Type
Mathematical Society of Japan

Download
Slide

Posted in Talks | Leave a comment

Philosophy of probability

This page is only in Japanese

Posted in Diary | Leave a comment

A Gap Phenomenon for Schnorr Randomness

News
20 Feb 2014, the slide file was uploaded

Title
A Gap Phenomenon for Schnorr Randomness

Type
CTFM

Download
miyabe-ctfm

Posted in Talks | Leave a comment

Algorithmic randomness by philosophers

This page is only in Japanese.

Posted in Diary | Leave a comment

Algorithmic information theory

This page is only in Japanese.

Posted in Diary | Leave a comment

Derandomization in Game-Theoretic Probability

News
12 Feb 2014. Submitted

Title
Derandomization in Game-Theoretic Probability
(with A. Takemura)

Type
Full paper

Journal
Submitted.

Abstract
We give a general method for constructing a deterministic strategy
of Reality from a randomized strategy in game-theoretic probability.
The construction can be seen as derandomization in game-theoretic probability.

Download
preprint

Posted in Papers | Leave a comment