Randomness and computability: Open questions

Bulletin of Symbolic Logic

Volumn 12, Issue 3, 2006, Pages 390-410

  Miller, Joseph S ^a   Nies, André ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748541285     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1154698740     Document Type: Review

References (55)

1. K. AMBOS-SPIES and A. KUCERA, Randomness in computability theory, Computability Theory and its Applications (Boulder, CO, 1999) (P. A. Cholak, S. Lempp, M. Lerman, and R. A. Shore, editors), Contemporary Mathematics, vol. 257, American Mathematical Society, 2000, pp. 1-14.
2. V. BECHER, S. FIGUEIRA, S. GRIGORIEFF, and J. S. MILLER, Randomness and halting probabilities, to appear.
3. C. S. CALUDE and A. NIES, Chaitin Ω numbers and strong reducibilities. Proceedings of the First Japan-New Zealand Workshop on Logic in Computer Science (Auckland, 1997), vol. 3, 1997, pp. 1162-1166, (electronic).
4. P. CHOLAK, M. GROSZEK, and T. SLAMAN, An almost deep degree, The Journal of Symbolic Logic, vol. 66 (2001), no. 2, pp. 881-901.
5. B. F. CSIMA and A. MONTALBÁN, A minimal pair of K-degrees, Proceedings of the American Mathematical Society, vol. 134 (2006), pp. 1499-1502.
6. O. DEMUTH, Remarks on the structure of tt-degrees based on constructive measure theory, Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), pp. 233-247.
7. R. DOWNEY and D. R. HIRSCHFELDT, Algorithmic randomness and complexity, SpringerVerlag, to appear.
8. R. DOWNEY, D. R. HIRSCHFELDT, and G. LAFORTE, Randomness and reducibility. Journal of Computer and System Sciences, vol. 68 (2004), no. 1, pp. 96-114.
9. R. DOWNEY, D. R. HIRSCHFELDT, J. S. MILLER, and A. NIES, Relativizing Chaitin's halting probability. Journal of Mathematical Logic, vol. 5 (2005), pp. 167-192.
10. R. DOWNEY, D. R. HIRSCHFELDT, A. NIES, and F. STEPHAN, Trivial reals, Proceedings of the 7th and 8th Asian Logic Conferences, Singapore University Press, 2003, pp. 103-131.
11. R. DOWNEY, D. R. HIRSCHFELDT, A. NIES, and S. TERWHN, Calibrating randomness, this BULLETIN, vol. 12 (2006), no. 3, pp. 411-491.
12. 2 null sets. The Journal of Symbolic Logic, vol. 71, no. 3, pp. 1044-1052.
13. S. FIGUEIRA, A. NIES, and F. STEPHAN, Lowness properties and approximations of the jump, Annals of Pure and Applied Logic, to appear.
14. S. FIGUEIRA, F. STEPHAN, and G. WU, Randomness and universal machines, to appear.
15. P. GÁCS, Every sequence is reducible to a random one, Information and Control, vol. 70 (1986), pp. 186-192.
16. D. R. HIRSCHFELDT, A. NIES, and F. STEPHAN, Using random sets as oracles, to appear.
17. G. HJORTH and A. NIES, Randomness in effective descriptive set theory, to appear.
18. S. KAUTZ, Degrees of random sets, Ph.D. Dissertation, Cornell University, 1991.
19. B. KJOS-HANSSEN, W. MERKLE, and F. STEPHAN, Kolmogorov complexity and the recursion theorem, to appear.
20. B. KJOS-HANSSEN, A. NIES, and F. STEPHAN, Lowness for the class of Schnorr random reals, SIAM Journal on Computing, vol. 35 (2006), no. 3, pp. 647-657.
21. 0-classes and complete extensions of PA, Recursion Theory Week (Oberwolfach, 1984) (K. Ambos-Spies, G. H. Müller, and G. E. Sacks, editors), Lecture Notes in Mathematics, vol. 1141, Springer, 1985, pp. 245-259.
22. _, An alternative, priority-free, solution to Post's problem, Mathematical Foundations of Computer Science, 1986 (Bratislava, 1986), Lecture Notes in Computer Science, vol. 233, Springer, 1986, pp. 493-500.
23. _, On the role of 0′ in recursion theory, Logic Colloquium '86 (Hull, 1986), Studies in Logic and the Foundations of Mathematics, vol. 124, North-Holland, 1988, pp. 133-141.
24. _, On relative randomness, Annals of Pure and Applied Logic, vol. 63 (1993), pp. 61-67.
25. S. KURTZ, Randomness and genericity in the degrees of unsolvability, Ph.D. Dissertation, University of Illinois, Urbana, 1981.
26. M. LERMAN, Degrees of unsolvability, Perspectives in Mathematical Logic, SpringerVerlag, 1983.
27. J. H. LUTZ, Gales and the constructive dimension of individual sequences. Automata, Languages and Programming (Geneva, 2000), Lecture Notes in Computer Science, vol. 1853, Springer, 2000, pp. 902-913.
28. P. MARITN-LÖF, On the notion of randomness, Intuitionism and Proof Theory, NorthHolland, 1970, pp. 73-78.
29. E. MAYORDOMO, A Kolmogorov complexity characterization of constructive Hausdorff dimension, Information Processing Letters, vol. 84 (2002), no. 1, pp. 1-3.
30. W. MERKLE, The complexity of stochastic sequences, Conference on Computational Complexity 2003 (Aarhus, Denmark), vol. 64, 2003, pp. 230-235.
31. W. MERKLE, J. S. MILLER, A. NIES, J. REIMANN, and F. STEPHAN, Kolmogorov-Loveland randomness and stochasticity, Annals of Pure and Applied Logic, vol. 138 (2006), no. 1-3, pp. 183-210.
32. J. S. MILLER, Every 2-random real is Kolmogorov random, The Journal of Symbolic Logic, vol. 69 (2004), pp. 907-913.
33. _, The K-degrees, low for K degrees, and weakly low for K oracles, in preparation.
34. J. S. MILLER and L. Yu, On initial segment complexity and degrees of randomness, Transactions of the American Mathematical Society, to appear.
35. _, Oscillation in the initial segment complexity of random reals, in preparation.
36. A. A. MUCHNIK, A. L. SEMENOV, and V. A. USPENSKY, Mathematical metaphysics of randomness, Theoretical Computer Science, vol. 207 (1998), no. 2, pp. 263-317.
37. A. NIES, Lowness properties and randomness, Advances in Mathematics, vol. 197 (2005), pp. 274-305.
38. _, Reals which compute little, Logic Colloquium '02 (Z. Chatzidakis, P. Koepke, and W. Pohlers, editors), Lecture Notes in Logic, vol. 27, Association for Symbolic Logic, 2006, pp. 261-275.
39. _, Computability and randomness, Oxford Logic Guides, Oxford University Press, to appear.
40. _, Eliminating concepts, Proceedings of the IMS workshop on computational prospects of infinity, to appear.
41. _, Non-cupping and randomness, Proceedings of the American Mathematical Society, to appear, available at http://cs.auckland.ac.nz/nies/papers.
42. _, Low for random sets: the story, preprint; available at http://www.cs. auckland.ac.nz/nies/papers/.
43. A. NIES and J. RETMANN, A lower cone in the wtt degrees of non-integral effective dimension, Proceedings of the IMS workshop on computational prospects of infinity, to appear.
44. A. NIES, F. STEPHAN, and S. A. TERWIJN, Randomness, relativization and Turing degrees, The Journal of Symbolic Logic, vol. 70 (2005), no. 2, pp. 515-535.
45. J. REIMANN, Computability and fractal dimension, Doctoral dissertation, Universität Heidelberg, 2004, Available at http://math.uni-heidelberg.de/ logic/reimazin/ publications/phdthesis.pdf.
46. B. Y. RYABKO, Coding of combinatorial sources and Hausdorff dimension, Doklady Akademii Nauk SSSR, vol. 277 (1984), no. 5, pp. 1066-1070.
47. G. SACKS, Higher recursion theory, Perspectives in Mathematical Logic, SpringerVerlag, 1990.
48. R. A. SHORE, The theory of the degrees below 0′, Journal of the London Mathematical Society (2), vol. 24 (1981), pp. 1-14.
49. R. SOLOVAY, Handwritten manuscript related to Chaitin's work, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 215 pages, 1975.
50. L. STAIGER, Constructive dimension equals Kolmogorov complexity, Information Processing Letters, vol. 93 (2005), no. 3, pp. 149-153.
51. F. STEPHAN, Martin-Löf random sets and PA-complete sets. Logic Colloquium '02 (Z. Chatzidakis, P. Koepke, and W. Pohlers, editors), Lecture Notes in Logic, vol. 27, Association for Symbolic Logic, 2006, pp. 342-348.
52. F. STEPHAN and L. Yu, Lownessfor weakly 1-generic and Kurtz random, to appear.
53. S. A. TERWIJN and D. ZAMBELLA, Algorithmic randomness and lowness, The Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1199-1205.
54. M. VAN LAMBALGEN, The axiomatization of randomness. The Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1143-1167.
55. L. Yu, Lowness for genericity, Archive for Mathematical Logic, to appear.