default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenshi Miyabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j14]Masahiro Kumabe, Kenshi Miyabe, Yuki Mizusawa, Toshio Suzuki:
Solovay reducibility and continuity. J. Log. Anal. 12 (2020)- 2018
- [j13]Kenshi Miyabe, André Nies, Frank Stephan:
Randomness and Solovay degrees. J. Log. Anal. 10 (2018) - [j12]Kenshi Miyabe
:
Coherence of Reducibilities with Randomness Notions. Theory Comput. Syst. 62(7): 1599-1619 (2018) - 2016
- [j11]Kenshi Miyabe, André Nies, Jing Zhang:
Using Almost-everywhere theorems from Analysis to Study Randomness. Bull. Symb. Log. 22(3): 305-331 (2016) - [j10]Kenshi Miyabe:
Reducibilities Relating to Schnorr Randomness. Theory Comput. Syst. 58(3): 441-462 (2016) - 2015
- [j9]Takayuki Kihara, Kenshi Miyabe:
Unified characterizations of lowness properties via Kolmogorov complexity. Arch. Math. Log. 54(3-4): 329-358 (2015) - [j8]Kenshi Miyabe:
Schnorr Triviality and Its Equivalent Notions. Theory Comput. Syst. 56(3): 465-486 (2015) - 2014
- [j7]Takayuki Kihara, Kenshi Miyabe:
Uniform Kurtz randomness. J. Log. Comput. 24(4): 863-882 (2014) - [j6]Kenshi Miyabe:
Algorithmic randomness over general spaces. Math. Log. Q. 60(3): 184-204 (2014) - 2013
- [j5]Kenshi Miyabe:
L1-Computability, Layerwise Computability and Solovay Reducibility. Comput. 2(1): 15-29 (2013) - [j4]Kenshi Miyabe:
Characterization of Kurtz Randomness by a Differentiation Theorem. Theory Comput. Syst. 52(1): 113-132 (2013) - 2012
- [j3]Kenshi Miyabe:
The difference between optimality and universality. Log. J. IGPL 20(1): 222-234 (2012) - 2011
- [j2]Kenshi Miyabe:
Truth-table Schnorr randomness and truth-table reducible randomness. Math. Log. Q. 57(3): 323-338 (2011) - 2010
- [j1]Kenshi Miyabe:
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals. Notre Dame J. Formal Log. 51(3): 337-349 (2010)
Conference and Workshop Papers
- 2019
- [c3]Kenshi Miyabe:
Computable Prediction. AGI 2019: 137-147 - [c2]Kenshi Miyabe:
Uniform Relativization. CiE 2019: 50-61 - 2011
- [c1]Kenshi Miyabe:
An Optimal Superfarthingale and Its Convergence over a Computable Topological Space. Algorithmic Probability and Friends 2011: 273-284
Informal and Other Publications
- 2014
- [i1]Rodney G. Downey, Kenshi Miyabe, André Nies, Osamu Watanabe:
Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10). NII Shonan Meet. Rep. 2014 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
