Cristian S. Calude
Calude in 2011
Born (1952-04-21) 21 April 1952
NationalityRomanian
Alma materUniversity of Bucharest
Known forAlgorithmic Information Theory and Quantum Theory contributions
Scientific career
FieldsMathematician
InstitutionsUniversity of Auckland, Academia Europaea
Thesis1977
Doctoral advisorSolomon Marcus
Websitecalude.net/cristianscalude/about/

Cristian Sorin Calude (born 21 April 1952) is a Romanian-New Zealander mathematician and computer scientist.[1]

Biography

After graduating from the Vasile Alecsandri National College in Galați, he studied at the University of Bucharest, where he was student of Grigore C. Moisil and Solomon Marcus.[2] Calude received his Ph.D. in Mathematics from the University of Bucharest under the direction of Solomon Marcus in 1977.[3]

He is currently chair professor at the University of Auckland,[4] New Zealand and also the founding director of the Centre for Discrete Mathematics and Theoretical Computer Science.[5] Visiting professor in many universities in Europe, North and South America, Australasia, South Africa, including Monbusho Visiting professor, JAIST, 1999 and visiting professor ENS, Paris, 2009, École Polytechnique, Paris, 2011; visiting fellow, Isaac Newton Institute for Mathematical Sciences, 2012; guest professor, Sun Yat-sen University, Guangzhou, China, 2017–2020; visiting fellow ETH Zurich, 2019. Former professor at the University of Bucharest. Calude is author or co-author of more than 270 research articles and 8 books,[6] and is cited by more than 550 authors.[7] He is known for research in algorithmic information theory, quantum computing, discrete mathematics and the history and philosophy of computation.[8]

In 2017, together with Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan, he announced an algorithm for deciding parity games in quasipolynomial time.[9] Their result was presented by Bakhadyr Khoussainov at the Symposium on Theory of Computing 2017[10] and won a Best Paper Award.[11]

Calude was awarded the National Order of Faithful Service in the degree of Knight[12] by the President of Romania, Mr. Klaus Iohannis, in June 2019.

In 2021, together with Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan, he won the EATCS Nerode Prize[13] for their quasipolynomial time algorithm for deciding parity games.

Distinctions and prizes

Selected bibliography

Articles

  • C. S. Calude, S. Jain, B. Khoussainov, W. Li, and F. Stephan. "Deciding parity games in quasi-polynomial time", SIAM Journal on Computing, (2020), STOC17-152—STOC17-188. doi:10.1137/17M1145288.
  • A. A. Abbott, C. S. Calude, M. J. Dinneen, R. Hua. "A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing", International Journal of Quantum Information 1950042-40 (2019). doi:10.1142/S0219749919500424.
  • A. A. Abbott, C. S. Calude, M. J. Dinneen, N. Huang. "Experimentally probing the algorithmic randomness and incomputability of quantum randomness", Physica Scripta, 94 (2019) 045103. doi:10.1088/1402-4896/aaf36a.
  • C. S. Calude, M. Dumitrescu. "A probabilistic anytime algorithm for the Halting Problem", Computability, 7 (2018) 259–271. doi:10.3233/COM-170073.
  • C. S. Calude, L. Staiger. "Liouville numbers, Borel normality and algorithmic randomness", Theory of Computing Systems, First online 27 April 2017. doi:10.1007/s00224-017-9767-8.
  • C. S. Calude, L. Staiger, F. Stephan. "Finite state incompressible infinite sequences", Information and Computation 247 (2016), 23–36. doi:10.1016/j.ic.2015.11.003.
  • C. S. Calude, G. Longo. "The deluge of spurious correlations in big data", Foundations of Science 22, 3, (2016), 595–612. doi:10.1007/s10699-016-9489-4.
  • A. Abbott, C. S. Calude, K. Svozil. "A variant of the Kochen-Specker theorem localising value indefiniteness", Journal of Mathematical Physics 56, 102201 (2015), doi:10.1063/1.4931658.
  • C. S. Calude, E. Calude, M. J. Dinneen. "Adiabatic Quantum Computing Challenges", ACM SIGACT News 46,1 (2015), 40–61. doi:10.1145/2744447.2744459.
  • A. Abbott, C. S. Calude, K. Svozil. "Value-indefinite observables are almost everywhere", Physical Review A 89, 3 (2014), 032109-032116. doi:10.1103/PhysRevA.89.032109.
  • C. S. Calude, M. J. Dinneen, M. Dumitrescu, K. Svozil. "Experimental evidence of quantum randomness incomputability", Physical Review A 82, 022102 (2010), 1–8. doi:10.1103/PhysRevA.82.022102.
  • C. S. Calude, M. A. Stay. "Most programs stop quickly or never halt", Advances in Applied Mathematics, 40 (2008), 295–308. doi:10.1016/j.aam.2007.01.001.
  • C. S. Calude, G. J. Chaitin. "Randomness everywhere", Nature 400, 22 July (1999), 319–320. doi:10.1038/22435.

Books

Notes

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.