Prof. Cristian S. Calude

Department of Computer Science

The University of Auckland, New Zealand

Professor

Email: cristian@cs.auckland.ac.nz

Qualifications

1977 Ph.D., University of Bucharest, Romania

1975 B.Sc., University of Bucharest, Romania

Publications (Selected)

1. C. S. Calude, E. Calude, M. J. Dinneen. Adiabatic quantum computing challenges, ACM SIGACT News 46, 1 (2015), 40-61.
2. S. Calude, D. Desfontaines, Universality and almost decidability, Fundamenta Informaticae 137 (2015), 1-8.
3. Abbott, C. S. Calude, K. Svozil, Value-inde_nite observables are almost everywhere, Physical Review A 89, 3 (2014), 032109-032116. DOI:10.1103/PhysRevA.89.032109.
4. Abbott, C. S. Calude, K. Svozil, A quantum random number generator certi_ed by value inde_niteness, Mathematical Structures in Computer Science 24, 3, (2014), e240303. DOI:10.1017/S0960129512000692.
5. S. Calude, E. Calude, Algorithmic complexity of mathematical problems: an overview of results and open problems, International Journal of Unconventional Computing 9(3-4) (2013), 327-343.
6. M. Burgin, C. S. Calude, E. Calude, Inductive complexity measures for mathematical problems, International Journal of Foundations of Computer Science 24, 4 (2013) 487-500.
7. S. Calude, E. Calude, M. S. Queen, Inductive complexity of the P versus NP problem, Parallel Processing Letters 23, 1 (2013), 1350007-1-1350007-16.
8. S. Calude, The halting problem, Canadian Mathematical Society Notes 45, 2, March-April (2013), 16-17.
9. H. Bailey, J. M. Borwein, C. S. Calude, M. J. Dinneen, M. Dumitrescu, A. Lee, An empirical approach to the normality, Experimental Mathematics 21, 4 (2012), 375-384.
10. Abbott, C.S. Calude, J. Conder, K. Svozil, Strong Kochen-Specker theorem and incomputability of quantum randomness, Physical Review A 86, 6 (2012), DOI 10.1103/Phys-RevA.86.062109.
11. S. Calude, B. S. Cooper, Introduction: computability of the physical, Mathematical Structures in Computer Science 22, 05 (2012), 723-728.
12. Abbott, C. S. Calude, Von Neumann normalisation of a quantum random number generator, Computability 1 (2012), 59-83.
13. S. Calude, E. Calude, M. S. Queen, The complexity of Euler's integer partition theorem Theoretical Computer Science 454 (2012), 72-80.
14. A. Abbott, M. Bechmann, C. S. Calude, A. Sebald, A nuclear magnetic resonance implementation of a classical Deutsch-Jozsa algorithm, International Journal of Unconventional Computing 8,2 (2012), 161-175.
15. Abbott, C. S. Calude, K. Svozil, On demons and oracles, Asia Paci_c Mathematics Newsletter 2,1 (2012), 9-15.
16. S. Calude, K. Salomaa, T. K. Roblot, State-size hierarchy for FS-complexity, International Journal of Foundations of Computer Science 23, 1 (2012) 37-50.
17. S. Calude, J. P. Lewis. Is there a universal image generator? Applied Mathematics and Computation 218 (2012), 8151-8159.
18. Akhtarzada, C. S. Calude, J. Hosking, A multi-criteria metric algorithm for recommender systems, Fundamenta Informaticae 110 (2011), 1-11.
19. S. Calude, K. Salomaa, T. K. Roblot, Finite state complexity, Theoretical Computer Science 412 (2011), 5668-5677.
20. S. Calude, A. Nies, L. Staiger and F. Stephan, Universal recursively enumerable sets of strings, Theoretical Comput. Sci. 412 (2011), 2253-2261.
21. S. Calude, M. Cavaliere, R. Mardare, An observer-based de-quantisation of Deutsch's algorithm, International Journal of Foundations of Computer Science 22, 1 (2011), 191-202.

Profile Details

www.cs.auckland.ac.nz/~cristian