Curriculum Vitae

EDUCATION

Ph.D. in Mathematics. Faculty of Science, University of Leeds. Leeds, United Kindom, 2004. (Advisor: S.B. Cooper.)

Mathematics Degree. University of Thessaloniki, Greece, 2000.

EMPLOYMENT

Research Fellow at the Chinese Academy of Sciences (Beijing, Institute of Software, State Key Laboratory of Computer Science). 2011-2012

Lecturer in Mathematics at the Institute for Logic, Language & Computation, University of Amsterdam, the Netherlands. 2009-2011.

Research Fellow and Lecturer in Mathematics, Victoria University of Wellington, New Zealand. 2007-2009.

Research Fellow in Mathematics, University of Leeds, United Kindom. 2004-2007.

Registration Marshal and IT demonstrator, University of Leeds, United Kindom. 2003-2004.

Mathematics Tutor, University of Leeds, United Kindom. 2000-2003.

AWARDS

2011 1-year Research Fellowship for International Young scientists by the Chinese Academy.

2004 3-year EPSRC Research Fellowship.

2001 3-year grant for studying abroad by the University of Thessaloniki, Greece.

3-year partial EPSRC doctoral grant from the University of Leeds.

2001 Essay Prize on the History and Philosophy of Computability for my essay "Self Reference and Paradoxes", sponsored by the Advanced Reasoning Forum and Wadsworth Publishing Company, USA.

ACTIVITIES

Program committee for the TAMC conference in Beijing in 2012

Organizing committee for the Turing year in China and TAMC conference in Beijing in 2012

Organizer of the Logic seminar, University of Amsterdam 2009-2011

Organizing committee for the CiE (Computability in Europe) conference in Siena 2007

External examiner for the PhD exam of Maria Libera Affatato, University of Siena 2007

Chair of the Staff/Postgraduate Committee, School of Mathematics, University of Leeds 2002

RESEARCH INTERESTS

Mathematical Logic, Theory of Computation and Kolmogorov Complexity.


ARTICLES IN JOURNALS (36)

On the number of infinite sequences with trivial initial segment complexity, (with Tom Sterkenburg) Theoretical Computer Science 412 (2011) 7133-7146.

Universality probability of a prefix-free machine, (with David L. Dowe) Philosophical Transactions of the Royal Society (in press)

Kolmogorov complexity of initial segments of sequences and arithmetical definability, (with Charlotte Vlek) Theoretical Computer Science 412 (2011) 5656-5667.

Strings with trivial Kolmogorov Complexity, International Journal of Software and Informatics, Volume 5, Issue 4 (2011), pp. 609-623.

Chaitin's halting probability and the compression of strings using oracles, (with Andrew E.M. Lewis) Proceedings of the Royal Society (2011) 467, 2912-2926.

Measure and Cupping in the Turing Degrees (with Andrew E.M. Lewis)
Proceedings of the American Mathematical Society (in press).

Randomness Notions and Partial Relativization, (with Joe Miller and Andre Nies)
Israel Journal of Mathematics (in press).

Upper bounds on ideals in the Turing degrees, (with Andre Nies)
Annals of Pure and Applied Logic 162 (2011) 465-473.

Jump inversions inside effectively closed sets and applications to randomness,
(with Rod Downey and Keng-Meng Ng), J. Symb. Log. 76(2): 491-518 (2011)

Tracing and domination in the Turing degrees, Annals of Pure and Applied Logic
163 (2012): 500-505.

Elementary differences between the degrees of unsolvability and degrees of compressibility, Annals of Pure and Applied Logic 161 (2010) 923-934.

Compactness arguments with effectively closed sets for the study of relative randomness, Journal of Logic and Computation (in press).

Low upper bounds in the Turing degrees revisited, (with Andre Nies)
Journal of Logic and Computation (in press).

Relative randomness and cardinality, Notre Dame Journal of Formal Logic 51 Issue 2 (2010).

K-trivial degrees and the jump-traceability hierarchy (with Rod Downey and Noam Greenberg), Proceedings of the American Mathematical Society 137 Number 6 (2009).

The importance of Pi-0-1 classes in effective randomness
(with A. Lewis and K.-M. Ng), Journal of Symbolic Logic 75 Number 1 (2010).

Working with strong reducibilities above totally omega-c.e. and array computable degrees (with Rod Downey and Noam Greenberg), Transactions of the American Mathematical Society 362 (2010).

K-triviality of closed sets and continuous functions (with D. Cenzer, J. Remmel and R. Weber), Journal of Logic and Computation 19 Number 1 (2009).

Non-Cupping, Measure and Computably Enumerable Splittings (with Anthony Morphett), Mathematical Structures in Computer Science 19 (2009) 25-43.

Pi-0-1 classes, LR degrees and Turing degrees (with Andy Lewis and Frank Stephan), Annals of Pure and Applied logic 156 (2008) 21-38.

Post's Programme for the Ershov Hierarchy (with Bahareh Afshari, S. Barry Cooper and Frank Stephan), Journal of Logic and Computation (2007) 17 1025-1040

Algorithmic Randomness of Closed Sets (with Paul Brodhead, Douglas Cenzer, Seyyed Dashti and Rebecca Weber), Journal of Logic and Computation (2007) 17 1041-1062.

Randomness, Lowness and Degrees (with Mariya Soskova and Andy Lewis),
Journal of Symbolic Logic 73, Issue 2 (2008) 559-577

Algorithmic Randomness of Continuous Functions (with P. Brodhead, D. Cenzer, J.B. Remmel and R. Weber), Archive for Mathematical Logic 46, Numbers 7-8 (2008) 533-546.

Random Non-Cupping Revisited, Journal of Complexity 22 (2006) 850-857.

Randomness and the Linear degrees of computability (with Andrew Lewis), Annals of Pure and Applied Logic 145 Issue 3 (2007) 252-257

A computably enumerable real which cannot be sw-computed by any Omega number (with Andrew Lewis), Notre Dame Journal of Formal Logic 47 Issue 2 (2006) 197-209

The ibT Degrees of computably enumerable sets are Not Dense (with Andrew Lewis), Annals of Pure and Applied Logic 141 Issues 1-2 (2006) 51-60

Random Reals and Lipschitz Continuity (with Andrew Lewis), Mathematical Structures in Computer Science 16 Issue 5 (2006) 737-749

The Hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees (with Andrew Lewis), Notre Dame Journal of Formal Logic 47 Issue 3 (2006) 361-370.

Hypersimplicity and Semicomputability in the weak truth table degrees, Archive for Mathematical Logic 44 Number 8 (2005) 1045-1065

h-Monotonically Computable Real Numbers, Math. Log. Quarterly 51 Number 2 (2005) 157-170.

Approximation representations for Delta-0-2 reals, Archive for Math. Logic, 43 Number 8 (2004) 947-964

Approximation representations for reals and their wtt degrees, Math. Log. Quarterly 50 Number 4/5 (2004) 370-380

The approximation structure of a computably approximable real, J. Symbolic Logic 68 no.3 (2003) 885-922

A transfinite hierarchy of reals, Mathematical Logic Quarterly 49 Number 3 (2003) 163-172

FULL CONFERENCE PAPERS (3)

K-trivials are never continuously random (with N. Greenberg, A. Montalban and T. Slaman), Proceedings of the 11th Asian Logic Conference. World Scientific.

A capable almost everywhere dominating computably enumerable degree (with Antonio Montalban), Electronic Notes in Theoretical Computer Science 167 (2007) 17-31.

Computably enumerable sets in the Solovay and the Strong Weak Truth Table Degrees, Lecture Notes in Computer Science 3526 (2005) 8-17

EXTENDED ABSTRACTS (5)

Working with the LR Degrees (with Andy Lewis, Mariya Soskova), Theory and Applications of Models of Computation: 4th International Conference TAMC 2007, Shanghai, China, May 2007, Proceedings (J.-Y. Cai, S.B. Cooper, H. Zhu, eds.), Springer Lecture Notes in Computer Science, LNCS 4484 (2007) 89-99.

K-trivial closed sets and continuous functions (with D. Cenzer, J. Remmel and R. Weber), CIE 2007, Computation and Logic in the Real World, Third Conference on Computability in Europe, Siena, Italy, June 2007, S.B. Cooper, B. Loewe and A. Sorbi (Eds.), Springer Lecture Notes in Computer Science 4497 (2007), 135-145.

Immunity properties and the n-c.e. hierarchy (with Bahareh Afshari and S. Barry Cooper), Theory and Applications of Models of Computation - Proceedings of the Third Annual Conference on Computation and Logic}, TAMC06, Beijing, May 2006 (Jin-Yi Cai, S. Barry Cooper, Angsheng Li, eds.), Springer Lecture Notes in Computer Science 3959 (2006) 694-703.

On the monotonic computability of semi-computable real numbers (with X. Zheng), Lecture Notes in Computer Science 2731 (2003) 290-300

On 0'-computable reals, Electronic Notes in Theoretical Computer Science, 66 Issue 1, Eds. V. Brattka, M. Schroder and K. Weihrauch, Elsevier Science Publishers, 2002.

RESEARCH SUPERVISION

Charlotte Vlek: Definability in the degrees of Randomness. MSc, University of Amsterdam, 2010.

Tom Sterkenburg On the number of K-trivial sequences. MSc, University of Amsterdam, 2010.

Anthony Morphett Degrees of Computability and Randomness PhD (jointly with S.B.Cooper), University of Leeds, 2009.

TEACHING (as a Lecturer)

Mathematical Logic (Undergraduate) Amsterdam Fall 2010

Introduction to Logic in Computer Science (Graduate) Amsterdam Fall 2010

Axiomatic Set Theory (Undergraduate) Amsterdam Spring 2010

Project on Randomness and Computability (Graduate) Amsterdam Winter and Summer 2010

Model Theory (national master class) Amsterdam Spring 2010

Special topics in mathematical logic (Graduate) Amsterdam Spring 2010

Complexity Theory (Graduate) Amsterdam Fall 2009

Descriptive Set Theory (Graduate) Amsterdam Fall 2009

Algebra and Discrete Mathematics (Undergraduate) Wellington Fall 2008

Theory of Computation (Graduate) Wellington Spring 2007, Spring 2008

Algorithmic Randomness (Graduate) Leeds Spring 2006

Randomness and Effective measure (Graduate) Leeds Fall 2006

TEACHING (as an assistant)

Discrete Mathematics and Linear Algebra (Tutorials) Leeds Spring 2004

Real analysis (Tutorials) Leeds Fall 2002, Fall 2003

Group Theory (Tutorials) Leeds Fall 2001, Spring 2002

Calculus (Tutorials) Leeds Spring 2001, Fall 2002

INVITED LECTURES (a selection)

2012 The Mathematical Legacy of Alan Turing (Public opening of the SAS programme, Spitalfields Day), Cambridge

2011 Logic Colloquium, European ASL meeting in Barcelona. Plenary.

2011 Eighth Panhellenic Logic Symposium, Ioannina, Greece

2010 Fifth International Conference on Computability, Complexity and Randomness, Notre Dame, USA. Plenary.

2009 European Association of Symbolic Logic meeting, Sofia Bulgaria

2009 Computability in Europe meeting in Heidelberg (CiE 2009)

2009 Fourth International Conference on Computability, Complexity and Randomness, Marseille, France

2008 Third conference Computability, Complexity and Randomness, Nanjing, China

2007 First joint meeting of the New Zealand and American mathematical societies

2007 ASL meeting in Gainesville Florida

2007 Fourth Annual Conference on Theory and Applications of Models of Computation (TAMC07), Shanghai, China

2006 American annual meeting of the Association for symbolic logic, Montreal

2005 Second Annual Conference on Theory and Applications of Models of Computation (TAMC05), Kunming, China

RESEARCH VISITS (a selection)

2012 Newton Institute, Cambridge, January-February.

2010 University of Leeds, hosted by Andrew E.M. Lewis, June.

2010 Charles University in Prague, hosted by Antonin Kucera, June.

2008 University of Chicago, hosted by Antonio Montalban, June-July.

2007 Nanjing University, hosted by Yu Liang, June.

2006 University of Singapore, hosted by Frank Stephan, December.

2006 University of Florida, hosted by Douglas Cenzer, September-November.

2005 Chinese Acandemy of Sciences, Institute of Software, hosted by A. Li.