Found 38 Documents (Results 1–38)
Randomness and initial segment complexity for measures. (English) Zbl 1518.68147
Reviewer: Liang Yu (Nanjing)
Highness properties close to PA completeness. (English) Zbl 1485.03164
Reviewer: Liang Yu (Nanjing)
Muchnik degrees and cardinal characteristics. (English) Zbl 1485.03160
Reviewer: Jamalbek Tussupov (Astana)
Computing from projections of random points. (English) Zbl 1467.03013
Reviewer: Rupert Hölzl (Neubiberg)
Randomness notions and reverse mathematics. (English) Zbl 1444.03013
Reviewer: Jeffry L. Hirst (Boone)
Martin-Löf randomness implies multiple recurrence in effectively closed sets. (English) Zbl 1529.03220
Closure of resource-bounded randomness notions under polynomial-time permutations. (English) Zbl 1487.68137
Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 51, 10 p. (2018).
Randomness and Solovay degrees. (English) Zbl 1460.03014
Reviewer: Liang Yu (Nanjing)
Calculus of cost functions. (English) Zbl 07907773
Cooper, S. Barry (ed.) et al., The incomputable. Journeys beyond the Turing barrier. Cham: Springer. Theory Appl. Comput., 183-216 (2017).
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).
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).
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
A unifying approach to the Gamma question. (English) Zbl 1395.03019
Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 585-596 (2015).
Demuth’s path to randomness. (English) Zbl 1348.03002
Reviewer: Leon Harkleroad (Bowdoinham)
Solovay functions and their applications in algorithmic randomness. (English) Zbl 1335.03038
Reviewer: Ludwig Staiger (Halle/Saale)
Denjoy, Demuth and density. (English) Zbl 1338.03088
Characterizing the strongly jump-traceable sets via randomness. (English) Zbl 1257.03068
Reviewer: Liang Yu (Nanjing)
Computably enumerable sets below random sets. (English) Zbl 1314.03040
Reviewer: Vladik Ya. Kreinovich (El Paso)
Demuth’s path to randomness. (English) Zbl 1353.03047
Dinneen, Michael J. (ed.) et al., Computation, physics and beyond. International workshop on theoretical computer science, WTCS 2012, dedicated to Cristian S. Calude on the occasion of his 60th birthday, Auckland, New Zealand, February 21–24, 2012. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-642-27653-8/pbk). Lecture Notes in Computer Science 7160, 159-173 (2012).
Demuth randomness and computational complexity. (English) Zbl 1223.03026
Reviewer: Liang Yu (Nanjing)
Upper bounds on ideals in the computably enumerable Turing degrees. (English) Zbl 1227.03055
Reviewer: Roland Sh. Omanadze (Tbilisi)
MSC:
03D25
Universal recursively enumerable sets of strings. (English) Zbl 1217.68115
Reviewer: Liang Yu (Nanjing)
Benign cost functions and lowness properties. (English) Zbl 1221.03036
Reviewer: Roland Sh. Omanadze (Tbilisi)
Higher Kurtz randomness. (English) Zbl 1223.03025
Universal recursively enumerable sets of strings. (English) Zbl 1159.68011
Ito, Masami (ed.) et al., Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16–19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85779-2/pbk). Lecture Notes in Computer Science 5257, 170-182 (2008).
Describing groups. (English) Zbl 1167.20017
Reviewer: Marat M. Arslanov (Kazan)
Filter Results by …
Document Type
- Journal Articles (30)
- Collection Articles (8)
all
top 5
Author
- Nies, André Otfrid (38)
- Greenberg, Noam (6)
- Miller, Joseph S. (6)
- Stephan, Frank (6)
- Bienvenu, Laurent (3)
- Downey, Rodney Graham (3)
- Kučera, Antonín (3)
- Calude, Cristian S. (2)
- Miyabe, Kenshi (2)
- Monin, Benoît (2)
- Staiger, Ludwig (2)
- Turetsky, Dan (2)
- Yu, Liang (2)
- Barmpalias, George (1)
- Brattka, Vasco (1)
- Carotenuto, Gemma (1)
- Chong, Chi Tat (1)
- Figueira, Santiago (1)
- Galicki, Aleksander (1)
- Hirschfeldt, Denis Roman (1)
- Hölzl, Rupert (1)
- Kjos-Hanssen, Bjørn (1)
- Lempp, Steffen (1)
- Melnikov, Alexander G. (1)
- Merkle, Wolfgang (1)
- Nandakumar, Satyadev (1)
- Porter, Christopher P. (1)
- Scholz, Volkher B. (1)
- Shafer, Paul (1)
- Soskova, Mariya Ivanova (1)
- Tent, Katrin (1)
- Triplett, Marcus Anthony (1)
- Yokoyama, Keita (1)
- Zhang, Jing (1)
all
top 5
Serial
- J. Symb. Log. (6)
- Ann. Pure Appl. Logic (4)
- Isr. J. Math. (3)
- Bull. Symb. Log. (3)
- Adv. Math. (2)
- Theor. Comput. Sci. (2)
- J. Math. Log. (2)
- J. Math. Phys. (1)
- J. Comput. Syst. Sci. (1)
- Notre Dame J. Formal Logic (1)
- Proc. Am. Math. Soc. (1)
- Proc. Lond. Math. Soc. (3) (1)
- Trans. Am. Math. Soc. (1)
- Theory Comput. Syst. (1)
- J. Log. Anal. (1)
