POST-GRADUATE STUDENTS

Ph.D.  Students


-4. Richard Hua. Adiabatic Quantum Computing. (co-supervised with M.J. Dinneen). Started August 2017.
-3 Nan Huang. Certified Quantum Random Generators. (co-supervised with M.J. Dinneen and K. Svozil). Started October 2016.
-2. Alastair Abbott. Value Indefiniteness, Randomness and Unpredictability in Quantum Foundations, University of Auckland and Ecole Politechnique, Paris (co-supervised with Giuseppe Longo), 2015.
-1. Mike Stay. Higher Category Theory of Computation and Some Relationships with Physics, Topology and Logic, University of Auckland, 2015. (co-supervised with J. Baez)
0. Hector Zenil C.. Experimental AIT, Lille 1 University, France, 2011. (co-supervised with Jean-Paul Delahaye)
1. Nicholas J. Hay. Theoretical Agent Safety, University of Auckland.
2. Joshua Arulandham. Natural Algorithms--A New Theory of Computation, University of New Zealand, 2005. He is a professor at the Sri Krishna College of Engineering and Technology, India. (co-supervised with M.J. Dinneen)
3. Cristian Grozea. Non-Binary Codings, Bucharest University, Romania, 2003. He has a senior lectureship at Bucharest University.
4. Chi-Kou Shu. Computing Exact Approximations of a Chaitin Omega Number, University of Auckland, , 2004. (co-supervised with M.J. Dinneen) He is an assistant professor at China University of Technology, Taipei, Taiwan.
5. Asat Arslanov. Contributions to Algorithmic Information Theory, University of Auckland, 1998. Asat has got a senior position with ACC, Wellington, NZ.
6. Luminita Vita. Constructive Theory of Operator Algebras, University of Canterbury, New Zealand (co-supervised with D. S. Bridges), 2000. Luminita has currently an associate-professorship position with the University "Dunarea de Jos'', Galati, Romania.
7. Cezar Campeanu. Topological Methods in Complexity Theory, Bucharest University, Romania, 1995. After holding a Post-Doctoral Fellowship with the Department of Computer Science, University of Western Ontario, London, Canada,  a senior lectureship position with Bucharest University he is currently an assistant professor at the Prince Eduard Island University, Canada.
8. Ileana Streinu. Grammatical Inference, Bucharest University, Romania, 1994. (co-supervised with S. Marcus and Gh. Paun) Ileana has got a Ph.D. degree in Computer Science, Rutgers University, USA, 1994. Ileana is a Professor in the Department of Computer Science at the Smith College, Massachusetts, USA.
9. Marius Zimand. Positive Relativizations and Baire Classification, Bucharest University, Romania, 1991. He has got a Ph.D. in Computer Science from the University of Rochester, USA, 1996. Marius is an Associate Professors of Computer Science, Towson University, Towson, USA.
10. Mihaela Malita. Learning Processes in Artificial Intelligence, Bucharest University, Romania, 1990. (co-supervised with S. Marcus) She has currently a lectureship position with Saint Anselm College, Manchester, New Hampshire, USA.
11. Serban Buzeteanu. 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 senior lectureship position with Bucharest University.
12. Nelu Dima. Contributions to Recursive Function Theory, Bucharest University, Romania, 1986. (co-supervised with C. Popovici) He has a got a position with BEKO "Die Computer Leute", Vienna, Austria.
13. Monica Tataram. Logical, Analytical and Generative Models in the Study of Languages, Bucharest University, Romania, 1984. (co-supervised with S. Marcus and Gh. Paun) Monica is an Associate-Professors of Computer Science at the Bucharest University.

Honours and Masters Students

-17 Alexander Swain: Computability of Consciousness, Honours Thesis, 2019. (co-supervised with Fred Kroon)
-16 Wenhua Li: AIT Based Cryptography, Honours Thesis, 2019.
-15 Stefano Stollenwerk Cavallaro: Dyson Statements that Are Likely to Be True but Unprovable, Honours Thesis, 2019.
-14 Manuel Aguero : Quantum Random Generators, Honours Thesis, 2019.
-13 Daniel Britten: Absolutely Unprovable Statements in Coq, Honours Thesis, 2017-2018.
-12 Alec Henderson: Quantum Randomness Certified by Bell Theorem, Honours Thesis, 2017.
-11 Conor Clancy: The Data Processing Inequality, Honours Thesis, 2016.
-10. M. Fowler: Linguistic Models, Zipf's Law and Textual Stratification, MSc, 2013.
-9. M. Fowler: Simulation and Bounds of Finite-State Complexity, 2012. (Honours).
-8. A. Wilson: Primality and Tests of Randomness, 2012. (Honours).
-7. J. Bax: A Framework for Formal Proofs in Algorithmic Information Theory, 2011. (Honours).
-6. Ali Akhtarzada: Wiki Ratings: Algorithms, Design and Architecture, 2010. (co-supervised with J. Hosking)
-5. Alastair Abbott: Quantum Randomness: Certification and Generation, 2010.
-4. Tania Roblot: Finite-state descriptional complexity, 2010. (co-supervised with M. Dinneen)
-3. Alastair Abbott: De-quantising quantum algorithms, 2009. (Honours)
-2. Liam Fearnley: Accelerated Turing machines, 2009 (Honours).
-1. Tania Roblot: Finite-state descriptional complexity, 2009 (Honours). (co-supervised with A. Nies)
0. Nicholas J. Hay. Universal Semimeasures: An Introduction, University of Auckland, 2007. ((co-supervised with A. Nies)
1. Michael A. Stay. Truth and Light: Physical Algorithmic Randomness, University of Auckland, 2005.
2. Terrence Wilson Johnson. Finding the Shortest Average Path Lengths in Kleinberg's Small World Model, University of Auckland, 2005. (co-supervised with M. Dinneen)
3. Simona Dragomir. An Interpreter for Register Machine Programs, "Ovidius" University of Constanta, Romania, 2002. (co-supervised with M. Dinneen)
4. Qinghui Zeng. Randomness as an Invariant for Number Representations, University of Auckland, 2000. He has got a position with Pavilion Technology, Hamilton, New Zealand.
5. Peiming Liang. Randomness and Cellular Automata, University of Auckland, 2000.
6. Margaret Ng. A Metric Lexical Analysis, University of Auckland, New Zealand, 2000. Margaret has got a tutorship position with the School of Information Technology, James Cook University.
7. Terry Chiu. Testing Computational Complementarity For Finite Automata Using Distributed Object Technology, University of Auckland, 1999. (co-supervised with Elena Calude and R. Nicolescu) Terry has a position with Mingchi Institute of Technology, Taipei, Taiwan.
8. Yongyi Hu. Information-Theoretic Incompleteness, University of Auckland, 1998.
9. Gordon Alford. DNA Computation: From Turing Machines to H Systems, University of Auckland, 1997. He is currently a Ph.D. student in Computer Science with TUCS, Turku University, Finland.
10. Shane Legg. Solomonov Induction and Algorithmic Information Theory, University of Auckland, 1996. In 2011 he founded with Demis Hassabis and Mustafa Suleyman the artificial intelligence company DeepMind, from 2014 part of Google (see also Google DeepMind).
11. Ion Mandoiu. An Extension of Gacs Reducibility Theorem, Bucharest University, Romania, 1992. He has a Ph.D. in Computer Science, Georgia University, USA, 1999. Currently he has a Post-Doctoral position with UCLA.
12. 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.
13. Nicolae Duta. Representable P. Martin-Loef Tests, Bucharest University, Romania, 1991. He has got a Master Degree in Applied Mathematics, Universite Paris-Sud, France, 1994. He obtained Ph.D. in Computer Science from Iowa State University, USA. He has a position with the Speech and Language Processing Department, BBN Technologies, Cambridge, MA, USA.
14. Ana-Maria Salajean (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.
15. Eva Kurta. An Extension of Kraft-Chaitin Theorem, Bucharest University, Romania, 1989.
13. Cezar Campeanu. Variants of Post Correspondence Problem, Bucharest University, Romania, 1988.
16. Marius Zimand. Complexity of Probabilistic Algorithms, Bucharest University, Romania, 1983. (co-supervision with D. Vaida)
15. Valentin Vieru. Recursion and Iteration. Efficient Translations, Bucharest University, Romania, 1981. He is currently with Canada Computers, Toronto, Canada.
17. Brandusa Fantaneanu. Recursive and Non-Primitive Recursive Functions, Bucharest University, Romania, 1978.

Other Graduate Supervision

-15 Peter Huxford: Computational Group Theory, 2017. (co-supervised with E. O'Brien)
-14 Yan Kolezhitskiy: Exploring the number of rationals with grossone, Auckland, 2016.
-13 Daniel Britten: Exploring Program Verification in Coq, University of Auckland, 2016.
-12. Marcus Triplett: Approximate Solutions for the Halting Problem, University of Auckland, 2014, 2014-2015. (summer research fellowship) Marcus is doing a PhD in bioinformatics at the Queensland Brain Institute, the University of Queensland, Australia.
-11. Timothy Resnick: Sudoku at the Intersection of Classical and Quantum Computing, University of Auckland, 2014, 2014.
-11. Declan Thompson.: Decidable Approximations of the Halting Problem: An Isabelle Formalisation}, University of Auckland, 2014, 2014.
-10. Nemanja Poznanovic (nempoznanovic@gmail.com): Free Will and Randomness, 2013--14 (summer research fellowship)
-9. Damien Desfontaines (ENS Paris, desfonta@clipper.ens.fr): Halting Time, 2013. (MSc internship)
-8. Melissa S. Queen (Dartmouth College, NH USA, Melissa.S.Queen.13@dartmouth.edu): The Complexity of Mathematical Statements, Thesis, Dartmouth College, NH USA, 2013 (with A.~Chakrabarti).
-7. Jonathan Conder: Quantum Randomness, 2011--12 (summer research fellowship)
-6. Melissa S. Queen (Dartmouth College, NH USA, Melissa.S.Queen.13@dartmouth.edu): Complexity of Mathematical Problems, 2011--12 (with E. Calude) (summer research fellowship)
-5. Ali Akhtarzada: A Framework for a Decentralized Ranking System, 2008--9. (with J. Hosking)
-4. Christine Mueller: Active Mathematical Documents, 2008--9. (PhD internship)
-3. Bruno Grenet: Complexity and Incompleteness, 2008. (MSc internship)
-2. Dominik Schultes: Rainbow Sort, 2004.
-1. Pulkit Grover: Transcending the Turing Barrier via Quantum Computing, 2003 (with H. Carmichael and B. Pavlov)
0. Igor Kurlatov: Simulating the EPR Effect, 2003.
1. Terry Chiu (1998): An Infrastructure for Testing Computational Complementarity Using Java Aglets, University of Auckland, New Zealand. (co-supervised with Elena Calude and R. Nicolescu)
2. Gerard P. Atkinson (1997-8): Information-Theoretic Incompleteness, University of Auckland, New Zealand.
3. Patrick Leung: "Final essay for a fascinating course in algorithmic information theory taught by Cris Calude"
4. Keith Wansbrough
5. Gordon Alford (1996): Modeling DNA Computation, University of Auckland, New Zealand.
6. Luminita Vita (1990-1994): Constructive Algebra.
7. Gabriel Istrate (1988-1992): Topological Methods in Recursive Function Theory. He got a Ph.D. degree from the University of Rochester, USA. he has currently a post-doc position with the Center for Nonlinear Studies and CIC-3 Divison, Los Alamos National Laboratory, USA.
8. Gabriel Ciobanu (1988-1991): Programming Logic. He has got a Ph.D. degree from the University "Alex.I.Cuza'', Iasi, Romania, 1990 where he holds a professorship position.
9. Lila Kari (Santean) (1985-1987): Hierarchies of Primitive Recursive String-Functions. She has got a Ph.D. degree from Turku University, Finland, 1991. She has currently a full-professorship position with the University of Western Ontario, London, Canada.
10. 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 Universite d'Angers, France.
11. Viorel Vajaitu (1981-1982): Exotic Numeration Systems. He has got a Ph.D. degree from the Institute of Mathematics, Romanian Academy where he has currently a senior research position.
12. Victor Vianu (1975-1976): Metrics on Free Monoids. He received his Ph.D. from the University of California, San Diego, where he is currently Professor of Computer Science.

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 (6 months) and then he returnd to Hagen Open University, Germany.
3. Dr. Yongge Wang, research in Algorithmic Information Theory, February 1997 - December 1997. Yongge has got a position of cryptologic mathematician at Certicom Research Certicom Corp., 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 assistant professorship position with the Department of Mathematics, Turku University, Finland.