Kenshi Miyabe

News
July 16, 2011, Accepted.
June 16, 2011, Resubmitted to a Journal
Mar 29, 2011, Submitted to a Journal

Title
The diifference between optimality and universality

(Former)Degree of non-randomness and uniform Solovay reducibility

Type
Fullpaper

Journal
Logic Journal of the IGPL (2012) 20 (1): 222-234.
abstract page

Abstract
We introduce a degree of non-randomness using a test concept.
The degree implies a notion of an optimal Martin-L\”of test, which is different from a universal test.
In the latter half we generalize Solovay reducibility.
Solovay reducibility is a measure of relative randomness between two reals.
We introduce uniform solovay reducibility, which is a measure of relative randomness between two sequences of reals.
Finally we prove that a sequence is uniform Solovay complete iff it is the sequence of measures of an optimal Martin-L\”of test.

The content of the paper will be merged into Algorithmic randomness over general spaces.

News
June 13, 2011, Rejected
Sep 21, 2010, Submitted to a Journal

Title
A computable topological space of measures

Type
Fullpaper

Journal
submitted

Download
Japanese summary

Abstract
We show that the space of bounded non-negative Borel measures on
a computable topological space is also a computable topological space
with A-topology. Then we dene computable measures which may not
be probabilistic and may be even innite. We also study randomness for
non-negative Borel measures which may not be probabilistic.