Result 1 to 19 of 19 total
Compactness arguments with effectively closed sets for the study of relative randomness. (English)
J. Log. Comput. 22, No. 4, 679-691 (2012).
1
A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one. (English)
J. Symb. Log. 77, No. 2, 447-474 (2012).
2
Computability, algorithmic randomness and complexity. (English)
Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 223-241 (2011).
3
Studying randomness through computation. (English)
Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 207-222 (2011).
4
Demuth randomness and computational complexity. (English)
Ann. Pure Appl. Logic 162, No. 7, 504-513 (2011).
5
Diagonally non-recursive functions and effective Hausdorff dimension. (English)
Bull. Lond. Math. Soc. 43, No. 4, 636-654 (2011).
6
Jump inversions inside effectively closed sets and applications to randomness. (English)
J. Symb. Log. 76, No. 2, 491-518 (2011).
7
Van Lambalgen’s theorem and high degrees. (English)
Notre Dame J. Formal Logic 52, No. 2, 173-185 (2011).
8
Universal recursively enumerable sets of strings. (English)
Theor. Comput. Sci. 412, No. 22, 2253-2261 (2011).
9
Representation of left-computable $ε$-random reals. (English)
J. Comput. Syst. Sci. 77, No. 4, 812-819 (2011).
10
Difference randomness. (English)
Proc. Am. Math. Soc. 139, No. 1, 345-360 (2011).
11
Algorithmic randomness and monotone complexity on product space. (English)
Inf. Comput. 209, No. 2, 183-197 (2011).
12
Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension. (English)
Adv. Math. 226, No. 1, 373-384 (2011).
13
Algorithmic randomness and complexity. (English)
Theory and Applications of Computability. New York, NY: Springer (ISBN 978-0-387-95567-4/hbk; 978-0-387-68441-3/ebook). xxviii, 855~p. EUR~79.95/net; SFR~115.00; \sterling~72.00; \$~99.00 (2010).
14
Effective packing dimension and traceability. (English)
Notre Dame J. Formal Logic 51, No. 2, 279-290 (2010).
15
Schnorr trivial sets and truth-table reducibility. (English)
J. Symb. Log. 75, No. 2, 501-521 (2010).
16
Lowness and highness properties for randomness notions. (English)
Arai, T. (ed.) et al., Proceedings of the 10th Asian logic conference, Kobe, Japan, September 1‒6, 2008. Hackensack, NJ: World Scientific (ISBN 978-981-4293-01-3/hbk; 978-981-4293-02-0/ebook). 124-151 (2010).
17
Superhighness. (English)
Notre Dame J. Formal Logic 50, No. 4, 445-452 (2009).
18
Definability and elementary equivalence in the Ershov difference hierarchy. (English)
Cooper, S. Barry (ed.) et al., Logic colloquium 2006. Proceedings of the annual European summer meeting of the Association for Symbolic Logic (ASL), Nijmegen, Netherlands, July 27‒August 2, 2006. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 978-0-521-11081-5/hbk). Lecture Notes in Logic 32, 1-17 (2009).
19
Result 1 to 19 of 19 total
Start
Contact
Print
General Help
