Brandouy, Olivier; Delahaye, Jean-Paul; Ma, Lin Estimating the algorithmic complexity of stock markets. (English) Zbl 1396.91820 Algorithm. Finance 4, No. 3-4, 159-178 (2015). MSC: 91G99 68Q25 PDFBibTeX XMLCite \textit{O. Brandouy} et al., Algorithm. Finance 4, No. 3--4, 159--178 (2015; Zbl 1396.91820) Full Text: DOI arXiv
Alikhani, Malihe; Kjos-Hanssen, Bjørn; Pakravan, Amirarsalan; Saadat, Babak Pricing complexity options. (English) Zbl 1395.91428 Algorithm. Finance 4, No. 3-4, 127-137 (2015). MSC: 91G20 68Q25 60G40 91G60 PDFBibTeX XMLCite \textit{M. Alikhani} et al., Algorithm. Finance 4, No. 3--4, 127--137 (2015; Zbl 1395.91428) Full Text: DOI arXiv
Samorodnitsky, Alex; Shkredov, Ilya; Yekhanin, Sergey Kolmogorov width of discrete linear spaces: an approach to matrix rigidity. (English) Zbl 1388.68135 Zuckerman, David (ed.), 30th conference on computational complexity, CCC’15, Portland, OR, USA, June 17–19, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-81-1). LIPIcs – Leibniz International Proceedings in Informatics 33, 347-364 (2015). MSC: 68Q25 05B20 05B40 94B05 PDFBibTeX XMLCite \textit{A. Samorodnitsky} et al., LIPIcs -- Leibniz Int. Proc. Inform. 33, 347--364 (2015; Zbl 1388.68135) Full Text: DOI
Kreinovich, Vladik; Kosheleva, Olga Among several successful algorithms, simpler ones usually work better: a possible explanation of an empirical observation. (English) Zbl 1374.68718 Mat. Strukt. Model. 33, 50-55 (2015). MSC: 68W01 68Q25 68Q30 PDFBibTeX XMLCite \textit{V. Kreinovich} and \textit{O. Kosheleva}, Mat. Strukt. Model. 33, 50--55 (2015; Zbl 1374.68718) Full Text: Link
Hoyrup, Mathieu; Rojas, Cristóbal On the information carried by programs about the objects they compute. (English) Zbl 1355.68133 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 447-459 (2015). MSC: 68Q30 68Q05 PDFBibTeX XMLCite \textit{M. Hoyrup} and \textit{C. Rojas}, LIPIcs -- Leibniz Int. Proc. Inform. 30, 447--459 (2015; Zbl 1355.68133) Full Text: DOI arXiv
Brattka, Vasco; Gherardi, Guido; Hölzl, Rupert Las Vegas computability and algorithmic randomness. (English) Zbl 1355.68132 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 130-142 (2015). MSC: 68Q30 03D32 91A10 PDFBibTeX XMLCite \textit{V. Brattka} et al., LIPIcs -- Leibniz Int. Proc. Inform. 30, 130--142 (2015; Zbl 1355.68132) Full Text: DOI
Allender, Eric; Holden, Dhiraj; Kabanets, Valentine The minimum oracle circuit size problem. (English) Zbl 1355.68104 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 21-33 (2015). MSC: 68Q17 68Q30 PDFBibTeX XMLCite \textit{E. Allender} et al., LIPIcs -- Leibniz Int. Proc. Inform. 30, 21--33 (2015; Zbl 1355.68104) Full Text: DOI
Bloem, Peter; de Rooij, Steven; Adriaans, Pieter Two problems for sophistication. (English) Zbl 1471.68096 Chaudhuri, Kamalika (ed.) et al., Algorithmic learning theory. 26th international conference, ALT 2015, Banff, AB, Canada, October 4–6, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9355, 379-394 (2015). MSC: 68Q30 PDFBibTeX XMLCite \textit{P. Bloem} et al., Lect. Notes Comput. Sci. 9355, 379--394 (2015; Zbl 1471.68096) Full Text: DOI
Leike, Jan; Hutter, Marcus On the computability of Solomonoff induction and knowledge-seeking. (English) Zbl 1388.68252 Chaudhuri, Kamalika (ed.) et al., Algorithmic learning theory. 26th international conference, ALT 2015, Banff, AB, Canada, October 4–6, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-24485-3/pbk; 978-3-319-24486-0/ebook). Lecture Notes in Computer Science 9355. Lecture Notes in Artificial Intelligence, 364-378 (2015). MSC: 68T05 03D15 68Q30 PDFBibTeX XMLCite \textit{J. Leike} and \textit{M. Hutter}, Lect. Notes Comput. Sci. 9355, 364--378 (2015; Zbl 1388.68252) Full Text: DOI arXiv
Leike, Jan; Hutter, Marcus Solomonoff induction violates Nicod’s criterion. (English) Zbl 1388.68142 Chaudhuri, Kamalika (ed.) et al., Algorithmic learning theory. 26th international conference, ALT 2015, Banff, AB, Canada, October 4–6, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-24485-3/pbk; 978-3-319-24486-0/ebook). Lecture Notes in Computer Science 9355. Lecture Notes in Artificial Intelligence, 349-363 (2015). MSC: 68Q30 03B48 PDFBibTeX XMLCite \textit{J. Leike} and \textit{M. Hutter}, Lect. Notes Comput. Sci. 9355, 349--363 (2015; Zbl 1388.68142) Full Text: DOI arXiv
Case, Adam; Lutz, Jack H. Mutual dimension. (English) Zbl 1348.03041 ACM Trans. Comput. Theory 7, No. 3, Article No. 12, 26 p. (2015). MSC: 03D78 03D32 68Q30 PDFBibTeX XMLCite \textit{A. Case} and \textit{J. H. Lutz}, ACM Trans. Comput. Theory 7, No. 3, Article No. 12, 26 p. (2015; Zbl 1348.03041) Full Text: DOI arXiv
Teutsch, Jason; Zimand, Marius On approximate decidability of minimal programs. (English) Zbl 1347.68096 ACM Trans. Comput. Theory 7, No. 4, Article No. 17, 16 p. (2015). MSC: 68N30 03D20 68Q30 PDFBibTeX XMLCite \textit{J. Teutsch} and \textit{M. Zimand}, ACM Trans. Comput. Theory 7, No. 4, Article No. 17, 16 p. (2015; Zbl 1347.68096) Full Text: DOI arXiv
Fouché, Willem L. Kolmogorov complexity and the geometry of Brownian motion. (English) Zbl 1361.68110 Math. Struct. Comput. Sci. 25, No. 7, 1590-1606 (2015). MSC: 68Q30 03D32 60J65 PDFBibTeX XMLCite \textit{W. L. Fouché}, Math. Struct. Comput. Sci. 25, No. 7, 1590--1606 (2015; Zbl 1361.68110) Full Text: DOI arXiv
Vereshchagin, Nikolay; Shen, Alexander Algorithmic statistics revisited. (English) Zbl 1336.62036 Vovk, Vladimir (ed.) et al., Measures of complexity. Festschrift for Alexey Chervonenkis. Cham: Springer (ISBN 978-3-319-21851-9/hbk; 978-3-319-21852-6/ebook). 235-252 (2015). MSC: 62A01 68Q30 62B10 PDFBibTeX XMLCite \textit{N. Vereshchagin} and \textit{A. Shen}, in: Measures of complexity. Festschrift for Alexey Chervonenkis. Cham: Springer. 235--252 (2015; Zbl 1336.62036) Full Text: DOI arXiv
Kalnishkan, Yuri Predictive complexity for games with finite outcome spaces. (English) Zbl 1357.68091 Vovk, Vladimir (ed.) et al., Measures of complexity. Festschrift for Alexey Chervonenkis. Cham: Springer (ISBN 978-3-319-21851-9/hbk; 978-3-319-21852-6/ebook). 117-139 (2015). MSC: 68Q30 68Q32 91A26 PDFBibTeX XMLCite \textit{Y. Kalnishkan}, in: Measures of complexity. Festschrift for Alexey Chervonenkis. Cham: Springer. 117--139 (2015; Zbl 1357.68091) Full Text: DOI
Shen, Alexander Around Kolmogorov complexity: basic notions and results. (English) Zbl 1338.68130 Vovk, Vladimir (ed.) et al., Measures of complexity. Festschrift for Alexey Chervonenkis. Cham: Springer (ISBN 978-3-319-21851-9/hbk; 978-3-319-21852-6/ebook). 75-115 (2015). Reviewer: Liang Yu (Nanjing) MSC: 68Q30 PDFBibTeX XMLCite \textit{A. Shen}, in: Measures of complexity. Festschrift for Alexey Chervonenkis. Cham: Springer. 75--115 (2015; Zbl 1338.68130) Full Text: DOI arXiv
Kutrib, Martin; Provillard, Julien; Vaszil, György; Wendlandt, Matthias Deterministic one-way Turing machines with sublinear space. (English) Zbl 1339.68082 Fundam. Inform. 136, No. 1-2, 139-155 (2015). Reviewer: Andreas Wichert (Porto Salvo) MSC: 68Q05 68Q15 68Q30 PDFBibTeX XMLCite \textit{M. Kutrib} et al., Fundam. Inform. 136, No. 1--2, 139--155 (2015; Zbl 1339.68082) Full Text: DOI
Clark, Gregory; Teutsch, Jason Maximizing T-complexity. (English) Zbl 1334.68108 Fundam. Inform. 139, No. 1, 1-19 (2015). MSC: 68Q30 PDFBibTeX XMLCite \textit{G. Clark} and \textit{J. Teutsch}, Fundam. Inform. 139, No. 1, 1--19 (2015; Zbl 1334.68108) Full Text: DOI
Yeung, Raymond W. Facets of entropy. (English) Zbl 1403.94038 Commun. Inf. Syst. 15, No. 1, 87-117 (2015). MSC: 94A17 PDFBibTeX XMLCite \textit{R. W. Yeung}, Commun. Inf. Syst. 15, No. 1, 87--117 (2015; Zbl 1403.94038) Full Text: DOI
Chong, C. T.; Yu, Liang Randomness in the higher setting. (English) Zbl 1386.03046 J. Symb. Log. 80, No. 4, 1131-1148 (2015). MSC: 03D32 03D30 68Q30 PDFBibTeX XMLCite \textit{C. T. Chong} and \textit{L. Yu}, J. Symb. Log. 80, No. 4, 1131--1148 (2015; Zbl 1386.03046) Full Text: DOI Link
Culver, Quinn; Porter, Christopher P. The interplay of classes of algorithmically random objects. (English) Zbl 1452.03095 J. Log. Anal. 7, Paper No. 7, 25 p. (2015). MSC: 03D32 03D80 68Q30 PDFBibTeX XMLCite \textit{Q. Culver} and \textit{C. P. Porter}, J. Log. Anal. 7, Paper No. 7, 25 p. (2015; Zbl 1452.03095) Full Text: DOI arXiv
Kjos-Hanssen, Bjørn Kolmogorov structure functions for automatic complexity. (English) Zbl 1332.68097 Theor. Comput. Sci. 607, Part 3, 435-445 (2015). MSC: 68Q30 62B10 68Q45 PDFBibTeX XMLCite \textit{B. Kjos-Hanssen}, Theor. Comput. Sci. 607, Part 3, 435--445 (2015; Zbl 1332.68097) Full Text: DOI
Peretz, Ron Effective martingales with restricted wagers. (English) Zbl 1332.68098 Inf. Comput. 245, 152-164 (2015). MSC: 68Q30 60G48 PDFBibTeX XMLCite \textit{R. Peretz}, Inf. Comput. 245, 152--164 (2015; Zbl 1332.68098) Full Text: DOI arXiv
Bavly, Gilad; Peretz, Ron How to gamble against all odds. (English) Zbl 1347.91077 Games Econ. Behav. 94, 157-168 (2015). MSC: 91A60 60G42 68Q30 91A20 PDFBibTeX XMLCite \textit{G. Bavly} and \textit{R. Peretz}, Games Econ. Behav. 94, 157--168 (2015; Zbl 1347.91077) Full Text: DOI arXiv Link
Bonanno, Claudio A complexity approach to the soliton resolution conjecture. (English) Zbl 1327.35332 J. Stat. Phys. 160, No. 5, 1432-1448 (2015). MSC: 35Q51 68Q30 35Q55 PDFBibTeX XMLCite \textit{C. Bonanno}, J. Stat. Phys. 160, No. 5, 1432--1448 (2015; Zbl 1327.35332) Full Text: DOI arXiv
Bienvenu, Laurent; Desfontaines, Damien; Shen, Alexander What percentage of programs halt? (English) Zbl 1440.03057 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 219-230 (2015). MSC: 03D10 03D32 68Q17 68Q30 PDFBibTeX XMLCite \textit{L. Bienvenu} et al., Lect. Notes Comput. Sci. 9134, 219--230 (2015; Zbl 1440.03057) Full Text: DOI Link
Beigi, Salman; Etesami, Omid; Gohari, Amin Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources. (English) Zbl 1380.68182 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-47671-0/pbk; 978-3-662-47672-7/ebook). Lecture Notes in Computer Science 9134, 143-154 (2015). MSC: 68Q10 60C05 68Q30 68Q87 68W20 PDFBibTeX XMLCite \textit{S. Beigi} et al., Lect. Notes Comput. Sci. 9134, 143--154 (2015; Zbl 1380.68182) Full Text: DOI arXiv
Milovanov, Alexey Some properties of antistochastic strings. (English) Zbl 1378.68098 Beklemishev, Lev D. (ed.) et al., Computer science – theory and applications. 10th international computer science symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-20296-9/pbk; 978-3-319-20297-6/ebook). Lecture Notes in Computer Science 9139, 339-349 (2015). MSC: 68Q30 PDFBibTeX XMLCite \textit{A. Milovanov}, Lect. Notes Comput. Sci. 9139, 339--349 (2015; Zbl 1378.68098) Full Text: DOI arXiv
Lutz, Jack H.; Lutz, Neil Lines missing every random point. (English) Zbl 1333.03110 Computability 4, No. 2, 85-102 (2015). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 03D32 68Q30 28A75 PDFBibTeX XMLCite \textit{J. H. Lutz} and \textit{N. Lutz}, Computability 4, No. 2, 85--102 (2015; Zbl 1333.03110) Full Text: DOI
Schiefer, Nicholas; Winfree, Erik Universal computation and optimal construction in the chemical reaction network-controlled tile assembly model. (English) Zbl 1404.68047 Phillips, Andrew (ed.) et al., DNA computing and molecular programming. 21st international conference, DNA 21, Boston and Cambridge, MA, USA, August 17–21, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21998-1/pbk; 978-3-319-21999-8/ebook). Lecture Notes in Computer Science 9211, 34-54 (2015). MSC: 68Q05 68Q30 92E20 PDFBibTeX XMLCite \textit{N. Schiefer} and \textit{E. Winfree}, Lect. Notes Comput. Sci. 9211, 34--54 (2015; Zbl 1404.68047) Full Text: DOI
Moser, Philippe; Stephan, Frank Depth, highness and DNR degrees. (English) Zbl 1434.03109 Kosowski, Adrian (ed.) et al., Fundamentals of computation theory. 20th international symposium, FCT 2015, Gdańsk, Poland, August 17–19, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9210, 81-94 (2015). MSC: 03D32 03D15 68Q30 PDFBibTeX XMLCite \textit{P. Moser} and \textit{F. Stephan}, Lect. Notes Comput. Sci. 9210, 81--94 (2015; Zbl 1434.03109) Full Text: DOI Link
Calude, Cristian S.; Desfontaines, Damien Anytime algorithms for non-ending computations. (English) Zbl 1338.68127 Int. J. Found. Comput. Sci. 26, No. 4, 465-475 (2015). Reviewer: Marius Zimand (Towson) MSC: 68Q30 68Q05 PDFBibTeX XMLCite \textit{C. S. Calude} and \textit{D. Desfontaines}, Int. J. Found. Comput. Sci. 26, No. 4, 465--475 (2015; Zbl 1338.68127) Full Text: DOI
Vovk, Vladimir The fundamental nature of the log loss function. (English) Zbl 1465.68116 Beklemishev, Lev D. (ed.) et al., Fields of logic and computation II. Essays dedicated to Yuri Gurevich on the occasion of his 75th birthday. Cham: Springer. Lect. Notes Comput. Sci. 9300, 307-318 (2015). MSC: 68Q30 03D32 PDFBibTeX XMLCite \textit{V. Vovk}, Lect. Notes Comput. Sci. 9300, 307--318 (2015; Zbl 1465.68116) Full Text: DOI arXiv
Bienvenu, Laurent; Shen, Alexander \(K\)-trivial, \(K\)-low and MLR-low sequences: a tutorial. (English) Zbl 1466.68048 Beklemishev, Lev D. (ed.) et al., Fields of logic and computation II. Essays dedicated to Yuri Gurevich on the occasion of his 75th birthday. Cham: Springer. Lect. Notes Comput. Sci. 9300, 1-23 (2015). MSC: 68Q30 03D32 PDFBibTeX XMLCite \textit{L. Bienvenu} and \textit{A. Shen}, Lect. Notes Comput. Sci. 9300, 1--23 (2015; Zbl 1466.68048) Full Text: DOI arXiv
Case, Adam; Lutz, Jack H. Mutual dimension and random sequences. (English) Zbl 1465.68115 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9235, 199-210 (2015). MSC: 68Q30 PDFBibTeX XMLCite \textit{A. Case} and \textit{J. H. Lutz}, Lect. Notes Comput. Sci. 9235, 199--210 (2015; Zbl 1465.68115) Full Text: DOI arXiv
Lewis, John P. Realism and texture: benchmark problems for natural computation. (English) Zbl 1458.68271 Calude, S. (ed.) et al., Unconventional computation and natural computation. 14th international conference, UCNC 2015, Auckland, New Zealand, August 30 – September 3, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9252, 53-65 (2015). MSC: 68U10 68Q30 PDFBibTeX XMLCite \textit{J. P. Lewis}, Lect. Notes Comput. Sci. 9252, 53--65 (2015; Zbl 1458.68271) Full Text: DOI
Okamura, Kazuki Random sequences with respect to a measure defined by two linear fractional transformations. (English) Zbl 1326.03051 Theory Comput. Syst. 57, No. 1, 226-237 (2015). MSC: 03D32 28A12 68Q30 PDFBibTeX XMLCite \textit{K. Okamura}, Theory Comput. Syst. 57, No. 1, 226--237 (2015; Zbl 1326.03051) Full Text: DOI
Bauwens, Bruno Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. (English) Zbl 1362.03037 Arch. Math. Logic 54, No. 5-6, 615-629 (2015). Reviewer: Merlin Carl (Konstanz) MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{B. Bauwens}, Arch. Math. Logic 54, No. 5--6, 615--629 (2015; Zbl 1362.03037) Full Text: DOI arXiv
Bienvenu, Laurent; Downey, Rod; Nies, André; Merkle, Wolfgang Solovay functions and their applications in algorithmic randomness. (English) Zbl 1335.03038 J. Comput. Syst. Sci. 81, No. 8, 1575-1591 (2015). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{L. Bienvenu} et al., J. Comput. Syst. Sci. 81, No. 8, 1575--1591 (2015; Zbl 1335.03038) Full Text: DOI arXiv
Hyde, Kayleigh K.; Kjos-Hanssen, Bjørn Nondeterministic automatic complexity of overlap-free and almost square-free words. (English) Zbl 1334.68173 Electron. J. Comb. 22, No. 3, Research Paper P3.22, 18 p. (2015). MSC: 68R15 68Q30 68Q45 PDFBibTeX XMLCite \textit{K. K. Hyde} and \textit{B. Kjos-Hanssen}, Electron. J. Comb. 22, No. 3, Research Paper P3.22, 18 p. (2015; Zbl 1334.68173) Full Text: arXiv Link
Day, Adam R.; Miller, Joseph S. Density, forcing, and the covering problem. (English) Zbl 1326.03050 Math. Res. Lett. 22, No. 3, 719-727 (2015). MSC: 03D32 03D30 68Q30 PDFBibTeX XMLCite \textit{A. R. Day} and \textit{J. S. Miller}, Math. Res. Lett. 22, No. 3, 719--727 (2015; Zbl 1326.03050) Full Text: DOI arXiv
Musatov, Daniil On extracting space-bounded Kolmogorov complexity. (English) Zbl 1397.68110 Theory Comput. Syst. 56, No. 4, 643-661 (2015). MSC: 68Q30 PDFBibTeX XMLCite \textit{D. Musatov}, Theory Comput. Syst. 56, No. 4, 643--661 (2015; Zbl 1397.68110) Full Text: DOI
Vinodchandran, N. V.; Zimand, Marius On optimal language compression for sets in PSPACE/poly. (English) Zbl 1397.68111 Theory Comput. Syst. 56, No. 3, 581-590 (2015). MSC: 68Q30 68P30 PDFBibTeX XMLCite \textit{N. V. Vinodchandran} and \textit{M. Zimand}, Theory Comput. Syst. 56, No. 3, 581--590 (2015; Zbl 1397.68111) Full Text: DOI arXiv
Simpson, Stephen G. Symbolic dynamics: entropy = dimension = complexity. (English) Zbl 1355.37023 Theory Comput. Syst. 56, No. 3, 527-543 (2015). MSC: 37B10 37B40 94A17 68Q30 PDFBibTeX XMLCite \textit{S. G. Simpson}, Theory Comput. Syst. 56, No. 3, 527--543 (2015; Zbl 1355.37023) Full Text: DOI arXiv
Romashchenko, Andrei; Shen, Alexander Topological arguments for Kolmogorov complexity. (English) Zbl 1331.68119 Theory Comput. Syst. 56, No. 3, 513-526 (2015). MSC: 68Q30 PDFBibTeX XMLCite \textit{A. Romashchenko} and \textit{A. Shen}, Theory Comput. Syst. 56, No. 3, 513--526 (2015; Zbl 1331.68119) Full Text: DOI arXiv
Porter, Christopher P. Trivial measures are not so trivial. (English) Zbl 1330.03079 Theory Comput. Syst. 56, No. 3, 487-512 (2015). MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{C. P. Porter}, Theory Comput. Syst. 56, No. 3, 487--512 (2015; Zbl 1330.03079) 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
Figueira, Santiago; Nies, André Feasible analysis, randomness, and base invariance. (English) Zbl 1336.03047 Theory Comput. Syst. 56, No. 3, 439-464 (2015). MSC: 03D32 03D78 68Q30 PDFBibTeX XMLCite \textit{S. Figueira} and \textit{A. Nies}, Theory Comput. Syst. 56, No. 3, 439--464 (2015; Zbl 1336.03047) Full Text: DOI
Mayordomo, Elvira (ed.); Merkle, Wolfgang (ed.) Editorial. (English) Zbl 1318.00026 Theory Comput. Syst. 56, No. 3, 437-438 (2015). MSC: 00B25 03D32 68Q30 03-06 68-06 PDFBibTeX XMLCite \textit{E. Mayordomo} (ed.) and \textit{W. Merkle} (ed.), Theory Comput. Syst. 56, No. 3, 437--438 (2015; Zbl 1318.00026) Full Text: DOI
Barmpalias, George; Downey, Rod G.; McInerney, Michael Integer valued betting strategies and Turing degrees. (English) Zbl 1321.03054 J. Comput. Syst. Sci. 81, No. 7, 1387-1412 (2015). MSC: 03D32 60G48 68Q30 91A60 PDFBibTeX XMLCite \textit{G. Barmpalias} et al., J. Comput. Syst. Sci. 81, No. 7, 1387--1412 (2015; Zbl 1321.03054) Full Text: DOI arXiv
Almarza, Javier Ignacio; Figueira, Santiago Normality in non-integer bases and polynomial time randomness. (English) Zbl 1322.68112 J. Comput. Syst. Sci. 81, No. 7, 1059-1087 (2015). Reviewer: Liang Yu (Nanjing) MSC: 68Q30 37B10 60G48 68Q45 PDFBibTeX XMLCite \textit{J. I. Almarza} and \textit{S. Figueira}, J. Comput. Syst. Sci. 81, No. 7, 1059--1087 (2015; Zbl 1322.68112) Full Text: DOI arXiv
Maslov, V. P. On the semiclassical transition in the quantum Gibbs distribution. (English) Zbl 1320.82022 Math. Notes 97, No. 4, 565-574 (2015). MSC: 82B26 60J65 PDFBibTeX XMLCite \textit{V. P. Maslov}, Math. Notes 97, No. 4, 565--574 (2015; Zbl 1320.82022) 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
Lattimore, Tor; Hutter, Marcus On Martin-Löf (non-)convergence of Solomonoff’s universal mixture. (English) Zbl 1329.68151 Theor. Comput. Sci. 588, 2-15 (2015). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 68Q30 03D32 PDFBibTeX XMLCite \textit{T. Lattimore} and \textit{M. Hutter}, Theor. Comput. Sci. 588, 2--15 (2015; Zbl 1329.68151) Full Text: DOI
Friesen, Mirjam; Hamed, Aya; Lee, Troy; Oliver Theis, Dirk Fooling-sets and rank. (English) Zbl 1314.05028 Eur. J. Comb. 48, 143-153 (2015). MSC: 05B20 68Q30 PDFBibTeX XMLCite \textit{M. Friesen} et al., Eur. J. Comb. 48, 143--153 (2015; Zbl 1314.05028) Full Text: DOI arXiv
Sureson, Claude Random reals as measures of natural open sets. (English) Zbl 1327.03035 Theor. Comput. Sci. 589, 1-23 (2015). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{C. Sureson}, Theor. Comput. Sci. 589, 1--23 (2015; Zbl 1327.03035) Full Text: DOI
Simpson, Stephen G.; Stephan, Frank Cone avoidance and randomness preservation. (English) Zbl 1371.03052 Ann. Pure Appl. Logic 166, No. 6, 713-728 (2015). MSC: 03D32 68Q30 03D28 03F30 PDFBibTeX XMLCite \textit{S. G. Simpson} and \textit{F. Stephan}, Ann. Pure Appl. Logic 166, No. 6, 713--728 (2015; Zbl 1371.03052) Full Text: DOI
Farr, Graham Cost-effectiveness of algorithms. (English) Zbl 1311.05062 Discrete Math. Theor. Comput. Sci. 17, No. 1, 201-218 (2015). MSC: 05C15 05C85 05C70 05C35 68Q30 68Q17 68W25 PDFBibTeX XMLCite \textit{G. Farr}, Discrete Math. Theor. Comput. Sci. 17, No. 1, 201--218 (2015; Zbl 1311.05062) Full Text: Link
Reimann, Jan; Slaman, Theodore A. Measures and their random reals. (English) Zbl 1375.03050 Trans. Am. Math. Soc. 367, No. 7, 5081-5097 (2015). MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{J. Reimann} and \textit{T. A. Slaman}, Trans. Am. Math. Soc. 367, No. 7, 5081--5097 (2015; Zbl 1375.03050) 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
Liu, Lu Cone avoiding closed sets. (English) Zbl 1369.03101 Trans. Am. Math. Soc. 367, No. 3, 1609-1630 (2015). MSC: 03B30 03F35 03C62 03D32 03D80 68Q30 PDFBibTeX XMLCite \textit{L. Liu}, Trans. Am. Math. Soc. 367, No. 3, 1609--1630 (2015; Zbl 1369.03101) Full Text: DOI arXiv
Mukeru, Safari The descriptive complexity of stochastic integration. (English) Zbl 1329.60168 J. Complexity 31, No. 1, 57-74 (2015). MSC: 60H05 60J65 68Q25 PDFBibTeX XMLCite \textit{S. Mukeru}, J. Complexity 31, No. 1, 57--74 (2015; Zbl 1329.60168) Full Text: DOI
Bauwens, Bruno Van Lambalgen’s theorem fails for some computable measure. arXiv:1509.02884 Preprint, arXiv:1509.02884 [math.LO] (2015). MSC: 03D32 68Q30 BibTeX Cite \textit{B. Bauwens}, ``Van Lambalgen's theorem fails for some computable measure'', Preprint, arXiv:1509.02884 [math.LO] (2015) Full Text: arXiv OA License
Yanofsky, Noson S. Computability and Complexity of Categorical Structures. arXiv:1507.05305 Preprint, arXiv:1507.05305 [cs.CC] (2015). MSC: 18-XX 03-XX 03D15 68Q30 03D10 BibTeX Cite \textit{N. S. Yanofsky}, ``Computability and Complexity of Categorical Structures'', Preprint, arXiv:1507.05305 [cs.CC] (2015) Full Text: arXiv OA License