The following is a list of papers that cited my results on effective randomness and W numbers

1997. My initial publications :

Y.Wang: Randomness and Complexity. 1996. (pdf, 971K)
Y.Wang: A separation of two randomness concepts. Information Processing Letters, 69(3):115--118, 1999. (pdf, 154K)
Y.Wang: Resource bounded randomness and computational complexity. Theoretical Computer Science 237(1-2):33--55, 2000. (pdf, 164K)
C.Calude, P.Hertling, B.Khoussainov, and Y.Wang: Recursively enumerable reals and Chaitin's W numbers. Theoretical Computer Science 255:125--149, 2001. (pdf, 200K)

1997:

A. Klaus-Spies and E. Mayordomo. Resource-bounded measure and randomness. In "Complexity, Logic, and Recursion Theory" (A. Sorbi, Ed.), Lecture Notes in Pure and Applied Mathematics, Vol 187 (1997) 1-47, Marcel Dekker.
C.Calude and A.Nies. Chaitin Numbers and Strong Reducibilities. Journal of Universal Computer Science, 1997.
Y Wang. The Law of the Iterated Logarithm for p-Random Sequences. IEEE CCC 1996.
Y Wang. NP-hard sets are superterse unless NP is small. Information Processing Letters, 1997

1998:

S. A. Terwijn, Computability and measure, PhD thesis, University of Amsterdam, 1998.
Peter Hertling and Klaus Weihrauch. In Proc. of ICALP'98. LNCS 1443, Springer-Verlag.
Y Wang. Genericity, randomness, and polynomial-time approximations. SIAM J. Comput., 1998
M Burmester, Y Desmedt, Y Wang. Using Approximation Hardness to Achieve Dependable Computation In: RANDOM, 1998

1999:

JI Lathrop and JH Lutz. Recursive Computational Depth. Information and Computation, 1999
Y Wang. Randomness, Stochasticity, and Approximations. Theory of Computing Systems, 1999
Y Wang. Linear Complexity versus Pseudorandomness: On Beth and Dai's Result. ASIACRYPT, 1999
R.Downey. Computability, definability, and algebraic structures. Proceedings of the 7th Asian Logic Conference, 1999.

2000:

T. Ebert, W. Merkle, H. Vollmer. On the Autoreducibility of Random Sequences. In: Mathematical Foundations of Computer Science 2000, LNCS 2000:333-343, Springer 2000.
K. Ambos-Spies and A. Kucera. Randomness in Computability Theory. In: "Computability Theory: Current Trends and Open Problems" (P. Cholak et al., Eds.), Contemporary Mathematics, Vol 257 (2000) 1-14, American Mathematical Society.
S. A. Terwijn. On the quantitative structure of \Delta_2^0. in: U. Berger, H.Osswald, and P. Schuster (eds.), Reuniting the Antipodes. Constructive and Nonstandard Views of the Continuum, Synthese Library, Kluwer Academic Press, 2000, 271-283.
K Ambos-Spies, K Weihrauch, X Zheng. Weakly computable real numbers. Journal of Complexity, 2000.
C.Calude. Chaitin numbers, Solovay machines and Godel incompleteness. Theoretical Computer Science, 2000
R.Downey. Some computability-theoretical aspects of reals and randomness 2000
C.Calude. Who is afraid of randomness. Millennial Symposium Defining the Science of Stochastics, 2000.
C.Calude, M.Dinneen, and C.Shu. Computing 80 Initial Bits of A Chaitin Omega Number. CDMTCS Research Report, 2000
C.Calude. Real Numbers: From Computable to Random. CDMTCS Research Report, 2000

2001:

G.Wu. Prefix-free languages and initial segments of computably enumerable degrees. Proc. of COCOON, LNCS 2108, pages 576--585, Springer-Verlag, 2001.
R. Downey, D. Hirschfeldt, and G. LaForte. Randomness and reducibility. In: Proc. of MFCS 2001, LNCS 2136, Springer Verlag.
Marcus Hutter. Convergence and Error bounds of Universal Prediction for General Alphabet. In: Proceedings of the 12th Eurpean Conference on Machine Learning (ECML-2001) (Luc De Raedt and Peter Flach, eds.) Lecture Notes in Artificial Intelligence (LNAI 2167), pages 239--250, 2001.
A. Kucera and T. Slaman. Randomness and recursive enumerability, SIAM J. Comput., 31:199-211, 2001.
V.Becher, S.Daicz and G.Chaitin. A highly random number. In roceedings of the Third Discrete Mathematics and Theoretical Computer Science Conference (DMTCS'01), pages 55--68. Springer-Verlag London, 2001.
W Merkle. The global power of additional queries to p-random oracles. SIAM J. Comput. 31(2):483--495, 2001.
R.ROCHA. A Proposal of a Computational Device Based on Adaptive Automata 2001

2002:

R. Downey, D. Hirschfeldt, and A. Nies. Randomness, computability, and density. SIAM J. COMPUT. 31(4):1169--1183, 2002. (an Earlier version appeared in STAC 2001)
R. Downey, D. Hirschfeldt, A. Nies, and F. Stephen. Trivial reals. Electronic Notes in Theoretical Computer Science 66(1), 2002.
R. Downey and S. Terwijn. Computably enumerable reals and uniformly presentable ideals. Mathematical Logic Quarterly 48(1):29-40, 2002.
X. Zheng. Recursive approximability of real numbers. Mathematical Logic Quarterly, 48(2002), Suppl. 1, 131 - 156
R. Downey and G. LaForte. Presentations of computably enumerable reals. Theoretical Computer Science 284(2):539--555, 2002.
R. Downey and S. A. Terwijn, Computably enumerable reals and uniformly presentable ideals, Mathematical Logic Quarterly 48(1) (2002) 29-40.
R.Downey and E.Griffiths. Schnorr randomness. Electronic Notes in THeoretical Computer Science 66(1), 2002.
K. Tadaki. Upper bound by Kolmogorov complexity for the probability in computable POVM measurement. 2002
C.Calude. A characterization of ce random reals. Theoretical Computer Science 271 (2002).
J.Schmidhuber. Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable. International Journal of Foundations of Computer Science, 2002
R.Rettinger, X.Zheng, R.Gengler, B.von Braunmuehl. Monotonically Computable Real Numbers. Math. Log. Quart. 48 (2002).
C.Calude, M.Dinneen, C.Shu. Computing a glimpse of randomness. Experimental Mathematics, 2002.
C.Calude. Incompleteness, Complexity, Randomness and Beyond. Minds and Machines, 2002.
R.Downey and S.Terwijn. Computably Enumerable Reals and Uniformly Presentable Ideals. Math. Log. Quart. 48 (2002) Suppl. 1, 29-40.
G.Wu. Structural properties of the dce degrees and presentations of ce reals. PhD thesis, University of Victoria at Wellington, 2002.
W Merkle. The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences. In: Proc. ICALP, 2002

2003:

J. Hitchcock, J. Lutz, and S. Terwijn. The arithmetical complexity of dimension and randomness. Proceedings of the 17th Annual Conference of the European Association for Computer Science Logic (Vienna, Austria, August 25-30, 2003), LNCS 2803, pages 241-254, Springer-Verlag, 2003.
S. Terwijn. Complexity and randomness. CDMTCS Research Report 212.
M.Hutter. Optimality of Universal Bayesian Sequence Prediction for General Loss and Alphabet. Journal of Machine Learning Research, 2003
R.Rettinger and X.Zheng. On the hierarchy and extension of monotonically computable real numbers. J. Complexity, 2003
Marcus Hutter. On the Existence and Convergence of Computable Universal Priors. In: Proc. Algorithmic Learning Theory 2003, LNCS 2842, Springer-Verlag GmbH.
S Reid. The classes of algorithmically random reals. Master Thesis, University of Wellington, 2003.
W Merkle. The complexity of stochastic sequences In: Proc. IEEE Conference on Computational Complexity, 2003
S.Cooper. Computability Theory. CRC Press, 2003. ISBN: 1584882379.

2004:

Rodney G. Downey: Some Recent Progress in Algorithmic Randomness. MFCS 2004: 42-83
R.Downey, E.Friffiths, and S.Reid. On Kurtz randomness. Theoretical Computer Science, 2004.
R.Downey, E.Griffiths, and G.Laforte. On Schnorr and computable randomness, martingales, and machines. Math. Log. Quart. 50, No. 6. 613-627, 2004.
W. Merkle, N. Mihailovic, and T. Slaman. Some results on effective randomness. In Proc. 31st ICALP 2004.
K. Tadaki. An extension of Chaitin's halting probability W to measurement operator in infinite dimensional quantum system. 2004
L.Yu and D.Ding. There is no SW-complete ce real. J. Symb. Logic, 2004.
L. Yu, D. Ding, and R. Downey. The Kolmogorov complexity of the random reals. Ann. Pure Appl. Logic, 2004.
R. Downey, G. Wu, and X. Zheng. Degrees of d.c.e. reals. Mathematical Logic Quarterly, 2004.
X.Zheng, R.Rettinger, and R.Gengler. Closure Properties of Real Number Classes under CBV Functions. Theory of Computing Systems, 2004.
Xizhong Zheng and Robert Rettinger. On the Extensions of Solovay-Reducibility. COCOON 2004, LNCS 3106.
Xizhong Zheng. On the Hierarchy of Delts_2^0-real numbers. In: Real Numbers and Computers, 192-216, 2004, Dagstuhl.
J Poland and M Hutter. Convergence of discrete MDL for sequential prediction. In: Proc. 17th Annual Conf. on Learning Theory (COLT-2004).

2005:

G.Wu. Regular reals. Math. Log. Quart. 51(2):111-119, 2005.
S.Figueira, A.Nies, and F.Stephan. Lowness properties and approximations of the jump. WoLLIC 2005
V.BECHER and S.GRIGORIEFF. Random reals and possibly infinite computations part I: randomness. J. Symbolic Logic, 2005
R Rettinger and X Zheng. Solovay Reducibility on Dc. e Real Numbers. COCOON 2005, LNCS 3595.
Frank Stephan and Guohua Wu. Presentations of K-Trivial Reals and Kolmogorov Complexity. First Conference on Computability in Europe, CiE 2005. LNCS 3526, Springer Verlag.
S Kohler, C Schindelhauer, and M Ziegler. On Approximating Real-World Halting Problems. In: 15th International Symposium, FCT 2005, LNCS 3623, Springer Verlag.
Andre Nies, FStephan and Sebastiaan A. Terwijn Randomness, relativization and Turing degrees. J. Symbolic Logic 70, iss. 2 (2005).
M Hutter On Generalized Computable Universal Priors and their Convergence. 2005.

2006:

R.Downey, D.Hirschfeldt, J.Miller, and A.Nies. Relativizing Chaitin's halting probability. In: Journal of Mathematical Logic
R.Downey, D.Hirschfeldt, A.Nies, and S.Terwijn. Calibrating randomness. Bulletin of Symbolic Logic

Others:

P. Hellekalek. Randomness and (pseudo-)random number generators. PDF
L.Yu, D.Ding, and R.Downey. The complexity of the random reals. here
F.Rosemeier. Zufallige Binarfolgen und zufallige reelle Zahlen. here
DR Hirschfeldt, SA Terwijn. Limit Computability and Constructive Measure

You are visitor # since 01/06.