1. Books

    1. C.S. Calude (ed.). Randomness and Complexity, from Leibniz to Chaitin, World Scientific, Singapore, 2007.

    2. C.S. Calude. Information and Randomness. An Algorithmic Perspective, 2nd Edition, Revised and Extended, Springer-Verlag, 2002, 490 pp. Table of contents.

    3. C.S. Calude, G. Paun. Computing with Cells and Atoms, Taylor & Francis Publishers, London, 2001, 336 pp.

  2. Papers (draft forms can be found as CDMTCS Research Reports; all publications are here)

    1. C. S. Calude, N. J. Hay. Every computably enumerable random real is provably computably enumerable random, Logic Journal of the IGPL, June, 2009, 24 pp, doi:10.1093/jigpal/jzp015.

    2. C.S. Calude, H. Juergensen, L. Staiger. Topology on words, Theoretical Comput. Sci. 410 (2009) 2323--2335.

    3. C.S. Calude and L. Staiger. On universal computably enumerable prefix codes, Mathematical Structures in Computer Science 19 (2009), 45--57.

    4. C. S. Calude, K. Svozil. Quantum randomness and value indefiniteness, Advanced Science Letters 1 (2008), 165-168.

    5. C. S. Calude, M. A. Stay. Most programs stop quickly or never halt, Advances in Applied Mathematics, 40 (2008), 295-308.

    6. C. S. Calude. De-quantising the solution of Deutsch's problem, International Journal of Quantum Information 5, 4(2007), 1-7.

    7. C. S. Calude, M. J. Dinneen. Exact approximations of omega numbers, International Journal of Bifurcation & Chaos, 17, 6 (2007), 1937-1954.

    8. C. S. Calude, G. J. Chaitin. A dialogue on mathematics & physics, The Rutherford Journal: The New Zealand Journal for the History and Philosophy of Science and Technology, Vol. 2, 2006-2007.

    9. C. S. Calude, M. A. Stay. Natural halting probabilities, partial randomness, and Zeta functions, Information and Computation 204 (2006), 1718-1739.

    10. C. S. Calude, Elena Calude, M. J. Dinneen. A new measure of the difficulty of problems, Journal for Multiple-Valued Logic and Soft Computing 12 (2006), 285-307.

    11. C. S. Calude, C. Campeanu, Monica Dumitrescu. Automata recognizing no words: A statistical approach, Fundamenta Informaticae 72 (2006), 1-18.

    12. C. S. Calude, L. Staiger, S. A. Terwijn. On partial randomness, Annals of Applied and Pure Logic, 138 (2006), 20-30.

    13. C. S. Calude, M. A. Stay. From Heisenberg to G\"odel via Chaitin, International Journal of Theoretical Physics 44, 7 (2005), 1053-1065.

    14. C.S. Calude, H. Juergensen. Is Complexity a Source of Incompleteness?, Advances in Applied Mathematics, 35 (2005), 1-15.

    15. C. S. Calude, S. Rudeanu. Proving as a computable procedure, Fundamenta Informaticae, 64 (2005), 1-10.

    16. C. S. Calude, L. Staiger, K. Svozil. Randomness Relative to Cantor Expansions, Comm. Nonlinear Science Numerical Simulation, 10/8 (2005), 921-930.

    17. C. S. Calude, L. Staiger. Generalisations of disjunctive sequences, Math. Log. Quart., 51, 2 (2005), 120-128.

    18. C. S. Calude, J. L. Casti. The jumble cruncher, The New Scientist 25 September 2004, 36-37: page 36, page 37. Posted also by ID Quantique.

      19. New Scientist








    19. C.S. Calude, Elena Calude, S. Marcus. Passages of proof, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 84 (2004), 167-188.

    20. C. S. Calude, G. Paun. Bio-steps beyond Turing, BioSystems 77 (2004), 175-194.

    21. J. J. Arulanandham, C. S. Calude, M. J. Dinneen. A fast natural algorithm for searching, Theoret. Comput Sci., Natural Computing, 320, 1 (2004), 3-13. Among TCS most requested articles Jan-Aug 2004.

    22. C.S. Calude, S. Marcus, L. Staiger. A topological characterization of random sequences,  Inform. Process. Lett. 88 (2003), 245-250.

    23. J. J. Arulanandham,  C.S. Calude,  M.J. Dinneen. Solving SAT with bilateral computing,  Romanian Journal of Information Science and Technology 6, 1-2 (2003), 9-18.

    24. C.S. Calude, Elena Calude, M.J. Dinneen. What is the value of Taxicab(6)? , J. UCS 9, 10 (2003), 1196-1203.

    25. C. S. Calude, B. Pavlov. Coins, quantum measurements, and Turing's barrier, Quantum Information Processing 1, 1-2 (2002), 107-127.

    26. C. S. Calude. Incompleteness, complexity, randomness and beyond, Journal for Artificial Intelligence, Philosophy and Cognitive Science, 12, 4 (2002), 503-517. 

    27. C. S. Calude, M. J. Dinneen and C.-K. Shu. Computing a glimpse of randomness, Experimental Mathematics,  2 (2002), 369-378. Slides

    28. C. S. Calude, K. Salomaa, S. Yu. Additive distance and quasi-distances between words, J. UCS 8, 2 (2002), 141-152.

    29. J. J. Arulanandham, C. S. Calude, M. J. Dinneen. Bead-Sort: A natural sorting algorithm, EATCS Bull. 76 (2002), 76 (2002), 153-162. Simulation of the Bead-Sort Algorithm with just one line MGS code

    30. C. S. Calude, Monica Dumitrescu. Entropic measures, Markov information sources and complexity, Appl. Math. Comput. 132, 2--3 (2002), 369-384.

    31. C. S. Calude. Chaitin Omega numbers, Solovay machines and incompleteness, Theoret. Comput. Sci. 284 (2002), 269-277. Top 25 of most downloaded TCS articles for April-August 2002. 

    32. C. S. Calude. A characterization of c.e. random reals, Theoret. Comput. Sci., 217 (2002), 3-14. 

    33. C. S. Calude, H. Ishihara, T. Yamaguchi. Minimal programs are almost optimal, International Journal of Foundations of Computer Science 12, 4 (2001), 479-489.

    34. C. S. Calude, P. Hertling, B. Khoussainov, Y. Wang. Recursively enumerable reals and Chaitin W numbers, Theoret. Comput. Sci., 255 (2001), 125-149.

    35. C. S. Calude, P. Hertling, H. Jürgensen, K. Weihrauch. Randomness on full shift spaces, Chaos, Solitons & Fractals, 12/3 (2001), 491-503.

  3. Talks