Cenzer, Douglas; Porter, Christopher P. Randomness extraction in computability theory. (English) Zbl 1515.03190 Computability 12, No. 1, 1-21 (2023). Reviewer: Ludwig Staiger (Halle) MSC: 03D32 03D10 68Q30 PDFBibTeX XMLCite \textit{D. Cenzer} and \textit{C. P. Porter}, Computability 12, No. 1, 1--21 (2023; Zbl 1515.03190) Full Text: DOI arXiv
Nies, André; Stephan, Frank Randomness and initial segment complexity for measures. (English) Zbl 1518.68147 Theor. Comput. Sci. 900, 1-19 (2022). Reviewer: Liang Yu (Nanjing) MSC: 68Q30 03D32 PDFBibTeX XMLCite \textit{A. Nies} and \textit{F. Stephan}, Theor. Comput. Sci. 900, 1--19 (2022; Zbl 1518.68147) Full Text: DOI arXiv
Zaffora Blando, Francesca A learning-theoretic characterisation of Martin-Löf randomness and Schnorr randomness. (English) Zbl 07819574 Rev. Symb. Log. 14, No. 2, 531-549 (2021). MSC: 68Q30 03D32 68Q32 PDFBibTeX XMLCite \textit{F. Zaffora Blando}, Rev. Symb. Log. 14, No. 2, 531--549 (2021; Zbl 07819574) Full Text: DOI
Hoyrup, Mathieu; Rute, Jason Computable measure theory and algorithmic randomness. (English) Zbl 07464645 Brattka, Vasco (ed.) et al., Handbook of computability and complexity in analysis. Cham: Springer. Theory Appl. Comput., 227-270 (2021). MSC: 03D78 PDFBibTeX XMLCite \textit{M. Hoyrup} and \textit{J. Rute}, in: Handbook of computability and complexity in analysis. Cham: Springer. 227--270 (2021; Zbl 07464645) Full Text: DOI HAL
McCarthy, Ethan Pointwise complexity of the derivative of a computable function. (English) Zbl 07417494 Arch. Math. Logic 60, No. 7-8, 981-994 (2021). MSC: 03D30 PDFBibTeX XMLCite \textit{E. McCarthy}, Arch. Math. Logic 60, No. 7--8, 981--994 (2021; Zbl 07417494) Full Text: DOI
Liu, Lu A computable analysis of majorizing martingales. (English) Zbl 07381907 Bull. Lond. Math. Soc. 53, No. 3, 759-776 (2021). MSC: 03D80 68Q30 03D32 PDFBibTeX XMLCite \textit{L. Liu}, Bull. Lond. Math. Soc. 53, No. 3, 759--776 (2021; Zbl 07381907) Full Text: DOI arXiv
Kumabe, Masahiro; Miyabe, Kenshi; Mizusawa, Yuki; Suzuki, Toshio Solovay reducibility and continuity. (English) Zbl 1472.03041 J. Log. Anal. 12, Paper No. 2, 22 p. (2020). Reviewer: Liang Yu (Nanjing) MSC: 03D78 03D32 68Q30 PDFBibTeX XMLCite \textit{M. Kumabe} et al., J. Log. Anal. 12, Paper No. 2, 22 p. (2020; Zbl 1472.03041) Full Text: DOI arXiv
Hölzl, Rupert; Merkle, Wolfgang; Miller, Joseph; Stephan, Frank; Yu, Liang Chaitin’s \(\Omega\) as a continuous function. (English) Zbl 1471.03068 J. Symb. Log. 85, No. 1, 486-510 (2020). Reviewer: Roman Murawski (Poznań) MSC: 03D32 68Q30 03D78 PDFBibTeX XMLCite \textit{R. Hölzl} et al., J. Symb. Log. 85, No. 1, 486--510 (2020; Zbl 1471.03068) Full Text: DOI
Nies, André; Shafer, Paul Randomness notions and reverse mathematics. (English) Zbl 1444.03013 J. Symb. Log. 85, No. 1, 271-299 (2020). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D32 03F35 68Q30 PDFBibTeX XMLCite \textit{A. Nies} and \textit{P. Shafer}, J. Symb. Log. 85, No. 1, 271--299 (2020; Zbl 1444.03013) Full Text: DOI arXiv Link
Bauwens, Bruno Uniform van Lambalgen’s theorem fails for computable randomness. (English) Zbl 1441.68110 Inf. Comput. 271, Article ID 104486, 3 p. (2020). Reviewer: Vladik Ya. Kreinovich (El Paso) MSC: 68Q30 03D32 60G48 PDFBibTeX XMLCite \textit{B. Bauwens}, Inf. Comput. 271, Article ID 104486, 3 p. (2020; Zbl 1441.68110) Full Text: DOI arXiv
Kihara, Takayuki On a metric generalization of the \(tt\)-degrees and effective dimension theory. (English) Zbl 1455.03055 J. Symb. Log. 84, No. 2, 726-749 (2019). Reviewer: Jordan Mitchell Barrett (Wellington) MSC: 03D30 03C62 03D78 54H05 PDFBibTeX XMLCite \textit{T. Kihara}, J. Symb. Log. 84, No. 2, 726--749 (2019; Zbl 1455.03055) Full Text: DOI arXiv
Franklin, Johanna N. Y.; McNicholl, Timothy H.; Rute, Jason Algorithmic randomness and Fourier analysis. (English) Zbl 1454.03054 Theory Comput. Syst. 63, No. 3, 567-586 (2019). MSC: 03D32 03D78 42B10 PDFBibTeX XMLCite \textit{J. N. Y. Franklin} et al., Theory Comput. Syst. 63, No. 3, 567--586 (2019; Zbl 1454.03054) Full Text: DOI arXiv
Mayordomo, Elvira Effective Hausdorff dimension in general metric spaces. (English) Zbl 1436.03232 Theory Comput. Syst. 62, No. 7, 1620-1636 (2018). MSC: 03D45 03D32 28A78 68Q30 PDFBibTeX XMLCite \textit{E. Mayordomo}, Theory Comput. Syst. 62, No. 7, 1620--1636 (2018; Zbl 1436.03232) Full Text: DOI arXiv Link
Miyabe, Kenshi Coherence of reducibilities with randomness notions. (English) Zbl 1436.03228 Theory Comput. Syst. 62, No. 7, 1599-1619 (2018). MSC: 03D32 03D30 PDFBibTeX XMLCite \textit{K. Miyabe}, Theory Comput. Syst. 62, No. 7, 1599--1619 (2018; Zbl 1436.03228) Full Text: DOI
Pauly, Arno; Fouché, Willem; Davie, George Weihrauch-completeness for layerwise computability. (English) Zbl 1459.03069 Log. Methods Comput. Sci. 14, No. 2, Paper No. 11, 15 p. (2018). MSC: 03D78 03D32 03F60 PDFBibTeX XMLCite \textit{A. Pauly} et al., Log. Methods Comput. Sci. 14, No. 2, Paper No. 11, 15 p. (2018; Zbl 1459.03069) Full Text: DOI arXiv
Rute, Jason Schnorr randomness for noncomputable measures. (English) Zbl 1453.03044 Inf. Comput. 258, 50-78 (2018). MSC: 03D32 03D78 68Q30 PDFBibTeX XMLCite \textit{J. Rute}, Inf. Comput. 258, 50--78 (2018; Zbl 1453.03044) Full Text: DOI arXiv
Kuyper, Rutger; Miller, Joseph S. Nullifying randomness and genericity using symmetric difference. (English) Zbl 1422.03090 Ann. Pure Appl. Logic 168, No. 9, 1692-1699 (2017). MSC: 03D32 68Q30 03D28 PDFBibTeX XMLCite \textit{R. Kuyper} and \textit{J. S. Miller}, Ann. Pure Appl. Logic 168, No. 9, 1692--1699 (2017; Zbl 1422.03090) Full Text: DOI
Nies, André Lowness, randomness, and computable analysis. (English) Zbl 1485.03166 Day, Adam (ed.) et al., Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 10010, 738-754 (2017). MSC: 03D32 03D78 PDFBibTeX XMLCite \textit{A. Nies}, Lect. Notes Comput. Sci. 10010, 738--754 (2017; Zbl 1485.03166) Full Text: DOI arXiv
Weihrauch, Klaus Computability on measurable functions. (English) Zbl 1420.03115 Computability 6, No. 1, 79-104 (2017). MSC: 03D78 28A05 28C15 PDFBibTeX XMLCite \textit{K. Weihrauch}, Computability 6, No. 1, 79--104 (2017; Zbl 1420.03115) Full Text: DOI
Porter, Christopher P. On analogues of the Church-Turing thesis in algorithmic randomness. (English) Zbl 1393.03023 Rev. Symb. Log. 9, No. 3, 456-479 (2016). MSC: 03D32 03D78 03A05 PDFBibTeX XMLCite \textit{C. P. Porter}, Rev. Symb. Log. 9, No. 3, 456--479 (2016; Zbl 1393.03023) Full Text: DOI
Miyabe, Kenshi; Nies, André; Zhang, Jing Using almost-everywhere theorems from analysis to study randomness. (English) Zbl 1401.03079 Bull. Symb. Log. 22, No. 3, 305-331 (2016). MSC: 03D32 03D80 37A25 37A30 60G44 PDFBibTeX XMLCite \textit{K. Miyabe} et al., Bull. Symb. Log. 22, No. 3, 305--331 (2016; Zbl 1401.03079) Full Text: DOI arXiv
Rute, Jason Computable randomness and betting for computable probability spaces. (English) Zbl 1364.03064 Math. Log. Q. 62, No. 4-5, 335-366 (2016). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 03D32 68Q30 60A99 PDFBibTeX XMLCite \textit{J. Rute}, Math. Log. Q. 62, No. 4--5, 335--366 (2016; Zbl 1364.03064) Full Text: DOI arXiv
Carotenuto, Gemma; Nies, André Lightface \(\varPi ^0_3\)-completeness of density sets under effective Wadge reducibility. (English) Zbl 1476.03054 Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 234-239 (2016). MSC: 03D15 03E15 PDFBibTeX XMLCite \textit{G. Carotenuto} and \textit{A. Nies}, Lect. Notes Comput. Sci. 9709, 234--239 (2016; Zbl 1476.03054) Full Text: DOI
Galicki, Aleksander; Nies, André A computational approach to the Borwein-Ditor theorem. (English) Zbl 1476.03057 Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 99-104 (2016). MSC: 03D32 PDFBibTeX XMLCite \textit{A. Galicki} and \textit{A. Nies}, Lect. Notes Comput. Sci. 9709, 99--104 (2016; Zbl 1476.03057) Full Text: DOI
Rute, Jason When does randomness come from randomness? (English) Zbl 1339.68127 Theor. Comput. Sci. 635, 35-50 (2016). MSC: 68Q30 03D32 PDFBibTeX XMLCite \textit{J. Rute}, Theor. Comput. Sci. 635, 35--50 (2016; Zbl 1339.68127) Full Text: DOI arXiv
Miyabe, Kenshi Schnorr triviality and its equivalent notions. (English) Zbl 1336.03048 Theory Comput. Syst. 56, No. 3, 465-486 (2015). MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{K. Miyabe}, Theory Comput. Syst. 56, No. 3, 465--486 (2015; Zbl 1336.03048) Full Text: DOI
Hölzl, Rupert; Shafer, Paul Universality, optimality, and randomness deficiency. (English) Zbl 1386.03047 Ann. Pure Appl. Logic 166, No. 10, 1049-1069 (2015). MSC: 03D32 68Q30 03D30 PDFBibTeX XMLCite \textit{R. Hölzl} and \textit{P. Shafer}, Ann. Pure Appl. Logic 166, No. 10, 1049--1069 (2015; Zbl 1386.03047) Full Text: DOI arXiv
Kihara, Takayuki; Miyabe, Kenshi Unified characterizations of lowness properties via Kolmogorov complexity. (English) Zbl 1338.03083 Arch. Math. Logic 54, No. 3-4, 329-358 (2015). MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{T. Kihara} and \textit{K. Miyabe}, Arch. Math. Logic 54, No. 3--4, 329--358 (2015; Zbl 1338.03083) Full Text: DOI
Kihara, Takayuki Decomposing Borel functions using the Shore-Slaman join theorem. (English) Zbl 1368.03045 Fundam. Math. 230, No. 1, 1-13 (2015). Reviewer: Longyun Ding (Tianjin) MSC: 03E15 03D28 54H05 PDFBibTeX XMLCite \textit{T. Kihara}, Fundam. Math. 230, No. 1, 1--13 (2015; Zbl 1368.03045) Full Text: DOI arXiv
Bienvenu, Laurent; Downey, Rod; Greenberg, Noam; Nies, André; Turetsky, Dan Characterizing lowness for Demuth randomness. (English) Zbl 1338.03080 J. Symb. Log. 79, No. 2, 526-560 (2014). MSC: 03D32 03D25 68Q30 PDFBibTeX XMLCite \textit{L. Bienvenu} et al., J. Symb. Log. 79, No. 2, 526--560 (2014; Zbl 1338.03080) Full Text: DOI
Higuchi, Kojiro; Kihara, Takayuki On effectively closed sets of effective strong measure zero. (English) Zbl 1351.03033 Ann. Pure Appl. Logic 165, No. 9, 1445-1469 (2014). MSC: 03D32 03D30 03D80 03E15 PDFBibTeX XMLCite \textit{K. Higuchi} and \textit{T. Kihara}, Ann. Pure Appl. Logic 165, No. 9, 1445--1469 (2014; Zbl 1351.03033) Full Text: DOI
Cenzer, Douglas; Remmel, Jeffrey B. Sub-computable bounded pseudorandomness. (English) Zbl 1437.03135 Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 7734, 104-118 (2013). MSC: 03D32 PDFBibTeX XMLCite \textit{D. Cenzer} and \textit{J. B. Remmel}, Lect. Notes Comput. Sci. 7734, 104--118 (2013; Zbl 1437.03135) Full Text: DOI
Bienvenu, Laurent; Day, Adam R.; Hoyrup, Mathieu; Mezhirov, Ilya; Shen, Alexander A constructive version of Birkhoff’s ergodic theorem for Martin-Löf random points. (English) Zbl 1257.03067 Inf. Comput. 210, 21-30 (2012). Reviewer: Cristian S. Calude (Auckland) MSC: 03D32 28D05 37A30 68Q30 PDFBibTeX XMLCite \textit{L. Bienvenu} et al., Inf. Comput. 210, 21--30 (2012; Zbl 1257.03067) Full Text: DOI arXiv HAL
Yu, Liang Characterizing strong randomness via Martin-Löf randomness. (English) Zbl 1251.03048 Ann. Pure Appl. Logic 163, No. 3, 214-224 (2012). Reviewer: Cristian S. Calude (Auckland) MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{L. Yu}, Ann. Pure Appl. Logic 163, No. 3, 214--224 (2012; Zbl 1251.03048) Full Text: DOI