Complexity and randomness

Rendiconti del Seminario Matematico

Volumn 62, Issue 1, 2004, Pages 1-38

  Terwijn, S A ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 29144441331     PISSN: 03731243     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (63)

1. Ambos-Spies K. and Kucera A., Randomness in computability theory, in: "Computability theory: current trends and open problems" (Eds. Cholak P. et al.), Contemporary Mathematics 257(2000), 1-14.
2. Ambos-Spies K., Merkle W., Reimann J. and Stephan F., Hausdorffdimension in exponential time, Computational Complexity, IEEE Computer Society (2001), 210-217.
3. Calude C. S., Information and randomness, an algorithmic perspective, Springer, 1994 (second edition 2002).
4. Calude C. S., Hertling P. H., Khoussainov B. and Wang Y., Recursively enumerable reals and Chaitin Ω numbers, Proc. STACS, Springer, 1998, 596-606.
5. Chaitin GJ., A theory of program size formally identical to information theory, Journal of the ACM 22 (1975) 329-340.
6. Chaitin G J., Algorithmic information theory, Cambridge University Press, 1987.
7. Downey R. G., Some computability-theoretical aspects of reals and randomness, manuscript, 2001.
8. 2set with no infinite low subset in either it or its complement, Journal of Symbolic Logic 66(2001), 1371-1381.
9. Downey R. G., Hirschfeldt D. R., Nies A. and Stephan F., Trivial reals, in: "Electronic Notes in Theoretical Computer Science", 2002.
10. Downey R. G., Hirschfeldt D. R., Nies A. and Terwijn S. A., Calibrating randomness, to appear.
11. Downey R. G. and Terwijn S. A., Computably enumerable reals and uniformly presentable ideals, Mathematical Logic Quarterly 48 1(2002), 29-40.
12. Falconer K., Fractal geometry, mathematical foundations & applications, Wiley & Sons, 1992.
13. Hausdorff F., Dimension und äußeresMaß, Mathematische Annalen 79(1919), 157-179.
14. Hitchcock J. M., Lutz J. H. and Terwijn S. A., The arithmetical complexity of dimension and randomness, manuscript, 2003.
15. Jech T., Set theory, Academic Press, 1978.
16. Kamae T., Subsequences of normal sequences, Israel J. Math. 16(1973), 121-149.
17. Katseff H. P., Complexity dips in random infinite binary sequences, Information and Control 38(1978), 258-263.
18. Kautz S. M., Degrees of random sets, PhD Thesis, Cornell University, 1991.
19. Kechris A. S., Classical descriptive set theory, Springer-Verlag, 1994.
20. Khoussainov B., Randomness, computability and algebraic specifications, Annals of Pure and Applied Logic 91(1998), 1-15.
21. Ki H. and Linton T., Normal numbers and subsets of ω with given densities, Fundamenta Mathematicae 144(1994), 163-179.
22. Ko K.-I, On the notion ofinfinite pseudorandom sequences, Theoretical Computer Science 48(1986), 9-33.
23. Kraft L. G., A device for quantizing, grouping and coding amplitude modulated pulses, M. Sc. Thesis, MIT, 1949.
24. 1-classes and complete extensions of PA, Lect. Notes in Math. 1141, Springer-Verlag, 1985, 245-259.
25. Kucera A. and Slaman T. A., Randomness and recursive enumerability, SIAM J. Comput. 31(2001), 199-211.
26. Kucera A. and Terwijn S. A., Lowness for the class of random sets, Journal of Symbolic Logic 64 4(1999), 1396-1402.
27. Kurtz S. A., Randomness and genericity in the degrees of unsolvability, PhD Thesis, University of Illinois, 1981.
28. Van Lambalgen M., Random sequences, PhD Thesis, University of Amsterdam, Amsterdam 1987.
29. Lathrop J. I. and Lutz J. H., Recursive computational depth, Information and Computation 153(1999), 139-172.
30. Levin L. A., On the notion of a random sequence, Soviet Math. Dokl. 14(1973), 1413-1416.
31. Li M. and Vitanyi P., An introduction to Kolmogorov complexity and its applications, Springer-Verlag, 1993.
32. Lutz J. H., Category and measure in complexity classes, SIAM J. Comput. 19(1990), 1100-1131.
33. Lutz J. H., Almost everywhere high nonuniform complexity, J. Comput. System Sci. 44(1992), 220-258.
34. Lutz J. H., Dimension in complexity classes, in: "Proceedings of the 15th Conference on Computational Complexity", IEEE Computer Society, 2000, 158-169.
35. Lutz J. H., The dimensions of individual strings and sequences, Information and Computation, to appear. Preliminary version: Gales and the constructive dimension of individual sequences, in: "Proceedings of the 27th International Colloquium on Automata, Languages and Programming", Springer, 2000, 902-913.
36. Martin-Lof P., The definition of random sequences, Information and Control 9(1966), 602-619.
37. Mayordomo E., A Kolmogorov complexity characterization of constructive Hausdorff dimension, Information Processing Letters 84(2002), 1-3.
38. Moschovakis Y. N., Descriptive set theory, North-Holland, 1980.
39. Nies A., Reals which compute little, typeset manuscript, 2002.
40. Nies A., Lowness properties of reals and randomness, typeset manuscript, 2002.
41. Nies A., Each Low (CR) set is computable, typeset manuscript, 2003.
42. Nies A., Stephan F. and Terwijn S. A., Randomness, relativization, and Turing degrees, in preparation.
43. Odifreddi P. G., Classical recursion theory, Vol. 1, Studies in logic and the foundations of mathematics 125, North-Holland, 1989.
44. Odifreddi P. G., Classical recursion theory, Vol. 2, Studies in logic and the foundations of mathematics 143, North-Holland, 1989.
45. Oxtoby J. C., Measure and Category, Springer, 1980.
46. Rogers H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, 1967.
47. Sacks G. E., Degrees ofunsolvability, Annals of Mathematics Studies 55, Princeton University Press, 1963.
48. Schnorr C.-P., Zufälligkeit und Wahrscheinlichkeit, Lect. Notes in Math. 218, Springer-Verlag, 1971.
49. Shannon C. E., The mathematical theory of communication, Bell System Tech. J. 27(1948), 379-423, 623-656.
50. Soare R., Recursively enumerable sets and degrees, Springer, 1987.
51. Solomonoff R. J., A preliminary report on a general theory of inductive inference, Tech. Report ZTB-138, Zator Company, Cambridge, 1960.
52. Solovay R., A model of set theory in which every set of reals is Lebesgue measurable, Annals of Mathematics 92(1970), 1-56.
53. Solovay R., Draft of a paper (or series of papers) on Chaitin's work, unpublished manuscript, IBM Thomas J. Watson Research Center, New York 1975.
54. Staiger L., Constructive dimension equalsKolmogorov complexity, Research Report CDMTCS-210, University of Auckland, 2003.
55. Terwijn S. A., Computability and measure, PhD thesis, University of Amsterdam/ILLC, Amsterdam 1998.
56. 2, in: "Reuniting the Antipodes - Constructive and Nonstandard Views of the Continuum" (Eds. Berger U., Osswald H. and Schuster P.), Synthese Library, Kluwer, 2000, 271-284.
57. Terwijn S. A., Complexity and randomness, research report CDMTCS-212, University of Auckland.
58. Terwijn S. A. and Zambella D., Computational randomness and lowness, Journal of Symbolic Logic 66 3(2001), 1199-1205.
59. Ville J., Etude critique de la notion de collectif, Gauthier-Villars, 1939.
60. Wang Y., Randomness and complexity, PhD Thesis, University of Heidelberg, Heidelberg 1996.
61. Wang Y., A separation of two randomness concepts, Information Processing Letters 69 3(1999), 115-118.
62. Zambella D., On sequences with simple initial segments, ILLC technical report ML-1990-05, University of Amsterdam, Amsterdam 1990.
63. Zvonkin A. K. and Levin L. A., The complexity off inite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russian Math. Surveys 25 6(1970), 83-124.