itbpFX1.2047in1.3491in-0.3304inlanguage "Scientific Word";type "GRAPHIC";maintain-aspect-ratio TRUE;display ÜSEDEF";valid_file "F";width 1.2047in;height 1.3491in;depth -0.3304in;original-width 2.6143in;original-height 2.9378in;cropleft "0";croptop "1";cropright "1";cropbottom "0";filename '../../download/cris.jpg';file-properties "XNPEU";

Cristian S. Calude

Curriculum Vitæ

Auckland, Jul 16, 1998



1.  Personal Data

             Birth Date: ¯ 21 April 1952
             Place of Birth: ¯ Gala ti, Romania
             Nationality: ¯ New Zealand and Romanian
             Sex: ¯ Male
             Family Status: ¯ Married Elena Calude (B.Sc., Ph.D.)
 One child: Andreea Simona Calude (born in 1979)
             Residence: ¯ 2/4 Esperance Road, Glendowie, Auckland, 1005 New Zealand
             Office: ¯ Computer Science Department
 The University of Auckland
 Private Bag 92019, Auckland
 New Zealand
             Phone: ¯ +64-9-528-9184 (Residence)
 +64-9-373-7599 extension 5751 (Office)
 +64-21-657-184 (Cellphone)
             Fax: ¯ +64-9-373-7453
             Email: ¯ cristian@cs.auckland.ac.nz, cristian@ibm.net
             URL: http://www.cs.auckland.ac.nz/~cristian/

2.  University Education

             1976-1977: ¯ Graduate Studies in Computer Science and Mathematics
 Bucharest University, Romania
 Degree: Ph.D. in Computer Science (1977)
 Ph.D.Thesis: Categorical Methods in Computation Theory
 Supervisor: Prof. Dr. Doc. S. Marcus
             1971-1975: ¯ Undergraduate Studies in Computer Science and Mathematics
 Bucharest University, Romania
 Degrees: B.Sc.(Hons) in Computer Science and Mathematics (1975)
 Computer Science Thesis: Man-Computer Communication
 Mathematics Thesis: Contextual Metrics
 Supervisor: Prof. Dr. Doc. S. Marcus

3.  Positions1

3.1  Academic Positions

  1. Professor (with a Personal Chair in Computer Science), Computer Science Department, The University of Auckland, Auckland, New Zealand, from April 1994 on.2

  2. Professor, Department of Foundations of Computer Science, Faculty of Mathematics, Bucharest University, Romania, from February 1994 on.

  3. Associate Professor, Computer Science Department, The University of Auckland, Auckland, New Zealand, from May 1993 to March 1994.

  4. Lecturer, Computer Science Department, The University of Auckland, Auckland, New Zealand, from December 1992 to May 1993.

  5. Associate Professor, Department of Computer Science, Faculty of Mathematics, Bucharest University, Romania, from February 1991 to February 1994.

  6. Senior Lecturer, Department of Computer Science, Faculty of Mathematics, Bucharest University, Romania, from September 1983 to February 1991.

  7. Assistant Professor, Department of Computer Science, Faculty of Mathematics, Bucharest University, Romania, from September 1981 to September 1983.

  8. Associate Assistant Professor, Department of Computer Science, Faculty of Mathematics, Bucharest University, from September 1975 to September 1981.

3.2  Research Positions

  1. Associate Member of the International Solvay Institutes, Brussels Free University, Brussels, Belgium, from June 1998 on.

  2. Director, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand, from January 1998 on.

  3. Co-director, Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland and University of Waikato, New Zealand, from May 1995 to December 1997.

  4. Chief of the Symbolic Computation Division, Bucharest University, Romania, from November 1991 to December 1994.

  5. Senior Researcher and Scientific Secretary, Committee on Prospective Studies, Romanian Academy, Bucharest, Romania, from April 1989 to September 1992.

  6. Mathematics Researcher, Department of Mathematics, INCREST, Bucharest, Romania, from September 1984 to February 1985.

  7. Senior Computer Scientist, Department of Compiler Design, Research Institute for Computer Technique, Bucharest and Cluj, Romania, from September 1981 to July 1982.

  8. Senior Researcher, Project on Goals, Processes and Indicators of Development (GPID), United Nations University, Tokyo, Japan, from November 1978 to December 1983.

3.3  Visiting Positions

  1. Visiting Researcher, International Solvay Institutes, Brussels Free University, Brussels, Belgium, June 1998.

  2. Visiting Professor, Department of Computer Science, The University of Western Ontario, London, Canada, from October 1993 to November 1993.

  3. Visiting Professor, Department of Computer Science, The University of Western Ontario, London, Canada, from September 1992 to December 1992.

3.4  Other Positions

  1. Chair, Graduate Student Support Committee, Department of Computer Science, University of Auckland, New Zealand, from August 1994 to December 1996.

  2. Member, University of Auckland Senate, University of Auckland, New Zealand, from April 1994 on.

  3. Member, Hyper-Media Unit, University of Auckland, New Zealand, from January 1994 to December 1995.

  4. Member, Pure Mathematics Committee, School of Mathematical & Information Sciences, University of Auckland, New Zealand, from May 1993 on.

  5. Member, Standing Committee on Informatics, Board of Studies in Mathematical & Information Sciences, University of Auckland, New Zealand, from August 1993 on.

  6. Chair, Working Group on Theoretical Computer Science, University of Auckland, Auckland, New Zealand, from April 1993 on.

  7. Dean, Faculty of Mathematics, Hyperion University, Bucharest, Romania, from October 1991 to October 1992.

  8. Member, Appointment and Promotion Committee, Bucharest University, Romania, from September 1990 to September 1992.

  9. Member, Committee on Mathematics Education, Bucharest University, Romania, from September 1990 to September 1992.

  10. Member, Computer Science Ph.D. Committee, Bucharest University, Romania, from April 1990 on.

  11. Member, Library Committee, Faculty of Mathematics, Bucharest University, Romania, from September 1988 to November 1990.

  12. Member, Graduation Executive Committee, Bucharest University, Romania, from September 1981 to September 1990.

  13. Head of the Computer Science Department, School for Computer Science, Bucharest, Romania, from January 1978 to October 1978.

  14. Mathematics and Computer Science Professor, School for Computer Science, Bucharest, Romania, from September 1975 to October 1978.

4.  Languages

Primary: ¯ English, French, Romanian
Secondary: ¯ Italian

5.  Courses Taught

  1. 1975-1992: Department of Computer Science, Faculty of Mathematics, Bucharest University, Bucharest, Romania.

  2. 1991-1992: Department of Computer Science, Hyperion University, Bucharest, Romania.

  3. Fall 1992: Department of Computer Science, The University of Western Ontario, London, Canada.

  4. 1993: Computer Science Department, The University of Auckland, Auckland, New Zealand.

  5. 1994: Computer Science Department, The University of Auckland, Auckland, New Zealand.

  6. Fall 1994: Foundations of Computer Science Department, Bucharest University, Romania

  7. Computer Science Department, The University of Auckland, Auckland, New Zealand.

6.  Research Grants

  1. United Nations University (Tokyo) Research Grant, 1978-1982, US$60,000, for the project Mathematical Paths in the Study of Human Needs. Team's leader: Prof. S. Marcus.

  2. Romanian Ministry of Education Research Grant, 1988-1992, US$18,000, for the project Contributions to Descriptive Complexity.

  3. Soros Foundation for An Open Society Fellowship, 1992, US$2,800, to attend the Colloquium on Semigroups, Formal Languages and Combinatorics on Words, Kyoto University, Japan.

  4. Natural Sciences and Engineering Council of Canada Grant OGP000243, Fall 1992 (via Professor Helmut Jürgensen), Can$5,000, partially supporting a visit to the University of Western Ontario, Canada.

  5. University Auckland Research Grant A18/XXXXX/62090/3414012, 1993, NZ$8,000, for the project Random Numbers and Applications.

  6. University Auckland Research Grant, A18/XXXXX/62090/F3414018, 1993, NZ$1,500, for the project Random Numbers and Applications.

  7. University Auckland Research Grant, A18/XXXXX/62090/F3414022, 1994, NZ$4,152, for the project Random Numbers and Applications.

  8. University Auckland Research Grant, A18/XXXXX/62090/F3414030, 1994, NZ$7,000, for the project Random Numbers and Applications.

  9. University Auckland Research Grant, A18/XXXXX/62090/F3414044, 1995, NZ$5,000, for the project Randomness on Shift Spaces.

  10. Auckland University Research Grant, A18/XXXXX/62090/F3414050, 1996, NZ$3,200, for the project Randomness on Shift Spaces.

  11. University Auckland Research Committee Post-Doctoral Fellowship, 1996, for the period 1997-1999 (NZ$44,250 per annum, plus NZ$4000 for travel), for the project Complexity and Randomness in Non-Linear Spaces.

  12. Auckland University Research Grant, A18/XXXXX/62090/F3414056, 1996, NZ$3,200, for the project Physical versus Computational Complementarity.

  13. Auckland University Research Grant, A18/XXXXX/62090/F3414063, 1997, NZ$4,000, for the project Physical versus Computational Complementarity.

  14. Auckland University Research Grant, A18/XXXXX/62090/F3414069, 1997, NZ$2,000, for the project Topics in Algorithmic Information Theory (conference travel for Asat Arslanov).

  15. Auckland University Research Grant, A18/XXXXX/62090/F3414075, 1997, NZ$4,000, for the project Physical versus Computational Complementarity.

  16. Auckland University Research Grant, A18/XXXXX/62090/F3414082, 1998, NZ$4,500, for the project Physical versus Computational Complementarity.

  17. Auckland University Research Infrastructure Grant, 1998, NZ$75,000 (with C. Collberg, M. Dinneen, P. Fenwick, P. Gibbons, H. Guesgen, J. Hamer, B. Khoussainov, J. Lennon, R. Murgridge, P. Riddle, C. Thmborson, X. Ye).

7.  Publications

7.1  Papers in Refereed Journals

  1. C.S. Calude, J.L. Casti. Silicon, molecules, or photons? Complexity (1998), in press.

  2. C.S. Calude, E. Calude, C. tefnescu. Computational complementarity for Mealy automata, EATCS Bull. 66 (1998), in press; Extended abstract, An. Univ. Bucureti, Mat.-Inf., (1998), in press.

  3. C.S. Calude, P. Hertling. Computable approximations of reals: An information-theoretic analysis, Fundamenta Informaticae  33 (1998), 1-16.

  4. C.S. Calude, J.L. Casti. Parallel thinking, Nature 392 (1998), 549-551.

  5. C.S. Calude, J.L. Casti, P.B. Gibbons, M. Lipponen. Unconventional models of computation: A conventional report, Complexity 3, 4 (1998), 8-11.

  6. C. Calude, F. W. Meyerstein. Is the universe lawful?, Chaos, Solitons & Fractals (1998), in press.

  7. C. S. Calude, M. Lipponen. Computational complementarity and shift spaces, Extended abstract, Chaos, Solitons & Fractals, (1998), in press.

  8. C. S. Calude, P. H. Hertling, K. Svozil. Embedding quantum universes into classical ones, Foundations of Physics, (1998), in press.

  9. C. S. Calude, P. H. Hertling, K. Svozil. Kochen-Specker theorem: Two geometric proofs, Tatra Mountains Journal (1998), in press.

  10. D. Bridges, C. Calude, B. Pavlov, D. tefnescu. The inverse function theorem-a constructive approach, Chaos, Solitons & Fractals (1998), in press.

  11. C. Calude, T. Zamfirescu. The typical number is a lexicon, New Zealand Journal Math. 27 (1998), 7-13.

  12. C. S. Calude, A. Nies. Chaitin W numbers and strong reducibilities, J. UCS 3 (1997), 1161-1166.

  13. C. S. Calude, I. Tomescu. Optimum extendible prefix codes, J. UCS 3 (1997), 1167-1179.

  14. C. S. Calude. A genius' story: Two books on Gödel, Complexity 3, 2 (1997), 1-5.

  15. C. Calude, E. Calude, B. Khoussainov. Deterministic automata: simulation, universality and minimality, Annals of Applied and Pure Logic 90, 1-3 (1997), 263-276.

  16. C. Calude, P. Hertling, B. Khoussainov. Do the zeros of Riemann's zeta-function form a random sequence?, EATCS Bull. 62 (1997), 199-207.

  17. C. Calude, E. Calude, K. Svozil, S. Yu. Physical versus computational complementarity I, International Journal of Theoretical Physics 36 (1997), 1495-1523.

  18. C. Calude, S. Yu. Language-theoretic complexity of disjunctive sequences, Discrete Appl. Mathematics 80 (1997), 199-205.

  19. C. Calude, S. Marcus, D. tefnescu. The Creator versus its creation. From Scotus to Gödel, Annals of the Gödel Society, Springer-Verlag, 1998.

  20. C. Calude. The finite, the unbounded and the infinite, J. UCS 2 (1996), 242-244.

  21. C. Calude and C. Grozea. Kraft-Chaitin inequality revisited, J. UCS 2 (1996), 306-310. (MR 97c:68070)

  22. C. Calude. Algorithmic information theory: Open problems, J. UCS 2 (1996), 439-441. (MR 97f:68080)

  23. C. Calude, C. Câmpeanu. Are binary codings universal?, Complexity 1, 15 (1996), 47-50. (MR 97a:68086)

  24. C. Calude, M. Zimand. Effective category and measure in abstract complexity theory, Theoret. Comput. Sci. 154 (1996), 307-327. (MR 97a:68060)

  25. G. J. Chaitin, A. Arslanov, C. Calude. Program-size complexity computes the halting problem, EATCS Bull. 57 (1995), 198-200.

  26. C. Calude. What is a random string? J. UCS, Vol. 1,1 (1995), 48-66.

  27. C. Calude, M. Ttrm. Three theories of computational complexity. Extended abstract, An. Univ. Iai, Inf. 3 (1994), 45-52.

  28. C. Calude, H. Jürgensen, M. Zimand. Is independence an exception?, Appl. Math. Comput. 66 (1994), 63-76. (MR 96c:03113, Zbl 822# 03024)

  29. D. S. Bridges, C. Calude. On recursive bounds for the exceptional values in speed-up, Theoret. Comput. Sci. 132(1994), 387-394. (MR 95f: 03059, Zbl 807#03026)

  30. C. Calude, C. Câmpeanu. Note on the topological structure of random strings, Theoret. Comput. Sci. 112(1993), 383-390. (MR 94d: 68081, Zbl 781#68073)

  31. C. Calude, G. Istrate, M. Zimand. Recursive Baire classification and speedable functions, Z. Math. Logik Grundlang. Math. 3 (1992), 169-178. (MR 94j: 03083, Zbl 798#03042)

  32. C. Calude. Algorithmic complexity: A topological point of view, Singularité 2, 10 (1991), 28-29. [with a comment and a list of open problems due to the editor] (in French)

  33. C. Calude. Relativized topological size of sets of partial recursive functions, Theoret. Comput. Sci. 87 (1991), 347-352. (MR 92h: 03060, Zbl 814#0303)

  34. C. Calude, G. Istrate. Determining and stationary sets for some classes of partial recursive functions, Theoret. Comput. Sci. 82 (1991), 151-155. (MR 92g: 03065, Zbl 723#03024)

  35. C. Calude, Lila Sântean. On a theorem of Günter Asser, Z. Math. Logik Grundlang. Math. 36 (1990), 143-147. [with a comment by G. Asser] (MR 91h: 03049, Zbl 687#03019, 698#03031)

  36. C. Calude, Eva Kurta. On Kraft-Chaitin inequality, Rev. Roumaine Math. Pures Appl. 35 (1990), 597-604. (MR 92C: 94004, Zbl 731#68056)

  37. C. Calude, I. Chiescu. Qualitative properties of P. Martin-Löf random sequences, Boll. Unione Mat. Ital. VII, Ser. B3, 240 (1989), 229-240. (MR 91a: 68147, Zbl 674#03013)

  38. C. Calude, I. Chiescu. Upper limitation of Kolmogorov complexity and universal P. Martin-Löf tests, Journal of Computational Mathematics 1 (1989), 61-70. (MR 91a: 68147, Zbl 673#68028)

  39. C. Calude, S. Marcus. Sudan's recursive and non-primitive recursive function: a retrospective look, An. Univ. Bucureti, Mat.-Inf. 2 (1989), 25-30. (MR 92a: 03060, Zbl 741#03020)

  40. C. Calude, I. Chiescu. Random sequences: some topological and measure-theoretical properties, An. Univ. Bucureti, Mat.-Inf. 2 (1988), 27-32. (MR 89m: 60004, Zbl 688#60001)

  41. C. Calude, I. Chiescu. Random sequences according to P. Martin-Löf, Found. Control Engrg. 12, 3 (1987), 75-84. (MR 89e: 58059, Zbl 632#03041)

  42. C. Calude. Super-exponentials non-primitive, but rudimentary, Inform. Process. Lett. 25 (1987), 311-315. (MR 88j: 03026, Zbl 632#03036)

  43. C. Calude. Note on Ehrenfeucht's conjecture and Hilbert's basis theorem, EATCS Bull. 29 (1986), 18-22.

  44. . Buzeeanu, C. Calude. Functions having the graph in the n-th Grzegorczyk class, Found. Control Engrg. 11 (1986), 61-67. (MR 88f: 03034, Zbl 625#03020)

  45. C. Calude, I. Chiescu, L. Staiger. P. Martin-Löf tests: representability and embeddability, Rev. Roumaine Math. Pures Appl. 30 (1985), 719-732. (MR 88i: 68043, Zbl 587#03032)

  46. C. Calude, I. Chiescu. A combinatorial characterization of sequential P. Martin-Löf tests, Internat. J. Comput. Math. 17 (1985), 53-64. (Zbl 562#03020)

  47. C. Calude, M. Zimand. A relation between correctness and randomness in the computation of probabilistic algorithms, Internat. J. Comput. Math. 16 (1984), 47-53. (MR 86e: 68052, Zbl 552#68051)

  48. C. Calude, I. Chiescu. A class of universal P. Martin-Löf tests, EACTS Bull. 23 (1984), 15-22.

  49. C. Calude, I. Chiescu. Representability of recursive P. Martin-Löf tests, Kybernetika (Prague) 19 (1983), 526-536. (MR 85h: 03040, Zbl 529#03021)

  50. C. Calude. A simple non-uniform operation, EATCS Bull. 20 (1983), 40-46.

  51. C. Calude, Elena Calude. On some discrete metrics, Bull. Math. Soc. Sci. Math. R. S. Roumanie (N. S.) 27(75) (1983), 213-216. (MR 85f: 54057, Zbl 539#54019)

  52. C. Calude, Gh. Pun. Independent instances for some undecidable problems, RAIRO Inform. Theor. 17 (1983), 49-54. (MR 85d: 03087, Zbl 517#03022)

  53. C. Calude, Monica Ttrm. Universal sequences of primitive recursive functions, Rev. Roumaine Math. Pures Appl. 28 (1983), 381-389. (MR 85c: 03016, Zbl 535#03017)

  54. C. Calude, I. Chiescu. On representability of P. Martin-Löf tests, Kybernetika (Prague) 19 (1983), 42-47. (MR 85h: 03040, Zbl 529#03020)

  55. C. Calude. Topological size of sets of partial recursive functions, Z. Math. Logik Grundlang. Math. 28 (1982), 455-462. (MR 85i: 03134, Zbl 495#03022)

  56. C. Calude, I. Chiescu. On Per Martin-Löf random sequences, Bull. Math. Soc. Sci. Math. R. S. Roumanie (N.S.) 26 (74) (1982), 217-221. (MR 84g: 03073, Zbl 495#03026)

  57. C. Calude, I. Chiescu. Random strings according to A. N. Kolmogorov and P. Martin-Löf. Classical approach, Found. Control Engrg. 7 (1982), 73-85. (MR 84h: 60008, Zbl 521#03024)

  58. C. Calude, I. Chiescu. Strong noncomputability of random strings, Internat. J. Comput. Math. 11 (1982), 43-45. (MR 83h: 68066, Zbl 486#03026)

  59. C. Calude. Note on a hierarchy of primitive recursive functions, Rev. Roumaine Math. Pures Appl. 27 (1982), 935-936. (MR 85b: 03065, Zbl 495#03027)

  60. C. Calude, Elena Calude. A metrical method for multicriteria decision making, St. Cerc. Mat. 34 (1982), 223-234. (in Romanian) (Zbl 523#90004)

  61. C. Calude, Gh. Pun. On the adequacy of a grammatical model of the brain,  Rev. Roumaine Ling. 27 (1982), 343-351. (Romanian Contributions to the XIII-th International Congress of Linguistics, Tokyo, 1982, Section Linguistics and the Computer)

  62. M. Andraiu, C. Calude, Gh. Pun. Possibilities of multicriteria decision making, St. Cerc. Mat. 34 (1982), 87-103. (in Romanian) (Zbl 505#90004)

  63. C. Calude, V. Vieru. An iterative normal form for the partial recursive functions, Found. Control Engrg. 6 (1981), 133-144. (MR 85b: 03064, Zbl 503#68034)

  64. C. Calude, Gh. Pun. Global syntax and semantics for recursively enumerable languages, Fund. Inform. 4 (1981), 245-254. (MR 83h: 68133, Zbl 473#68068)

  65. C. Calude. Darboux property and primitive recursive functions, Rev. Roumaine Math. Pures Appl. 26 (1981), 1187-1192. (MR 84h: 03100, Zbl 481#03028)

  66. C. Calude, V. Vieru. A note on Knuth's iterated powers, An. tiin. Univ. ``Alex.I.Cuza'', Iai, Sect. I Mat. 27 (1981), 253-255. (MR 84m: 03062, Zbl 473#03035)

  67. C. Calude, Elena Calude. On the ``rationality'' of Onicescu's method for multicriteria making, Rev. de Statistic 30 (1981), 58-60. (in Romanian)

  68. C. Calude, S. Marcus. Man-computer communication, Rev. Roumaine Ling. 26 (1981), 103-112.

  69. C. Calude, Gh. Pun. The absence of contextual ambiguities in programming languages, Rev. Roumaine Ling. Cahiers Ling. Theor. Appl. 18 (1981), 91-110.

  70. M. Andraiu, C. Calude, Gh. Pun. Some extensions of the multicriteria decision problem, Rev. de Statistic 29 (1980), 43-49. (in Romanian)

  71. C. Calude, S. Marcus, I. evy. Recursive properties of Sudan function, Rev. Roumaine Math. Pures Appl. 25 (1980), 503-507. (MR 81f: 03053, Zbl 444#03021)

  72. C. Calude, S. Marcus, I. evy. The first example of a recursive function which is not primitive recursive, Historia Math. 9 (1979),380-384. (MR 80i: 03053, Zbl 426#03042)

  73. C. Calude, V. E. Cznescu. On topologies generated by Moisil resemblance relations, Discrete Math. 25 (1979), 109-115. (MR 80i: 54003, Zbl 412#54010)

  74. C. Calude, S. Marcus, Gh. Pun. The universal grammar as a hypothetical brain, Rev. Roumaine Ling. 27 (1979), 479-489.

  75. C. Calude. Categorical methods in computability theory II, St. Cerc. Mat. 30 (1978), 361-383. (in Romanian) (MR 80m: 03110a, Zbl 405#03025)

  76. C. Calude. Categorical methods in computability theory I, St. Cerc. Mat. 30 (1978), 253-277. (in Romanian) (MR 80m: 03110b, Zbl 381#03028)

  77. C. Calude, Brândua Fântâneanu. On recursive, non-primitive recursive functions, Bull. Math. Soc. Sci. Math. R. S. Roumanie 22 (1978), 255-258. (MR 80b: 03052, Zbl 399#03025)

  78. C. Calude. On the category of recursive languages, Mathematica (Cluj) 19 (42), (1978), 29-32. (MR 80b: 03056, Zbl 384#03029)

  79. C. Calude. A grammatical construction of Gödel numberings, C. R. Acad. Sci. Paris Ser. I Math. 284 (1977), 525-526. (in French) (MR 55#87, Zbl 347#02026)

  80. C. Calude. On the compatibility between the analytic and generative hierarchies of formal languages, Rev. Roumaine Math. Pures Appl. 22 (1977), 437-439. (MR 56#7334, Zbl 358#68105)

  81. C. Calude. On some topological properties of semilattice ordered semigroups, Bull. Math. Soc. Sci. Math. R. S. Roumanie 19 (1976), 3-10. (MR 56#15523, Zbl 347#06020)

  82. C. Calude. An axiomatics for a deontic logic with an infinity of truth values, Rev. Roumaine Math. Pures Appl. 21 (1976), 267-273. (in French) (MR 53#7728, Zbl 347#02019)

  83. C. Calude. On the metrizability of a free monoid, Discrete Math. 16, 19 (1976), 307-310. (MR 58#22347, Zbl 337#68053)

  84. C. Calude. On contextual distances in mathematical linguistics, St. Cerc. Mat. 28(1976),31-35. (in Romanian) (MR 53#12092, Zbl 339#68050)

  85. C. Calude. Some arguments against the formal character of programming languages, Rev. Roumaine Ling. - Cahiers Ling. Theor. Appl. 13 (1976), 257-264. (in French)

  86. C. Calude, S. Marcus, I. evy. On recursive functions which are not recursive primitive, Rev. Roumaine Sci. Soc., Sér. Phil.-Logique 19 (1975), 185-188. (in French)

  87. C. Calude. A statistical experiment in Assembler 360, Cahiers Ling. Theor. Appl. 11 (1974), 219-230. (in French)

  88. C. Calude. On a class of distances in a free semigroup, Bull. Math. Soc. Sci. Math. R. S. Roumanie 17 (65) (1973), 133-143. (in French) (MR 51#7372, Zbl 302#68096)

  89. C. Calude. On some morphological aspects of the language Assembler 360, Cahiers Ling. Theor. Appl. 10 (1973), 153-162. (in French) (Zbl 281#68032)

7.2  Papers in Refereed Proceedings or Collections

  1. C.S. Calude, P.H. Hertling. Computable approximations of reals: An information-theoretic analysis, Extended abstract, Third International Conference on Information-Theoretic Approaches to Logic, Language, and Computation, Hsi-tou, Taiwan, The Centre for Research in Cognitive Science & Department of Psychology, National Chung Cheng University, Chiayi, 1998, 29-38.

  2. C. S. Calude, M. Lipponen. Computational complementarity and sofic shifts, in X. Lin (ed.). Theory of Computing 98, Proceedings of the 4th Australasian Theory Symposium, CATS'98, Springer-Verlag, Singapore, 1998, 277-290.

  3. C.S. Calude, P. Hertling, B. Khoussainov, Y. Wang. Recursively enumerable reals and Chaitin W numbers, in M. Morvan, C. Meinel, D. Krob (eds.). STACS'98, Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris,1998, Lectures Notes in Computer Science 1373, Springer-Verlag, Berlin, 1998, 596-606.

  4. C. Calude. Computability and information, in E. Craig (ed.). Routledge Encyclopedia of Philosophy, Routledge, London, 1998.

  5. C. Calude, E. Calude, B. Khoussainov. Deterministic automata: simulation, universality and minimality, Extended abstract, in S. Bozapalidis (ed.). Proceedings of the 3rd International Conference ``Developments in Language Theory'', Aristotel University of Thessaloniki, Thessaloniki, Greece, 1997, 519-520.

  6. C. Calude, J. Hromkovi. Complexity: A language-theoretic point of view, in G. Rozenberg, A. Salomaa (eds.). Handbook of Formal Languages, Vol. II, Springer-Verlag, Berlin, 1997, 1-60.

  7. C. Calude, H. Maurer, A. Salomaa. The Journal of Universal Computer Science and its applications to teaching, in G. Kadunz, H. Kautschitsch, G. Ossinmitz, E. Schneider (eds.). Trends und Perspectiven,\ Beiträge Zum 7. Internationalen Symposium Zur ``Didaktik der\ Mathematik'', Klagenfurt, 26-30 September 1994, Verlag Hölder-Pichler-Tempsky, Vienna, 1996, 255-261.

  8. C. Calude, S. Yu. Language-theoretic complexity of disjunctive sequences, in M. E. Houle, P. Eades (eds.), Proceedings CATS'96 (Computing: the Australian Theory Seminar), Melbourne, Australia, 29-39 January 1996, 175-179.

  9. C. Calude, M. Zimand. Effective category and measure in abstract complexity theory-extended abstract, Proceedings FCT'95, Lectures Notes in Computer Science 965, Springer-Verlag, Berlin, 1995, 156-171.

  10. C. Calude. What is a random string?-Extended Abstract, in W. Depauli-Schimanovich, E. Koehler, F. Stadler (eds.). The Foundational Debate, Complexity and Constructivity in Mathematics and Physics, Kluwer, Dordrecht, 1995, 101-113.

  11. C. Calude, D. I. Campbell, K. Svozil, D. tefnescu. Strong determinism vs. computability, in W. Depauli-Schimanovich, E. Koehler, F. Stadler (eds.). The Foundational Debate, Complexity and Constructivity in Mathematics and Physics, Kluwer, Dordrecht, 1995, 115-131.

  12. C. Calude, H. Maurer. Pocket mathematics, in Gh. Pun (ed.). Mathematical Aspects of Natural and Formal Languages, Scientific World, Singapore, 1994, 13-41.

  13. C. Calude, H. Jürgensen. Randomness as an invariant for number representations, in H. Maurer, J. Karhumäki, G. Rozenberg (eds.). Results and Trends in Theoretical Computer Science, Springer-Verlag, Berlin, 1994, 44-66. (Zbl 950 # 22464)

  14. C. Calude, A. Salomaa. Algorithmically coding the universe, in G. Rozenberg, A. Salomaa (eds.). Developments in Language Theory, World Scientific, Singapore, 1994, 472-492.

  15. C. Calude. Borel normality and algorithmic randomness, in G. Rozenberg, A. Salomaa (eds.). Developments in Language Theory, World Scientific, Singapore, 1994, 113-129.

  16. C. Calude, I. Chiescu. Complexity-source of randomness, Modern Problems in Mathematical Research, Vol.1, Bucharest University, Bucharest, 1990, 165-202. Also in C. Calude (ed.). How to Cope with Complexity, Ed. Academiei, Bucharest, 1993, 34-57. (in Romanian)

  17. C. Calude. Meanings and texts: An algorithmic metaphor, in M. Balat, J. Deledalle-Rhodes (eds.). Signs of Humanity, Mouton de Gruyter, 1992, 95-97.

  18. C. Calude. On B. Russell definition of mathematics, Proc. National Symposium Info-Iai'89, 52-59. (in Romanian)

  19. C. Calude, D. Vaida. Ehrenfeucht test set theorem and Hilbert basis theorem: a constructive glimpse, in A. Kreczmar, G. Mirkowska (eds.), Proc. Symposium Math. Found. Computer Sci. 1989, Lecture Notes Comput. Sci., 379, Springer-Verlag, Berlin, 1989, 177-184. (MR 90m: 68009, Zbl 732#03043)

  20. C. Calude, D. Vaida. Languages, effectivity and constructive mathematics, Proc. Second National Colloquium on Languages, Logic and Mathematical Linguistics, Braov, 1988, 47-57. (MR 90g: 03061, Zbl 667#03036)

  21. C. Calude. Romanian results in recursive function theory: 1927-1987, Proc. Computer Center Anniversary Symposium, Bucharest University, 1987, 16-22. (in Romanian)

  22. C. Calude, D. Vaida. Ehrenfeucht's property and constructivity, Proc. National Symposium Info-Iai'87, 1-16. (in Romanian)

  23. C. Calude, I. Chiescu, L. Staiger. P. Martin-Löf tests: representability and embeddability, Proc. National Symposium Info-Iasi'85, Vol.I, 80-88. (in Romanian)

  24. C. Calude. Dilemmas of computational complexity, in C. Iacob (ed.). Mathematics, Today and Tomorrow, Ed. Academiei, Bucharest, 1985, 63-73. (in Romanian)

  25. C. Calude, I. Chiescu. On a (too) general theory of random sequences, in M. G. Demetrescu, M. Iosifescu (eds.). Studies in Probability Theory and Related Topics, Papers in Honour of Octav Onicescu on His 90th Birthday, Nagard Publisher, 1983, 65-69. (MR 85m: 0005, Zbl 562#03021)

  26. C. Calude. On a class of independent problems related to Rice's theorem, Proc. National Symposium Info-Iai'83, 29-32. (in Romanian)

  27. C. Calude, Gh. Pun. On the adequacy of a grammatical model of the brain, in M. Drgnescu (ed.). Artificial Intelligence and Robotics, Ed. Academiei, Bucharest, 1983, 45-50. (in Romanian)

  28. C. Calude, Gh. Pun. The absence of contextual ambiguities in the programming languages Fortran and Assiris, in S. Marcus(ed.). Contextual Ambiguities in Natural and Artificial Languages, Vol. 2, Ghent, Belgium, 1983, 57-76.

  29. C. Calude, S. Marcus, Gh. Pun. Empirical Information and Theoretical Constructs in the Study of Needs II, in S. Marcus (ed.). Mathematical Methods in the Development Problematique, Ed. Academiei, Bucharest, 1982, 39-59. (in Romanian) (MR 83k: 92005)

  30. C. Calude, I. Chiescu. On Per Martin-Löf random sequences,Proc. National Symposium Info-Iai'81, 1-5. (in Romanian)

  31. C. Calude, V. Vieru. Knuth test on compiler efficiency, Proc. 4th International Conference on Control Systems and Computer Science, Bucharest, Politechnical Institute, Vol. IV, 1981, 113-115.

  32. C. Calude, Gh. Pun. An argument for the formal character of the programming language Fortran, in P. Miclu, S. Marcus (eds.). Sémiotique Roumaine, Bucharest University, 1981, 61-72.

  33. C. Calude, Mihaela Malia, On the category of ech topological spaces, in A. Czaszar(ed.). Topology, Vol. I, North-Holland, Amsterdam, l980, 225-232. (MR 82e: 54012, Zbl 444#54001)

  34. C. Calude, S. Marcus, Gh. Pun. The universal grammar as a hypothetical brain, Proc. Intern. Symposium on Mathematics in System Theory, Braov, 1978, 93-114. (Zbl 457#68093)

  35. C. Calude, Const. Calude. Mathematical modeling and systemic approach in juridical sciences, in M. Malia (ed.). Systems in Social Sciences, Ed. Academiei, Bucharest, 1977, 105-109. (in Romanian)

  36. C. Calude. Pompeiu's distance between closed sets, Symposium on Geometry and Global Analysis, Bucharest, 1973, Ed. Academiei, Bucharest, 281-288. (in Romanian) (MR 58#10123, Zbl 397#54015)

  37. C. Calude. Semiotic analysis of a morphological experiment in a programming language, in S. Chatman, U. Eco, J. M. Klinkenberg (eds.). Approaches to Semiotics, Proc. of the First Congress IAS, 1973, Mouton, The Hague, 1979, 433-436. (in French)

7.3  Non-refereed Papers

  1. C. Calude, M. Jalobeanu. The Journal of Universal Computer Science, PC Report, 34 (1995), 14-15. (in Romanian)

  2. C. Calude, H. Maurer, A. Salomaa. The Journal of Universal Computer Science, J. UCS, Vol. 0 (1994), 109-115.

  3. C. Calude. On a class of independent problems related to Rice theorem, ACM SIGACT News 15 (1983), 53-57. (Zbl 535#03020)

7.4  Monographs

  1. C. Calude. Information and Randomness - An Algorithmic Perspective, EATCS Monographs in Theoretical Computer Science 1, Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tokyo, Hong Kong, Barcelona, Budapest, 1994, 254 pp. (MR 96d: 68103, Zbl 950# 09877)

  2. C. Calude. Theories of Computational Complexity, Annals of Discrete Mathematics 35, North-Holland, Amsterdam, New York, Oxford, Tokyo, 1988, 500 pp. (MR 89g: 03057, Zbl 633#03034)

  3. C. Calude. Computational Complexity. Qualitative Aspects, Ed. tiinific i enciclopedic, Bucharest, 1982, 300 pp. (in Romanian) (Zbl 619#03029)

7.5  Textbooks

  1. C. Calude. True, but Unprovable, Ed. tiinific i enciclopedic, Bucharest, 1988, 110 pp. (in Romanian) (Zbl 654#03001)

  2. C. Calude, Gh. Pun. The Mathematical Model: Tool and Viewpoint, Ed. tiinific i enciclopedic, Bucharest, 1982, 140 pp. (in Romanian)

  3. C. Calude. What Are the Programming Languages?, Ed. tiinific i enciclopedic, Bucharest, 1978, 100 pp. (in Romanian)

7.6  Lecture Notes for Student Use

  1. C. Calude. Algorithmic Information Theory, Lecture Notes, The University of Western Ontario, London, 1992, 42 pp.

  2. C. Calude. Introduction to Computing. Lecture Notes for Mathematics Teachers, Bucharest University, Bucharest, 1988, 42 pp. (in Romanian)

  3. C. Calude. Theory of Algorithms. Recursiveness, Complexity and Constructivity, Bucharest University, Bucharest, 1987, 197 pp (first edition), 1988, 208 pp (second edition). (in Romanian)

  4. C. Calude, V. E. Cznescu. Introduction to Computing. Mathematical Logic Lecture Notes, Bucharest University, Bucharest, 1984, 96 pp. (in Romanian)

  5. C. Calude. Introduction to Computing. Laboratory Themes, Bucharest University, Bucharest, 1982, 66 pp. (in Romanian).

7.7  Proceedings Editor

  1. C.S. calude, J.L. Casti (eds.). Unconventional models of computation, Complexity, 1998, in press.

  2. C.S. Calude (ed.). Theoretical Computer Science-People and Ideas, Springer-Verlag, Singapore, 1998, 430 pp.

  3. C. Calude, H. Maurer, A. Salomaa (eds.), J.UCS-The Journal of Universal Computer Science, Vol. 2-1996, Springer, Berlin, 1998, 860 pp.

  4. C.S. Calude, J. Casti, M. Dinneen (eds.). Unconventional Models of Computation, Springer-Verlag, Singapore, 1998, viii + 416 pp.

  5. D. S. Bridges, C.S. Calude, M. Dinneen, B. Khoussainov (eds.). Proceedings of the First Japan-New Zealand Workshop on ``Logic in Computer Science''. J. UCS 3 (1997), 1134-1281.

  6. C. Calude, H. Maurer, A. Salomaa (eds.), J.UCS-The Journal of Universal Computer Science, Vol. 1-1995, Springer, Berlin, 1997, xxxvi + 830 pp.

  7. D. S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I. Witten (eds.). Combinatorics, Complexity, Logic, Proceedings of DMTCS'96, Springer-Verlag, Singapore, 1996, viii + 422 pp.

  8. C. Calude (ed.) The Finite, the Unbounded and the Infinite, Proceedings of the Summer School ``Chaitin Complexity and Applications'', Mangalia, Romania, 27 June - 6 July, 1995, J. UCS 2 (1996), 242-441.

  9. C. Calude, M. J. J. Lennon, H. Maurer (eds.). Salodays in Auckland, Proceedings, Auckland University, Auckland, 1994, 115 pp.

  10. C. Calude (ed.). How to Cope with Complexity, Ed. Academiei, Bucharest, 1993, 232 pp. (in Romanian)

  11. A. Atanasiu, C. Calude (eds.). Salodays in Theoretical Computer Science, Hyperion XXI Press, Bucharest, 1993, 150 pp.

  12. C. Calude, D. Chioran, M. Malia (eds.). New Information Technologies in Higher Education. Studies on the Introduction of New Information Technologies in Higher Education in the European Region, CEPES-UNESCO, Bucharest, 1989, 339 pp.

  13. C. Calude, I. Tomescu (eds.). Scientific Papers Published by the Mathematics Faculty Staff, Bucharest University, 1988, 474 pp. (in Romanian)

  14. C. Calude, C. Nstsescu (eds.). Scientific Papers Published by the Mathematics Faculty Staff, Bucharest University, 1984, 418 pp. (in Romanian)

7.8  Research Reports

  1. C.S. Calude, W. Merkle, Y. Wang, A Note on Pseudorandom Generators, CDMTCS Research Report 086, 1998, 8 pp.

  2. C.S. Calude, M. J. Dinneen. Breaking the Turing Barrier, CDMTCS Research Report 084, 1998, 5 pp.

  3. C.S. Calude, E. Calude, C. tefnescu. Computational Complementarity for Mealy Automata, CDMTCS Research Report 083, 1998, 12 pp.

  4. C.S. Calude, News from New Zealand (15); M. J. Dinneen. Group-Theoretic Methods for Designing Networks, CDMTCS Research Report 082, 1998, 8 pp.

  5. C.S. Calude and P.H. Hertling. Computable Approximations of Reals: An Information-Theoretic Analysis, CDMTCS Research Report 074, 1997, 10 pp.

  6. C.S. Calude and A. Nies. Chaitin W Numbers and Strong Reducibilities, CDMTCS Research Report 062, 1997, 8 pp.

  7. C.S. Calude, L. Priese and L. Staiger. Disjunctive Sequences: An Overview CDMTCS Research Report 063, 1997, 40 pp.

  8. C.S. Calude, P. Hertling, B. Khoussainov, Y. Wang. Recursively Enumerable Reals and Chaitin W Numbers, CDMTCS Research Report 055, 1997, 22 pp.

  9. C.S. Calude, E. Calude, B. Khoussainov. Finite Nondeterministic Automata: Simulation and Minimality, CDMTCS Research Report 054, 1997, 18 pp.

  10. C.S. Calude and M. Lipponen. Computational Complementarity and Sofic Shifts, CDMTCS Research Report 053, 1997, 13 pp.

  11. C. S. Calude. A Genius' story: Two books on Gödel, CDMTCS Research Report 039, 1997, 8 pp.

  12. C. S. Calude, P. H. Hertling, K. Svozil. Embedding Quantum Universes into Classical Ones, CDMTCS Research Report 036, 1997, 24 pp.

  13. C. S. Calude, P. H. Hertling, B. Khoussainov. Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?, CDMTCS Research Report 032, 1997, 8 pp.

  14. C. Calude, E. Calude, B. Khoussainov. Deterministic Automata: Simulation, Universality and Minimality, CDMTCS Research Report 025, 1996, 8 pp.

  15. C. Calude, F. W. Meyerstein. Is the Universe Lawful?, CDMTCS Research Report 021, 1996, 10 pp.

  16. C. Calude, E. Calude, K. Svozil, S. Yu. Physical versus Computational Complementarity I, CDMTCS Research Report 015, 1996, 24 pp.

  17. C. Calude. Algorithmic Information Theory: Open Problems, CDMTCS Research Report 014, 1996, 3 pp.

  18. C. Calude and C. Grozea. Kraft-Chaitin Inequality Revisited, CDMTCS Research Report 013, 1996, 5 pp.

  19. C. Calude, J. Hromkovi, Complexity: A Language-Theoretic Point of View, CDMTCS Research Report 009, 1995, 47 pp.

  20. G. J. Chaitin, A. Arslanov, C. Calude. Program-Size Complexity Computes the Halting Problem, Technical Report No 125, 1995, Department of Computer Science, The University of Auckland, New Zealand, 3 pp. Also, CDMTCS Research Report 008, 1995.

  21. C. Calude, S. Yu. Language-Theoretic Complexity of Disjunctive Sequences, Technical Report No 119, 1995, Department of Computer Science, The University of Auckland, New Zealand, 8 pp. Also, CDMTCS Research Report 007, 1995.

  22. C. Calude, I. Tomescu. Optimum Extendible Prefix Codes, Technical Report No 114, 1995, Department of Computer Science, The University of Auckland, New Zealand, 13 pp.

  23. C. Calude, T. Zamfirescu. The Typical Number is a Lexicon, Technical Report No 113, 1995, Department of Computer Science, The University of Auckland, New Zealand, 6 pp.

  24. C. Calude, T. Zamfirescu. Most Numbers Obey No Probability Laws, Technical Report No 112, 1995, Department of Computer Science, The University of Auckland, New Zealand, 4 pp.

  25. C. Calude, S. Marcus, D. tefnescu. The Creator Versus Its Creation. A Mathematical Exercise, Technical Report No 107, 1995, Department of Computer Science, The University of Auckland, New Zealand, 11 pp.

  26. C. Calude, D. I. Campbell, K. Svozil, D. tefnescu. Strong Determinism vs. Computability, Technical Report No 105, 1995, Department of Computer Science, The University of Auckland, New Zealand, 14 pp.

  27. C. Calude, H. Jürgensen. Randomness and Coding, Report No. 437, 1994, Department of Computer Science, The University of Western Ontario, London, Canada, 5 pp.

  28. C. Calude, I. Chiescu. Probabilities on the Space of Sequences, Technical Report No 103, 1994, Computer Science Department, The University of Auckland, New Zealand, 10 pp.

  29. C. Calude, M. Zimand. Effective Category and Measure in Abstract Complexity Theory, Technical Report 529, Department of Computer Science, University of Rochester, Rochester, NY, 1994, 17 pp.

  30. C. Calude, C. Câmpeanu. Are Binary Codings Universal? Technical Report No 98, 1994, Computer Science Department, The University of Auckland, New Zealand, 11 pp.

  31. C. Calude. Computability and Information, Technical Report No 96, 1994, Computer Science Department, The University of Auckland, New Zealand, 13 pp.

  32. C. Calude, H. Maurer. Pocket Mathematics, Technical Report No 90, 1994, Computer Science Department, The University of Auckland, New Zealand, 28 pp.

  33. C. Calude, H. Maurer, A. Salomaa. JUCS: The Journal of Universal Computer Science and Its Applications to Science and Engineering Technology, Technical Report No 91, 1994, Computer Science Department, The University of Auckland, New Zealand, 10 pp.

  34. C. Calude, M. Zimand. Baire Category Classification in Abstract Complexity Theory, Technical Report No 84, 1993, Computer Science Department, The University of Auckland, New Zealand, 18 pp.

  35. C. Calude. The Definition of Random Strings, Technical Report No 83, 1993, Computer Science Department, The University of Auckland, New Zealand, 18 pp.

  36. C. Calude, A. Salomaa. Algorithmically Coding the Universe, Technical Report No 81, 1993, Computer Science Department, The University of Auckland, New Zealand, 21 pp.

  37. D. S. Bridges, C. Calude. On Recursive Bounds for the Exceptional Values in Speed-up, Technical Report 93-78, 1993, Cornell University, Mathematical Sciences Institute, Ithaca, USA, 8 pp.

  38. C. Calude, H. Jürgensen. Randomness as an Invariant for Number Representations, Report No. 339, 1993, Department of Computer Science, The University of Western Ontario, London, Canada, 15 pp.

  39. C. Calude. Borel Normality and Algorithmic Randomness, Report No. 347, 1992, Department of Computer Science, The University of Western Ontario, London, Canada; revised form: Report No 66, 1993, Computer Science Department, The University of Auckland, New Zealand, 19 pp. [with a comment by G. J. Chaitin]

  40. C. Calude, H. Jürgensen, M. Zimand. The Set of Independent Statements Is Topologically Large, Report No. 338, 1992, Department of Computer Science, The University of Western Ontario, London, Canada, 11 pp.

  41. C. Calude, S. Marcus, Gh. Pun. Algorithmic Procedures and Operational Characterizations for Need Sets, in Mathematical Paths in the Study of Human Needs, HSDRGPID-46/UNUP-160, The United Nations University, Tokyo, 1980, 4-31.

  42. C. Calude, S. Marcus, Gh. Pun. The Universal Grammar as a Hypothetical Brain, RS - Bucharest University, 1980, 25 pp.

  43. C. Calude, S. Marcus, Gh. Pun. Empirical Information and Theoretical Constructs in the Study of Needs II. Effective Use of Need Sets; Applications to Medical Needs, RS - Bucharest University, 1979, 34 pp.

7.9  Refereed Abstracts

  1. C. Calude, E. Calude, B. Khoussainov, M. Lipponen. From complete to incomplete automata: Simulation, universality and minimality. Extended abstract, Philfest'97, Auckland, July 1997, Bull. Symbolic Logic, 7 (1998), in press.

  2. C. Calude. Do zeros of Riemann's zeta function form a random sequence?, in Ker-I Ko, A. Nerode, K. Weihrauch (eds.), Computability and Complexity in Analysis, Dagstuhl Seminar Report 176 (9717), April, 1997, 3.

  3. C. Calude, E. Calude, B. Khoussainov. Deterministic automata: simulation, universality and minimality, Proceedings of the 3rd International Conference ``Developments in Language Theory, Thessloniki, 1997, 7-8.

  4. C. Calude. Gödel's Incompleteness Theorem-An information-theoretic perspective, Bull. Symbolic Logic 1 (1995), 352.

  5. C. Calude. What is a random string?, in The Foundational Debate. Complexity and Constructivity in Mathematics and Physics-Abstracts, Institut Wiener Kreis, Wien, 1994, 1.

  6. C. Calude, H. Jürgensen. Randomness as an invariant for number representations, in W. Gasarch (ed.) 1994 Structures Conference Research Abstracts, Vol. IV, 14.

  7. D. S. Bridges, C. Calude. On Recursive bounds for the exceptional values in speed-up, in C. Calude, M. J. J. Lennon, H. Maurer (eds.). Salodays in Auckland, Proceedings, Auckland University, Auckland, 1994, 16-18; also in 1994 New Zealand Mathematics Colloquium, Abstracts, 14.

  8. C. Calude, H. Maurer. Pocket mathematics, in C. Calude, M. J. J. Lennon, H. Maurer (eds.). Salodays in Auckland, Proceedings, Auckland University, Auckland, 1994, 25-29.

  9. C. Calude, H. Maurer, A. Salomaa. JUCS: The Journal of Universal Computer Science and its applications to science and engineering technology, in C. Calude, M. J. J. Lennon, H. Maurer (eds.). Salodays in Auckland, Proceedings, Auckland University, Auckland, 1994, 30-32.

  10. C. Calude. Information and Randomness-An Overview, in K. Ambos-Spies, S. Homer, U. Schöning (eds.), Structure and Complexity, Dagstuhl Seminar Report 82 (9407), February, 1994, 8.

  11. C. Calude, M. Zimand. On three theorems in abstract complexity theory: a topological glimpse, Abstracts of the Second International Colloquium on Semigroups, Formal Languages and Combinatorics on Words, Kyoto University, Japan, 1992, 11-12. Also in A. Atanasiu, C. Calude (eds.). Salodays in Theoretical Computer Science, Hyperion XXI Press, Bucharest, 1993, 1-2.

  12. C. Calude. Recursive Baire Classification, Speedable Functions and Independent Statements, Mathematisches Forschungsinstitut Oberwolfach, Tagungsbericht 55/1990, Mathematisches Logik, 1990, 2.

  13. C. Calude, Eva Kurta. On Kraft-Chaitin inequality, Abstracts of Logic Colloquium'89, Berlin, 1989; also in J. Symbolic Logic 75(1992), 289.

  14. C. Calude, I. Chiescu. Random sequences: some topological and measure-theoretical properties, Constructive Newsletter 1 (1988), 8.

  15. C. Calude, Gh. Pun. Independent instances for some undecidable problems, J. Symbolic Logic 49(1984), 686.

  16. C. Calude, I. Chiescu. On a (too) general theory of random sequences, Abstracts Amer. Math. Soc. 3 (1982), 524.

  17. C. Calude, I. Chiescu. Strong noncomputability of random strings, Abstracts Amer. Math. Soc. 25 (1982), 528.

  18. C. Calude, Gh. Pun. Global syntax and semantics for recursively enumerable languages, Notices Amer. Math. Soc. 25 (1978), 361-362.

7.10  Other Contributions3

  1. C.S. Calude, M. J. Dinneen. Breaking the Turing barrier, NZ Science Monthly (1998), in press.

  2. C.S. Calude. Informatics in a quantum variant, Academica 6, 90 (1998), 31-32. (in Romanian)

  3. C. Calude. News from New Zealand - 15, EATCS Bull. 65 (1998), 53.

  4. C. Calude. News from New Zealand - 14, EATCS Bull. 64 (1998), 79-81.

  5. C. Calude. Foreword, in G. J. Chaitin. The Limits of Mathematics, Springer-Verlag, Singapore, 1997.

  6. C. Calude. News from New Zealand - 13, EATCS Bull. 63 (1997), 78-80.

  7. C. S. Calude. The future of programming languages, PC Report, 1998, in press. (in Romanian)

  8. C. Calude. News from New Zealand - 12, EATCS Bull. 62 (1997), 92-93.

  9. C. Calude. News from New Zealand - 11, EATCS Bull. 61 (1997), 40-43.

  10. C. Calude. News from New Zealand - 10, EATCS Bull. 60 (1996), 62-64.

  11. C. Calude. A virtual letter to Gr. C. Moisil, Academica 5 (65) (1996), 3. (in Romanian)

  12. C. Calude. News from New Zealand - 9, EATCS Bull. 59 (1996), 106-107.

  13. C. Calude. News from New Zealand - 8, EATCS Bull. 58 (1996), 91-94.

  14. C. Calude. News from New Zealand - 7, EATCS Bull. 57 (1995), 120-121.

  15. C. Calude. News from New Zealand - 6, EATCS Bull. 56 (1995), 71-73.

  16. C. Calude. Report on The International Symposium ``The Foundational Debate''. Complexity and Constructivity in Mathematics and Physics, Vienna, Austria, 15-17 September 1994. EATCS Bull. 55 (1995), 221-222.

  17. C. Calude. News from New Zealand - 5, EATCS Bull. 55 (1995), 108-110.

  18. C. Calude. News from New Zealand - 4, EATCS Bull. 54 (1994), 119-123.

  19. C. Calude. News from New Zealand - 3, EATCS Bull. 53 (1994), 157-158.

  20. C. Calude. News from New Zealand - 2, EATCS Bull. 52 (1994), 175-178.

  21. C. Calude. News from New Zealand - 1, EATCS Bull. 51(1993), 88-90.

  22. C. Calude, R. W. Doran. Does God play dice? EATCS Bull. 50(1993), 338-341.

  23. C. Calude. Review of G. J. Chaitin. Information-Theoretic Incompleteness, World Scientific, Singapore, 1992, in: EATCS Bull. 49(1993), 387-389.

  24. C. Calude. Mathematics at the end of the century, Academica 1, 14 (1991), 27. (in Romanian)

  25. C. Calude. Review of G. J. Chaitin. Algorithmic Information Theory, Cambridge University Press, 1987 in: Formal Aspects of Computing 1 (1989), 295-297.

  26. C. Calude. Review of D. Bridges, F. Richman. Varieties of Constructive Mathematics, Cambridge University Press, 1987 in: EATCS Bull. 34 (1988), 305-307.

  27. C. Calude, Elena Calude. Traps of the infinity in elementary mathematics, Gazeta Matematic XCII (1988), 63-64. (in Romanian)

  28. C. Calude. Review of M. Davis, E. J. Weyuker. Computability, Complexity and Languages, Academic Press, 1983 and D. J. Cooke, H. E. Benz. Computer Mathematics, Cambridge University Press, 1984 in: EATCS Bull. 28 (1986), 281-286.

  29. C. Calude. Mathematics and computers, Gazeta Matematic(PMMMI) 1(1986), 14. (in Romanian)

  30. C. Calude. Gödel's theorem, a limit of formalization?, The Book of Interferences, Ed. tiinific i enciclopedic, Bucharest, 1985, 63-68. (in Romanian)

  31. C. Calude, I. Chiescu, Gh. Pun, D. Vaida. Professor Solomon Marcus at the 60th birthday anniversary, Gazeta Matematic (PMMMI) 3-4 (1985), 179-181. (in Romanian)

  32. C. Calude. A student of Professor Moisil, Gazeta MatematicSeria A, LXIX (1974), 179-180. (in Romanian) (MR 49#4703)

7.11  Papers Submitted or in Preparation

  1. C.S. Calude, P. Hertling, B. Khoussainov, Y. Wang. Recursively enumerable reals and Chaitin W numbers, Theoret. Comput. Sci., submitted.

  2. C.S. Calude, E. Calude, B. Khoussainov. Finite nondeterministic automata: simulation and minimality, Theoret. Comput. Sci., submitted.

  3. C. Calude, H. Jürgensen, S. Legg. Solving finitely refutable mathematical problems.

  4. C. Calude, P. Hertling, H. Jürgensen, K. Weihrauch. Randomness on shift spaces.

  5. C. Calude, H. Jürgensen. Randomness preserving transformations.

8.  Graduate and Post-graduate Supervision

8.1  Post-Doctoral Fellows

  1. Dr. Richard Coles, research in Algorithmic Information Theory, March 1998 - May 1999.

  2. Dr. Peter Hertling, research in Algorithmic Information Theory, November 1996 - August 1998. Peter has got a visiting position with the Institute of Mathematics, Berkeley University, USA.

  3. Dr. Yongge Wang, research in Algorithmic Information Theory, February 1997 - December 1997. Yongge has got a post-doctoral position with the Department of Computer Science, University of Michigan, USA.

  4. Dr. Marjo Lipponen, research in the Theory of Automata and Applications to Quantum Mechanics and Quantum Computation, March 1997 - March 1998. Marjo has got an assisstant professorship position with the Department of Mathematics, Turku University, Finland.

8.2  Ph.D. Students

  1. Ayan Mahalanobis. Constructive Theory of Banach Algebras, Waikato University, New Zealand. (co-supervised with D. S. Bridges and  S. Reeves) (in progress)

  2. Robin Havea. Constructive Operator Theory on Hilbert Space, Waikato University, New Zealand. (co-supervised with D. S. Bridges and  S. Reeves) (in progress)

  3. Cristian Grozea. Non-Binary Codings, Bucharest University, Romania. (in progress)

  4. Chi-Kou Shu. Special Problems in Algorithmic Information Theory, The University of Auckland, New Zealand. (in progress)

  5. Asat Arslanov. Contributions to Algorithmic Information Theory, The University of Auckland, New Zealand. (in progress)

  6. Luminia Dediu. Recursive Methods in Algebra, Bucharest University, Romania. (in progress)

  7. Cezar Câmpeanu. Topological Methods in Complexity Theory, Bucharest University, Romania, 1995. He has currently a lectureship position with Bucharest University. He is currently a Post-Doctoral Fellow with the Department of Computer Science, The University of Western Ontario, London, Canada.

  8. Ileana Streinu. Grammatical Inference, Bucharest University, Romania, 1994. (co-supervised with S. Marcus and Gh. Pun) She has got a Ph.D. degree in Computer Science, Rutgers University, USA, 1994. She has currently a position with Smith College, Massachusetts, USA.

  9. Marius Zimand. Positive Relativizations and Baire Classification, Bucharest University, Romania, 1991. He has got also a Ph.D. in Computer Science from the University of Rochester, USA, 1996. Marius holds a position with the Georgia Southwestern College, Georgia, USA.

  10. Mihaela Malia. Learning Processes in Artificial Intelligence, Bucharest University, Romania, 1990. (co-supervised with S. Marcus) She has currently a lectureship position with Bucharest University.

  11. erban Buzeeanu. Degrees of Effectivity in Computation Theory: Recursive, Analytical and Combinatorial Aspects, Bucharest University, Romania, 1988. (co-supervised with S. Marcus and I. Tomescu) He had (until his death in November 1994) a lectureship position with Bucharest University.

  12. Nelu Dima. Contributions to Recursive Function Theory, Bucharest University, Romania, 1986. (co-supervised with C. Popovici)

  13. Monica Ttrm. Logical, Analytical and Generative Models in the Study of Languages, Bucharest University, Romania, 1984. (co-supervised with S. Marcus and Gh. Pun) She has currently a lectureship position with Bucharest University.

8.3  Masters Students

  1. Yongyi Hu. Information-Theoretic Incompleteness, The University of Auckland, New Zealand. (in progress)

  2. Gordon Alford. DNA Computation: From Turing Machines to H Systems, The University of Auckland, New Zealand, 1997. He is currently a Ph.D. student in Computer Science with Turku University, Finland.

  3. Ion Mndoiu. An Extension of Gács Reducibility Theorem, Bucharest University, Romania, 1992. He is a Ph.D. student in Computer Science, Georgia University, USA.

  4. Ion Macarie. Applications of Chaitin Complexity to Software Engineering, Bucharest University, Romania, 1991. He has got a Ph.D. degree in Computer Science, University of Rochester, USA, 1994. He has a position with Millennium Computer Corp., Rochester, USA.

  5. Nicolae Du. Representable P. Martin-Löf Tests, Bucharest University, Romania, 1991. He has got a Master Degree in Applied Mathematics, Université Paris-Sud, France, 1994. He is currently a Ph.D. student in Computer Science, Iowa State University, USA.

  6. Ana-Maria Sljean (Mandache). Kraft-Chaitin Inequality and Applications in Computer Algebra, Bucharest University, Romania, 1989. She has got a Ph.D. degree in Computer Science from RISC, Johanes Kepler University, Austria. Ana-Maria is currently with the Computer Science Department, Bucharest University.

  7. Eva Kurta. An Extension of Kraft-Chaitin Theorem, Bucharest University, Romania, 1989.

  8. Cezar Câmpeanu. Variants of Post Correspondence Problem, Bucharest University, Romania, 1988. See his current status in the list 8.2.

  9. Lila Sântean (Kari). Hierarchies of Primitive Recursive String-Functions, Bucharest University, Romania, 1987. She has got a Ph.D. degree from Turku University, Finland, 1991. She has currently a position with the University of Western Ontario, London, Canada.

  10. Marius Zimand. Complexity of Probabilistic Algorithms, Bucharest University, Romania, 1983. (co-supervision with D. Vaida) See his current status in the list 8.2.

  11. Valentin Vieru. Recursion and Iteration. Efficient Translations, Bucharest University, Romania, 1981. He is currently with Architecture, Toronto, Canada.

  12. Brâdua Fântâneanu. Recursive and Non-Primitive Recursive Functions, Bucharest University, Romania, 1978.

8.4  Other Supervisions

  1. Terry Chiou (1998): An infrastructure for testing computational complementarity using Java aglets, The University of Auckland, New Zealand. (co-supervision with R. Nicolescu)

  2. Gerard P. Atkinson (1997-8): Information-Theoretic Incompleteness, The University of Auckland, New Zealand.

  3. Gordon Alford (1996): Modeling DNA Computation, The University of Auckland, New Zealand. Gordon is currently a Ph.D. student with TUCS, Turku University, Finland.

  4. Luminia Dediu (1990-1994): Constructive Algebra. She has currently a lectureship position with the University ``Dunrea de Jos'', Galai, Romania.

  5. Gabriel Istrate (1988-1992): Topological Methods in Recursive Function Theory. He is currently a Ph.D. student at the University of Rochester, USA.

  6. Gabriel Ciobanu (1988-1991): Programming Logic. He has got a Ph.D. degree from the University ``Alex.I.Cuza'', Iai, Romania, 1990; he is an associate professor of computer science at the University ``Alex.I.Cuza''.

  7. Viorel Vâjâitu (1981-1982): Exotic Numeration Systems. He has got a Ph.D. degree from the Institute of Mathematics, Romanian Academy. He has a research position with the Institute of Mathematics.

  8. Daniel Naie (1985-1986): Equations on Free Monoids. He has got a Ph.D. degree from the University Paris XI, Orsay, France, 1994. He holds an associate-professorship position with the University Paris XI, France.

  9. Victor Vianu (1975-1976): Metrics on Free Monoids. He received his Ph.D. from the University of Southern California, San Diego, where he is currently professor of computer science.

8.5  Reader of Ph.D. and Masters Theses

  1. John Pearson. Heuristic Search in Route Finding, University of Auckland, New Zealand, 1998 (Masters Thesis).

  2. Robin Siale Havea. Constructive Operator Theory on Hilbert Space, Waikato University, Hamilton, New Zealand, 1998 (Masters Thesis).

  3. Yuchuan Wang. Constructive Theory of Partial Differential Equations, Waikato University, Hamilton, New Zealand, 1996 (Ph.D. Thesis).

  4. Robert Blandford. Type Algebra, University of Auckland, New Zealand, 1996 (Masters Thesis).

  5. Hacic-Cristian Kevorchian. Reasoning by Analogy and Applications to Automated Theorem-Proving, Bucharest University, Romania, 1995 (Ph.D. Thesis).

  6. Klaus-Hilmar Sprenger. Hierarchies of Primitive Recursive Functions on Term Algebras, Universität-GH-Siegen, Germany, 1995 (Ph.D. Thesis).

  7. Rodica Ceterchi. Topology, Categories, Learning, Bucharest University, Romania, 1992 (Ph.D. Thesis).

9.  Lectures at Conferences (Some Invited)

  1. Computable approximations of reals: An information-theoretic analysis, Third International Conference on Information-Theoretic Approaches to Logic, Language, and Computation, Hsi-tou, Taiwan, 1998.

  2. Recursively enumerable reals and Chaitin W numbers, STACS'98, The 15th Annual Symposium on ``Theoretical Aspects of Computer Science'', Paris, January 1998.

  3. Chaitin W Numbers and Strong Reducibilities, The First Japan-New Zealand Workshop ``Logic in Computer Science'', CDMTCS, Auckland, August 1997.

  4. Computational Complementarity via Incomplete Automata and Shift Spaces, International Conference ``Integrability and Chaos in Discrete Systems'', International Solvay Institutes, Brussels, Belgium, July 1997. (invited lecture)

  5. Deterministic automata: simulation, universality and minimality, ``Developments in Language Theory'', DLT'97, Thessaloniki, Greece, July 1997.

  6. Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?, Schloss Dagstuhl Seminar on ``Constructivity and Complexity in Analysis'', Dagstuhl, Saarbrücken, Germany, April, 1997. (invited lecture)

  7. Automata for Physics, Workshop ``Computability and Related Matters in Mathematics and Physics'', CDMTCS, Hamilton, February 1997.

  8. Recollections on Paul Erdös, Paul Erdös Mini-Seminar, Auckland University, New Zealand, September, 1996.

  9. The Typical Number Is a Lexicon, AFL'96 (8th Conference on Automata and Formal Languages), Salgotarjan, Hungary, July 1996.

  10. The Concept of Complexity, Seminar ``Order, Complexity and Beauty'', The Project ``Third Culture Copenhagen'', Danish Mindship Foundation, Copenhagen, Denmark, July, 1996. (invited lecture)

  11. The Web Attitude, Graduate Student Workshop, Auckland University, New Zealand, March, 1996.

  12. A Virtual Letter to Gr. C. Moisil, Symposium Dedicated to Gr. C. Moisil, Romanian Academy, Bucharest, Romania, March, 1996.

  13. Language-Theoretic Complexity of Disjunctive Sequences, CATS'97 (Computing: the Australian Theory Seminar), Melbourne, Australia, January, 1996.

  14. Can Ignorance Help?, Ken Ashton Mini-Conference, Auckland University, New Zealand, July, 1995.

  15. Randomness-Preserving Transformations, Summer School ``Chaitin Complexity and Applications'', Black Sea University, Mangalia, July 1995.

  16. JUCS: A New Publication in Cyberspace, ``ROSE'94'', The Second Romanian Conference on Open Systems, Bucharest, Romania, November, 1994.

  17. What Is a Random String?, Symposium ``The Foundational Debate. Complexity and Constructivity in Mathematics and Physics'', Vienna, Austria, September, 1994. (plenary invited address)

  18. Gödel's Incompleteness Theorem-An Information-Theoretic Perspective, ``1994 George Hughes Memorial Conference'', Australasian Association for Logic, Dunedin, New Zealand, August, 1994.

  19. Randomness as an Invariant for Number Representations, Symposium ``Results and Trends in Theoretical Computer Science'', Graz, Austria, June, 1994. (invited lecture)

  20. Experimental Mathematics, Symposium ``Romania and Romanians in Contemporary Science'', Sinaia, Romania, June, 1994. (invited lecture)

  21. The Basics of LATEX, A Half-Day Course ``Getting Started with LATEX'', Auckland University, New Zealand, May, 1994.

  22. On Recursive Bounds for the Exceptional Values in Speed-up, 1994 N. Z. Mathematics Colloquium, Hamilton, New Zealand, April, 1994.

  23. Pocket Mathematics, Symposium ``Salodays in Auckland'', Auckland University, New Zealand, March, 1994.

  24. Information and Randomness-An Overview, Schloss Dagstuhl Seminar on ``Structure on Complexity'', Dagstuhl, Saarbrücken, Germany, February, 1994. (invited lecture)

  25. Coding Without Tears, Symposium on Combinatorics, Algebra and Topology in Logic and Languages, Romanian Academy, Bucharest, Romania, January, 1994.

  26. Three Theories of Computational Complexity, ROSYCS'93, Iai, Romania, November, 1993. (invited lecture)

  27. More About the Halting Probability, Informatics Workshops 1993, University of Auckland, New Zealand, August, 1993.

  28. The Randomness Hypothesis, Conference ``Developments in Language Theory'', The University of Turku, Finland, July, 1993. (invited lecture)

  29. Borel Normality and Algorithmic Randomness, Conference ``Developments in Language Theory'', The University of Turku, Finland, July, 1993.

  30. How Should I Forget?, Symposium Dedicated to Gr. C. Moisil, Romanian Academy, Iai, Romania, May, 1993.

  31. Two Questions on Chaitin's Model of Randomness, Conference ``Does God Play Dice?'', The University of Auckland, New Zealand, February, 1993.

  32. Topological Methods in Complexity Theory, Computer Science Colloquium, Waikato University, Hamilton, New Zealand, February, 1993.

  33. Elementary Algorithmic Information Theory: Borel Normality and Algorithmic Randomness, Workshop on Semigroups, Formal Languages and Combinatorics on Words, Kyoto University, Japan, August, 1992.

  34. On Three Theorems in Abstract Complexity Theory: A Topological Glimpse, The Second International Colloquium on Words, Languages and Combinatorics, Kyoto University, Japan, August, 1992.

  35. Elementary Algorithmic Information Theory, Colloquium SALODAYS in Theoretical Computer Science, Bucharest University, Romania, June, 1992.

  36. Constructive Negligible Sets in Complexity Theory, Fifth International Conference on Discrete Mathematics, Dortmund, Germany, September, 1991. (invited lecture)

  37. Recursive Baire Classification, Speedable Functions and Independent Statements, Mathematical Logic Week, Oberwolfach, Germany, December, 1990. (invited lecture)

  38. The Development of Computer Science in Romania, Future Trends in Information Technology, Salzburg, Austria, September, 1990. (invited lecture)

  39. Determining and Stationary Sets for Some Classes of Partial Recursive Functions, Third Logical Biennial Summer School and Conference, Kleene'90, Varna, Bulgaria, June, 1990.

  40. Mathematics and Informatics: Some Lessons and Key Points of Reflection, International Workshop On Informatics Curricula for the 1990s, Providence, RI, USA, April, 1990.

  41. On Kraft-Chaitin Inequality, Logic Colloquium'89, European Summer Meeting of the Association for Symbolic Logic, West Berlin, Germany, July, 1989.

  42. Descriptive Complexity and Natural Languages, PROCOMP'89, Central Institute for Informatics, Bucharest, Romania, October, 1989. (invited lecture)

  43. Complexity as a Source of Randomness, Workshop ``How to Cope with Complexity'', Romanian Academy, Bucharest, Romania, October, 1989.

  44. On B. Russell Definition of Mathematics, National Colloquium Info-Iai'89, Romania, October, 1989. (invited lecture)  

  45. Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse, Symposium Mathematical Foundations of Computer Science, Porabka-Kozubnik, Poland, September, 1989.

  46. Languages, Effectivity and Constructive Mathematics, Second National Colloquium on Languages, Logic and Mathematical Linguistics, Brasov, Romania, June, 1988.

  47. Ehrenfeucht's Property and Constructivity, National Colloquium Info-Iai'87, Romania, October, l987. (invited lecture)

  48. Romanian Results in Recursion Function Theory: 1927-1987, Computer Center Anniversary Symposium, Bucharest University, Romania, February, 1987. (invited lecture)

  49. Super-exponentials Non-Primitive Recursive, but Rudimentary, Advanced International Summer School and Conference on Mathematical Logic and Its Applications, Gödel'86, Druzhba, Bulgaria, June, l986.

  50. P. Martin-Löf Tests: Representability and Embeddability, National Colloquium Info-Iai'85, Romania, October, 1985. (invited lecture)

  51. On a class of Independent Problems Related to Rice's Theorem, National Colloquium Info-Iai'83, Romania, October, 1983. (invited lecture)

  52. Dilemmas of Computational Complexity, Symposium ``Mathematics, Today and Tomorrow'', Romanian Academy, Bucharest, Romania, June, 1983. (invited lecture)

  53. Independent Instances for Some Undecidable Problems, Logic Colloquium'82, European Summer Meeting of the Association for Symbolic Logic, Florence, Italy, August, 1982.

  54. On Per Martin-Löf Random Sequences, Workshop On Recursion Aspects of Computer Science, Purdue University, USA, June, 1981.

  55. On Per Martin-Löf Random Sequences, National Colloquium Info-Iai'81, Romania, October, 1981.

  56. Knuth Test on Compiler Efficiency, The 4th International Conference on Control Systems and Computer Science, Politechnical Institute, Bucharest, Romania, July, 1981.

  57. The Universal Grammar as a Hypothetical Brain, International Symposium on Mathematics in System Theory, Braov, Romania, November, 1978.

  58. The Category of ech Topological Spaces, Colloquium on Topology, Budapest, Hungary, August, 1978.

  59. Pompeiu's Distance Between Closed Sets, Symposium on Geometry and Global Analysis, Romanian Academy, Bucharest, Romania, October, 1973.

10.  Invited Seminar Presentations

  1. Why Do We Believe in God? Three Non-Theological Arguments, Logic Group Seminar, Bucharest University, Romania, July, 1998.

  2. Symbolic Dynamics: Complexity, Entropy, Randomness, International Solvay Institutes, Brussels Free University, Brusssels, Belgium, June 1998.

  3. Complexity, Randomness, Independence and the Brain, Institute of Mathematics, Academia Sinica, Taipei, Taiwan, June 1998.

  4. Recursively Enumerable Reals: Computability, Complexity, Randomness, Department of Mathematics, Turku University and Turku Centre for Computer Science, Turku, Finland, March, 1998.

  5. Automata as Toy Models for Uncertainty, ``Séminaire Complexité'', Université Paris Sud, Orsay, France, February, 1998.

  6. Recursively Enumerable Reals: Computability, Complexity, Randomness, Bucharest University, Romania, February, 1998.

  7. The Cost of Forgetting: Quantum Computation, Romanian Academy, February, 1998 (plenary address to the Academy).

  8. Reversible Computation, University ``Dunrea de Jos'', Galai, Romania, February, 1998.

  9. New Trends in the Theory of Computation, National College ``V. Alecsandri'', Galai, Romania, February, 1998.

  10. A Brief Excursion in Algorithmic Information Theory, Babe-Bolyai University, Cluj, Romania, April, 1997.

  11. Automata for Physics, Department of Mathematics, University of Turin, Italy, April, 1997.

  12. Some Applications of Automata to Physics, Informal & Colloquial Talks, Department of Mathematics, University of Auckland, April, 1997.

  13. A Brief Excursion in Algorithmic Information Theory, University of Chicago, USA, January 1997.

  14. Minimal Universal Automata, Institute for Theoretical Physics, Technical University of Vienna, Austria, January 1997.

  15. Is the Universe Lawful?, Danish Mindship Foundation, Copenhagen, Denmark, July, 1996.

  16. Cyberspace, Bucharest University, Romania, July 1996.

  17. Is Computer Science a Science?, The University of Auckland, New Zealand, March 1996.

  18. Molecular Computation, Bucharest University, Romania, December 1995.

  19. Algorithmic Information Theory, Leeds University, England, November 1995.

  20. Disjunctive Sequences, The University of Western Ontario, London, Canada, November 1995.

  21. Randomness-Preserving Transformations, Hagen University, Germany, July 1995.

  22. Randomness-Preserving Transformations, Siegen University, Germany, July 1995.

  23. Understanding our Universe: Randomness vs. Constructivity, Gödel Society, Vienna, Austria, June 1995.

  24. What Is a Random String?, University Koblenz-Landau, Germany, January, 1995.

  25. Computability and Information, University of Waikato, Hamilton, New Zealand, November, 1994.

  26. Paradigms of Information, Technical University, Bucharest, Romania, October, 1994.

  27. Computability and Information, Lincoln University, Christchurch, New Zealand, September, 1994.

  28. Are Binary Codings Universal?, University of Canterbury, Christchurch, New Zealand, August, 1994.

  29. Computability and Information, University of Canterbury, Christchurch, New Zealand, August, 1994.

  30. Paper Computation vs. Real Computation, Otago University, Dunedin, New Zealand, August, 1994.

  31. Randomness as an Invariant for Number Representations, Victoria University of Wellington, New Zealand, August, 1994.

  32. Computability and Information, Victoria University of Wellington, New Zealand, August, 1994.

  33. Computability and Information, Massey University, Palmerston North, New Zealand, August, 1994.

  34. The Incompleteness Phenomenon: From Gödel to Chaitin, Institute for Theoretical Physics, Technical University of Vienna, Austria, June, 1994.

  35. Unimedia: An Overview, University ``Ovidius'' Constana, Romania, May, 1944.

  36. Statistics and Communication, Black Sea University, Mangalia, Romania, May, 1994.

  37. Information and Randomness-An Overview, University of Bucharest, Romania, February, 1994.

  38. Baire Category Classification in Abstract Complexity Theory, Seminario Matematico dell' Universitá e del Politecnico di Torino (Direttore: Professor Sergio Benenti), University of Turin, Italy, January, 1994.

  39. Information and Randomness-An Overview, University of Turin, Italy, January, 1994.

  40. Borel Normality and Algorithmic Randomness, Cornell University, Ithaca, USA, November, 1993.

  41. Invariants for Number Representations, The University of Toronto, Canada, October, 1993.

  42. Invariants for Number Representations, The University of Western Ontario, London, Canada, October, 1993.

  43. Fermat's Last Theorem, Romanian Academy, Romania, July, 1993.

  44. Mathematics, from Axiomatics and Algorithmics to Experimental, Bucharest University, Romania, July, 1993.

  45. Randomness as a Universal Invariant, Auckland University, New Zealand, June, 1993.

  46. Randomness as a Universal Invariant, University of Waikato, Hamilton, New Zealand, May, 1993.

  47. Three Theories of Computational Complexity, University of Waikato, Hamilton, New Zealand, May, 1993.

  48. Topological Methods in Complexity Theory, University of Waterloo, Canada, November, 1992.

  49. Random Sequences and Strings, Hamburg University, Germany, June, 1991.

  50. Random Strings and Sequences, Turku University, Finland, April, 1991.

  51. A Topological Analysis of Gödel Independent Statements, Turku University, Finland, April, 1991.

  52. Random Strings and Sequences, The University of Western Ontario, London, Canada, April, 1990.

  53. Algorithmic Randomness, Wesleyan University, Connecticut, USA, April, 1990.

  54. Complexity as a Source of Randomness, Bucharest University, Romania, November, 1988.

  55. Gödel's Theorem: A Limit of Formalization?, Institute of Atomic Physics, Mgurele, Romania, October, 1984.

  56. Kolmogorov Complexity and Applications, Babe-Bolyai University, Cluj, Romania, June, 1980.

11.  Interviews

  1. An interview with Professor Cristian Calude (interviewer: M. Jalobeanu), PC Report, 34 (1995), 16-17. (in Romanian)

  2. An interview with Professor Cristian Calude (interviewer: Irina Athanasiu), PC Report, 51 (1996), 18, 20. (in Romanian)

  3. R. Keenan. When a computing conference departs from the norm, Computerworld New Zealand 30 June (1997), 10; http://www.idg.co.nz.

  4. D. King. Scientists ponder future development of computers, NZ InfoTech Weekly, January 1998; http://www.nzcs.org.nz/news.htm.

  5. A. Gifford. Boffins seek quantum leap forward, NZ Herald 14 January 1998; http://www.cs.auckland.ac.nz/CDMTCS/docs/nzherald.pdf/.

  6. Reinventing the computer, Radio NZ, 27 July 1998 (interviewer: John Reynolds).

12.  Editorial Activity

  1. Book Series Editor: Discrete Mathematics and Theoretical Computer Science Series, Springer-Verlag, Singapore (from 1996 on).

  2. Editor-in-Chief, Journal of Universal Computer Science, Springer-Verlag (from 1994 on).

  3. Member of the Editorial Board of the following journals: Analele Universitii Bucureti, Matematic-Informatic (from 1988 on), Journal of Computing and Information (from 1995 on), Grammars (from 1997 on), Fundamenta Informaticae (from 1997 on).

  4. Associate-Editor, Handbook of Formal Languages, Springer-Verlag, Berlin, 1997.

13.  Conferences and Workshops

13.1  Programme Committee

  1. Molecular Computing, A Satellite Workshop to MFCS'98, Brno, Czech Republic, August, 1998.

  2. Randomized Algorithms, A Satellite Workshop to MFCS'98, Brno, Czech Republic, August, 1998.

  3. CATS'98 (Computing: the Australian Theory Seminar), Perth, Australia, January, 1998.

  4. Romanian Internet Learning Workshop (``Internet as a Vehicle for Teaching''), Ilieni, Romania, June 1997.

  5. ACSC'97 (Twentieth Australasian Computer Science Conference), Sydney, Australia, February, 1997.

  6. CATS'97 (Computing: the Australian Theory Seminar), Sydney, Australia, January, 1997.

  7. International Conference DMTCS'96, Discrete Mathematics and Theoretical Computer Science, Auckland, New Zealand, December, 1996.

  8. Summer School ``Chaitin Complexity and Applications'', Black Sea University, Mangalia, July 1995.

  9. The 22nd International Colloquium on Automata, Languages, and Programming, ICALP'95, Szeged, Hungary.

  10. Symposium Salodays in Auckland, The University of Auckland, Auckland, New Zealand, 1994.

  11. The 9th Romanian Symposium on Computer Science'93, ROSYCS'93, Iai, Romania, 1993.

  12. National Colloquium Info-Iai, Romania, 1983, 1985, 1987, 1989.

13.2  Organising Committee

  1. DMTCS'99-CATS'99, The University of Auckland, Auckland, New Zealand, January 1999. (Chair)

  2. The First International Conference UMC'98, Unconventional Models of Computation, The University of Auckland, Auckland, New Zealand, July 1998. (Chair)

  3. The First Japan-New Zealand Workshop on Logic In Computer Science, The University of Auckland, Auckland, New Zealand, August 1997. (Co-chair)

  4. International Conference DMTCS'96, Discrete Mathematics and Theoretical Computer Science, Auckland, New Zealand, December, 1996. (Co-chair)

  5. Summer School ``Chaitin Complexity and Applications'', Black Sea University, Mangalia, July 1995. (Chair)

  6. Symposium Salodays in Auckland, The University of Auckland, Auckland, New Zealand, 1994. (Chair)

  7. Conference Does God Play Dice?, The University of Auckland, Auckland, New Zealand, 1993. (Chair)

  8. Symposium SALODAYS in Theoretical Computer Science, Bucharest University, Bucharest, Romania, 1992. (Co-chair)

  9. Workshop There Are Only 3000 Days Before the Year 2000, Romanian Academy, Bucharest, Romania, 1991. (Co-chair)

  10. Workshop on Mathematics and Computer Science Education for the 21th Century, Romanian Academy and CEPES-UNESCO, Bucharest, Romania, 1990. (Co-chair)

  11. Workshop How to Cope with Complexity, Romanian Academy, Bucharest, Romania, 1988. (Chair)

  12. Symposium on Mathematics and Computer Science dedicated to the 60th Birthday Anniversary of Professor Solomon Marcus, Bucharest University, Bucharest, Romania, 1985.

  13. Symposium on Human Needs (Project GPID), UNU, Tokyo and CEPES-UNESCO, Bucharest, Romania, 1980.

13.3  Session Chair

  1. ITALLC'98, Third International Conference on Information-Theoretic Approaches to Logic, Language, and Computation, Hsi-tou, Taiwan, June, 1998.

  2. CATS'96 (Computing: the Australian Theory Seminar), Melbourne, Australia, January, 1996.

  3. Open Problem Session, Summer School ``Chaitin Complexity and Applications'', Black Sea University, Mangalia, July 1995.

  4. Symposium Results and Trends in Theoretical Computer Science, Graz, Austria, June, 1994.

  5. Symposium Salodays in Auckland, The University of Auckland, Auckland, New Zealand, March, 1994.

  6. Section P4: Theory of Computer Science-Research & Teaching, Informatics Workshops 1993, University of Auckland, New Zealand, August, 1993.

  7. Section: Formalism and Software Engineering, 13th N.Z. Computer Society Conference, Auckland, New Zealand, August, 1993.

13.4  Research Seminars

  1. Complexity Theory, Bucharest University, Romania, 1980-1992.

  2. (jointly with B. Doran), DNA Computation, University of Auckland, New Zealand, 1995-1996.

  3. (jointly with B. Pavlov), Dynamical Systems, University of Auckland, New Zealand, 1997.

14.  External Evaluator

  1. Referee, Grant Agency, Academy of Sciences of the Czech Republic, Praha, Czech Republic, July 1998.

  2. Referee, Public Good Science Fund, Foundation for Research and Technology, Wellington, New Zealand, January 1998.

  3. Referee for the Appointment Committee for a Chair in Pure Mathematics, University of Canterbury, New Zealand, October 1997.

  4. Reviewer for the section Algebra, Logic & Foundations of the Report New Zealand Knowledge Base Profiles: The Mathematical Sciences,  The Royal Society of New Zealand,  1997.

  5. Referee for FCT'97 (Fundamentals of Computation Theory), Krakow, Poland, 1997.

  6. Referee for AFL'96 (8th Conference on Automata and Formal Languages), Salgotarjan, Hungary, 1996.

  7. Referee for the Appointment Committee for a Chair in Computer Science, University of Canterbury, New Zealand, May 1996.

  8. Referee for CATS'96 (Computing: the Australian Theory Seminar), October, 1995.

  9. External referee for the Standing Committee of Senate, University of Manchester, United Kingdom, August, 1995.

  10. Member, Marsden Fund Selection Panel, Foundation for Research and Technology, Wellington, New Zealand, July 1995.

  11. External referee for the Collegiate Personnel Committee, University of Massachusetts, Boston, Ma., USA, May 1995.

  12. Referee for Revue Roumaine de Mathématiques Pures et Appliquées, Bulletin Mathématique de la Societé Mathématique de Roumanie, Studii i Cercetri Matematice, Kybernetika, Theoretical Computer Science, Notre Dame Journal of Formal Logic, Complexity, Theory of Computing Systems, Soochow Journal of Mathematics.

  13. Reviewer for Mathematical Reviews (from 1976 on), Zentralblatt für Mathematik (from 1979 on), Computing Reviews (from 1983 on).

  14. Referee for the publishing houses Academiei, and tiinific, (Romania), Springer-Verlag (Heidelberg), Scientific World (Singapore).

  15. External adviser for Computer Science (Artificial Intelligence, Education), CEPES-UNESCO, Bucharest, Romania, 1988-1992.

15.  Professional Societies

  1. American Mathematical Society, from 1976 on.

  2. Romanian Mathematical Society, from 1976 to 1990.

  3. European Association for Theoretical Computer Science, from 1983 on.

  4. New Zealand Computer Science Society, from 1993 to 1995.

  5. New Zealand Mathematical Society, from 1993 on.

  6. European Association for Computer Science Logic, from 1994 on.

  7. Kurt Gödel Society, from 1996 on.

  8. European Mathematical Society, from 1997 on.

  9. The Royal Society of New Zealand, from 1997 on.

  10. External collaborator, Center for Higher Education (CEPES), UNESCO, from 1988 to 1992.

  11. Member, International Scientific Council, Black Sea University, Bucharest, Romania, 1994 on.

  12. Member, New York Academy of Sciences, 1994-1996.

  13. Member of the Council of the European Association for Theoretical Computer Science, 1995-2000.

16.  Special Recognition

  1. Mathematical Student Prize, Faculty of Mathematics, Bucharest University, Romania, 1975.

  2. Computing Reviews Award, Association for Computing Machinery, New York, USA, 1986.

  3. Gheorghe Lazr Mathematics Prize, Romanian Academy, Romania, 1988.

  4. 1994 New Zealand Computer Science Visiting Lecturer.

17.  Selected Citations

  1. D. S. Alberts, T. J. Czerwinski (eds.). Complexity, Global Politics, and National Security, National Defense University, Washington, D. C., 1997.

  2. G. Alford. An explicit construction of a universal extended H system, in C. S. Calude, J. Casti, M. J. Dinneen (eds.). Unconventional Models of Computation, Springer-Verlag, Singapore, 1998, 108-117.

  3. I. Antoniou, B. Pavlov, A. Yafyasov. Quantum electronic devices based on metal-dielectric transition in low-dimensional quantum structures, in D. S. Bridges, C. Calude, J. Gibbons, S. Reeves, I. Witten (eds.). Combinatorics, Complexity, Logic, Proceedings of DMTCS'96, Springer-Verlag, Singapore, 1996, 90-104.

  4. A. Arslanov. On a Conjecture of M. Van Lambalgen, EATCS Bull. 62 (1997), 195-198.

  5. E. Bach, J. Shallit. Algorithmic Number Theory, Vol. I: Efficient Algorithms, MIT Press, Cambridge, Massachusetts, 1996.

  6. J. Barrow. Impossibility-The Limits of Science and the Science of Limits, Oxford University Press, Oxford, 1998.

  7. D. S. Bridges. Constructive mathematics and unbounded operators-a reply to Hellman, J. Philosophical Logic 24 (1995), 549-561.

  8. D. S. Bridges. Computability-A Mathematical Sketchbook, Springer Verlag, Berlin, 1994.

  9. E. Calude and M. Lipponen. Minimal deterministic incomplete automata, J. UCS 11 (1997), 1180-1193.

  10. C. Câmpeanu, Random numbers are Borel normal, EATCS Bull. 58 (1996), 155-158.

  11. G. J. Chaitin. The Limits of Mathematics, Springer-Verlag, Singapore, 1997.

  12. G. J. Chaitin. The Berry paradox, Complexity, 1(1995), 26-30.

  13. G. J. Chaitin. On the number of N-bit strings with maximum complexity, Applied Mathematics and Computation 59(1993), 97-100.

  14. G. J. Chaitin. The Limits of Mathematics, IBM Watson Center, Yorktown Heights, July 17, 1994, 326 pp.

  15. G. J. Chaitin. The Limits of Mathematics (in C), IBM, Watson Center, Yorktown Heights, April 27, 1994, 67 pp.

  16. F. Diacu. The solution of the N-body problem, The Mathematical Intelligencer 18, 3 (1996), 66-70.

  17. J. H. Dawson, Jr. Prelude to recursion theory: The Gödel-Herbrand correspondence, in Z. W. Wolkowski (ed.). First International\ Symposium on Gödel's Theorems, World Scientific, Singapore, 1993, 1-13.

  18. J. H. Dawson, Jr. Logical Dilemmas. The Life and Work of\ Kurt Gödel, A K Peters, Wellesley, Massachusetts, 1997.

  19. N. Du. Representability and embeddability of P. Martin-Löf tests, Stud. Cercet. Mat. 47 (1995), 245-262.

  20. H.-A. Esbelin and M. More. Rudimentary relations and primitive recursion: A toolbox, Theoretical Computer Science, 193(1-2) (1998), 129-148.

  21. F. Geurts. Compositional Analysis of Iterated Relations: Dynamics and Computations, PhD Thesis, Université Catholique de Louvain, March 1966.

  22. J. Gruska. Foundations of Computing, Thomson International Computer Press, Boston, 1997.

  23. T. Head, Gh. Pun, D. Pixton. Language theory and molecular genetics, in G. Rozenberg, A. Salomaa (eds.). Handbook of Formal Languages, Vol. II, Springer-Verlag, Berlin, 1997, 295-360.

  24. P. Hertling. Disjunctive w-words and real numbers, J. UCS 2 (1996), 549-568.

  25. P. Hertling and Y. Wang. Invariance properties of random sequences, J. UCS 12 (1997), 1241-1249.

  26. H. Jürgensen, L. Robbins. Towards foundations of cryptography: Investigation of perfect secrecy, J. UCS 5(1996), 347-379.

  27. B. Khoussainov. Randomness, computability, and algebraic specifications, in J. Harland (ed.). Proceedings of CATS'97, Australian Computer Science Communications, vol. 19, no 2, 1997, 96-102.

  28. M. Kummer. On the complexity of random strings, in C. Puech, R. Reischuk (eds.). Proceedings of STACS'96, Lecture Notes in Comput. Sci. 1046, Springer-Verlag, Berlin, 1996, 25-38.

  29. M. Kummer. Kolmogorov complexity and instance complexity of recursively enumerable sets, SIAM J. Comput. 25 (1996), 1123-1143.

  30. M. Li, P. M. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications, Springer Verlag, Berlin, 1993.

  31. L. Longpré and V. Kreinovich. Zeros of Riemann's Zeta function are uniformly distributed, but not random: An answer to Calude's open problem, EATCS Bull. 59(1996), 163-164.

  32. L. Longpré and V. Kreinovich. Human visual perception and Kolmogorov complexity: revisited, EATCS Bull. 64(1998), 155-158.

  33. S. Marcus. Semiotics and formal artificial languages, in A. Kent, J. G. Williams (Eds.). Encyclopedia of Computer Science and Technology, Marcel Dekker, New York, 1993, 363-376.

  34. S. Marcus. The status of research in the field of analytical algebraic models of language, in Carlos Martin Vide (eds.). Current Issues in Mathematical Linguistics, Elsevier, Amsterdam, 1994, 1-19.

  35. S. Marcus. Mental representations under some genuine restrictions: The conflictual sets, Caleç~ao Documentos, Serie Cognitiva-21, Instituto de Estudos Avançados, Universidade de S~ao Paulo, 1996, 74-79.

  36. S. Marcus. Contextual grammars and natural languages, in G. Rozenberg, A. Salomaa (eds.). Handbook of Formal Languages, Vol. II, Springer-Verlag, Berlin, 1997, 215-235.

  37. G. Markowsky. Introduction to algorithmic information theory, J. UCS 5(1996), 245-269.

  38. G. Markowsky. An introduction to algorithmic information theory. Its history and some examples, Complexity 2,4 (1997), 14-22.

  39. I. Mndoiu. Kraft-Chaitin's theorem for free-extensible codes, Stud. Cerc. Mat. 44 (1992), 497-501.

  40. I. Mndoiu. On a theorem of Gacs, Intern. J. Computer Mathematics 48 (1993), 157-169.

  41. Yu. V. Matiyasevich. Hilbert's Tenth Problem, MIT Press, Cambridge, Massachusetts, 1993.

  42. H. Maurer. Hyper-G Now Hyperwave. The Next Generation Web Solution, Addison-Wesley, New York, 1996.

  43. H. Maurer, K. Schmaranz. J. UCS - The next generation in electronic journal publishing,  J.UCS 0 (1994), 118-126.

  44. Doris Nolte, L. Priese. Abstract Fairness and Semantics, Universität Koblenz-Landau, Research Report 16-95, 16 pp.

  45. P. Odifreddi. Classical Recursion Theory, North-Holland, Amsterdam, New York, Oxford, Tokyo, Vol. 2, 1998, in press.

  46. B. Pavlov, G. Roach, A. Yafyasov. Resonance scattering and design of quantum gates, in C. S. Calude, J. Casti, M. J. Dinneen (eds.). Unconventional Models of Computation, Springer-Verlag, Singapore, 1998, 336-352.

  47. Gh. Pun. Distributed architectures in DNA computing based on splicing: limiting the size of components, in C. S. Calude, J. Casti, M. J. Dinneen (eds.). Unconventional Models of Computation, Springer-Verlag, Singapore, 1998, 323-335.

  48. G. Rozenberg, A. Salomaa. Cornerstones of Undecidability, Prentice Hall, Englewood Cliffs, 1994.

  49. S. Rudeanu. Lectures on Predicate and Propositional Calculi, Bucharest University Press, Bucharest, 1997. (in Romanian)

  50. A. M. Slgean-Mandache. A geometrical proof of Kraft-Chaitin theorem, An. Univ. Bucureti Mat. 39/40 (1990/91), no. 3, Matematic-Informatic, 90-97.

  51. M. Sipser. Introduction to the Theory of Computation, PWS Publishing, Comp., Boston, 1997.

  52. C. Smory\'nski. Logical Number Theory I. An Introduction, Springer-Verlag, Berlin, 1991.

  53. K. H. Sprenger. Hierarchies of Primitive Recursive Functions on Term Algebras, Shaker Verlag, 1995.

  54. K. H. Sprenger. Some hierarchies of primitive recursive functions, Mathematical Logic Quartly, 43 (1997), 251-286.

  55. L. Staiger. A Tight upper bound on Kolmogorov complexity by Hausdorff dimension and uniformly optimal prediction, Theory Comput. Systems, 31 (1998), 215-229.

  56. K. Svozil. Randomness & Undecidability in Physics, World Scientific, Singapore, New Jersey, Hong Kong, 1993.

  57. K. Svozil. On the computational power of physical systems, undecidability, the consistency of phenomena and the practical use of paradoxa, in Fundamental Problems in Quantum Mechanics, Baltimore, June 18-23, 1994.

  58. K. Svozil. Quantum Computation and Complexity Theory, Lecture Notes, University of Technology, Vienna, Wintersemester 1994/95, 51 pp.

  59. K. Svozil. A constructivist manisfesto for the physical sciences-constructive re-interpretation of physical undecidability, in W. Depauli-Schimanovich, E. Koehler, F. Stadler (eds.). The Foundational Debate, Complexity and Constructivity in Mathematics and Physics, Kluwer, Dordrecht, 1995, 65-88.

  60. K. Svozil. Halting probability amplitude of quantum computers, J. UCS, 1 (1995), 201-203.

  61. K. Svozil. Quantum information theory, J. UCS 5(1996), 311-346.

  62. K. Svozil. Undecidability everywhere?, in J. L Casti, A. Karlqvist (eds.). Boundaries and Barriers, Addison-Wiley, New York, 1996, 215-237.

  63. K. Svozil. The Church-Turing Thesis as a guiding principle for physics, in C. S. Calude, J. Casti, M. J. Dinneen (eds.). Unconventional Models of Computation, Springer-Verlag, Singapore, 1998, 371-385.

  64. K. Svozil. On self-reference and self-description, La Nuova Critica 29 (1997), 75-86.

  65. K. Svozil.Quantum Logic, Springer-Verlag, Singapore, 1998.

  66. I. Tomescu. On the asymptotic average length of a maximum common subsequence for words over a finite alphabet, Theoret. Computer Science 164(1996), 277-285.

  67. I. Tomescu. On words containing all short subwords, Theoret. Comput. Sci. 197 (1998), 235-240.

  68. I. Tomescu. A threshold property concerning words containing all short factors, EATCS Bull. 64 (1998), 166-170.

  69. V. A. Uspensky, A. Shen. Relations between varieties of Kolmogorov complexities, Math. Systems Theory 29 (1996), 271-292.

  70. K. Weihrauch. Random Real Numbers, Hagen University, Manuscript, January 1995, 11 pp.

  71. M. Zimand. If not empty, NP-P is topologically large, Theoret. Comput. Sci. 119 (1993), 293-310.

18.  Miscellanea Citations

  1. Steven Finch's ``Favorite Mathematical Constants: Chaitin's Constant'' at

    http://www.mathsoft.com/asolve/constant/chaitin/chaitin.html

  2. A bibliography on primality testing at

    http://math.uwaterloo.ca/shallit/bib/primes.bib

  3. Entropy in Logic and the Theory of Algorithms at

    http://www.unibas.ch/mdpi/entropy/.

  4. ``AT02.20 Theory of Computation'' at AIT is using Theories of Computational Complexity,

    http://cs.ait.ac.th/csinfo/courses.html.

  5. ``Complejidad Algoritmica'', ``Modelos de Informatica Teorica'' and ``Introduccion a la complejidad algoritmica'' at Universidad De Granada are using Theories of Computational Complexity:

    http://decsai.ugr.es/docencia/li_complejidad.html,
    http://decsai.ugr.es/castro/CA/node20.html.

  6. The book Information and Randomness is used for the following courses: Algorithmische Informationstheorie at the University of Ulm

    http://hermes.informatik.uni-ulm.de/ti/Lehre/WS9697/
    Informationstheorie/index.html

    by Prof. Dr. U. Schöning, Theoretische Informatik II\ Ausge\"wahlte Kapitel der Theoretischen Informatik at Martin-Luther-Universität Halle-Wittenberg

    http://www.mathematik.uni-halle.de/ fachschaft/ws96/theo1.html

    by Prof. Dr. L. Staiger.

  7. S. Wray. Evolutionary Computation, Masters Thesis, University of Victoria in Wellington,

    http://www.mcs.vuw.ac.nz/ stevew/thesis/.

  8. Lab 333, EE, NTU, Taiwan, bibliography on zero-knowledge at

    http://crypto.ee.ntu.edu.tw/lab333/tech-rep/crypto/zero_knowledge/

  9. Yonezawa Lab's WWW server, at the Department of Information Science of the University of Tokyo, bibliography in quantum computation at

    http://web.yl.is.s.u-tokyo.ac.jp/members/haruo/qc.html

  10. C. Herring. ``Books Recently Read'' at

    http://csl.ncsa.uiuc.edu/herring/books.html

  11. J. Borwein, P. Borwein, R. Girgensohn and S. Parnes. Experimental Mathematics: A Discussion at

    http://www.cecm.sfu.ca/organics/vault/expmath/expmath/html/expmath.html

  12. Standford University: ``Papers and Books for CS 446 and Beyond'' at

    http: //www-db.stanford.edu/pub/gio/CS446/biblio.html

  13. Bibliography on the Busy Beaver Problem at

    http://www.rpi.edu/ greeng3/interests/bb/bib/bib.html

  14. R. Greg Lavender. ``Recommended Reading'' at

    http://www.cs.utexas.edu/ users/lavender/reading.html

  15. Nagoya selected home-page at

    http://www.is.titech.ac.jp/labs/kobayasilab/ nagoya/URL-list.html

  16. Former students home-pages:
    G. Istrate at

    http://www.cs.rochester.edu/ users/grads/istrate/init.html

    I. Streinu at

    http://cs.smith.edu/ streinu/bookmarks.html

    Keith Wansbrough at

    http://www.dcs.gla.ac.uk/people/personal/ keithw/papers.html

    and P. Leung at

    http://www.interworld.com/ Staff/Patrick/varsity.htm.

  17. Presented in T h e R o y a l S o c i e t y o f N e w Z e a l a n d Science Digest: Science and Technology Alert 25: 17 April 1998. See http://www.rsnz.govt.nz/cgi-bin/new_news.p.

  18. Marjo Lipponen matematiikan väitöskirja vuoden 1996 paras Nevanlina-palkinto turkulaistutkijale, Turum Sanomat, 22 April 1998, p. 11

  19. Two books-C. Calude. Information and Randomness - An Algorithmic Perspective, Springer-Verlag, Berlin, 1994, and D. S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I. Witten (eds.). Combinatorics, Complexity, Logic, Proceedings of DMTCS'96, Springer-Verlag, Singapore, 1996)-have been included in Springer-Verlag selection Books in Complexity, March, 1998.

  20. L. Hemaspaandra and M. Ogihara. Reductions, Resources, and Robustness, http://www.cs.rochester.edu/u/lane/complexity.html.

  21. M. Gass' home-page at http://www.math.csbsju.edu/ mgass/info_theory/index.html.

Footnotes:

1 Current positions are emphasized.

2 First and unique Personal Chair in Computer Science at the University of Auckland.

3 More than 400 reviews for Mathematical Reviews, Zentralblatt für Mathematik and Computing Reviews.

File translated from TEX by TTH, version 1.1.