News
9 July, 2024: The slide file was uploaded
Title
Algorithmic randomness theory and learnability
Type
Talk on SMAL 2024
In Japanese
宮部賢志(ミヤベケンシ)
News
7 Nov 2023, submitted to a journal
Title
Solovay reducibility via Lipschitz functions and signed-digit representation
Masahiro Kumabe, Kenshi Miyabe, and Toshio Suzuki
Type
Submitted to a journal
Publication
TBA
Abstract
We explore Solovay reducibility in the context of computably approximable reals, extending its natural characterization for left-c.e. reals via computable Lipschitz functions. Our paper offers two distinct characterizations: the first employs Lipschitz functions, while the second utilizes Turing reductions with bounded use with respect to signed-digit representation. Additionally, we examine multiple related reducibilities and establish separations among them. These results contribute to a refined perspective of the relationship between Solovay reducibility and computable Lipschitz functions.
download
preprint (23 May, 2024)
News
12 Dec, 2023: The slide was uploaded
Title
Strong Solovay reducibility
Type
Talk on Proof theory workshop@RIMS
Download
rims
News
6 Nov, 2023: The slide was uploaded
Title
Computable prediction
Type
Talk on Mini-Workshop on Computability in Tokyo in English
Download
mini-workshop