Liling Ko

Email: ko.390@osu.edu

Here is my CV.

Position

Aug 2021 – Aug 2024: Visiting Assistant Professor, Ohio State University, USA

Education

2016 – 2021: PhD in Mathematics, University of Notre Dame, USA. Advisor: Professor Peter Cholak

2011-2013: Masters in Mathematics, National University of Singapore

Research Interest

Computability theory, randomness, combinatorics, discrete mathematics.

Papers

1. Liling Ko. Towards characterizing the >ω^2 fickle recursively enumerable Turing degrees. https://arxiv.org/abs/2109.09215. (Submitted to APAL 2021.)
2. Liling Ko. (PhD Thesis) Towards characterizing the >ω^2 fickle recursively enumerable Turing degrees. Bulletin of Symbolic Logic, Volume 27, Issue 4, Feb 2022. https://curate.nd.edu/show/7m01bk15c0w.
3. Liling Ko. Nonlowness is independent from fickleness. Computability 10 (2021) 271–288. https://arxiv.org/abs/1906.06381.

Talks

1. Towards Finding a Lattice that characterizes >ω^2-fickleness in the r.e. Turing Degrees. Slides. National University of Singapore. 18th March 2021.
2. Bounding Lattices in the Recursively Enumerable Turing Degrees. Slides. AMS Special Session Computability Theory and Effective Mathematics. 7th January 2021.
3. Fickleness and bounding lattices in the recursively enumerable degrees. Slides. 27th October 2020.
4. Nonlowness is independent from fickleness. Slides. 16th New England Recursion and Definability Seminar (NERDS). Bridgewater State University. 16th November, 2019.

Teaching

Instructor: 2022 Spring – Calculus III. 2021 Spring, 2018 Fall – Introduction to Math Research, Calculus B

Teaching assistant (head): 2019 Spring – Calculus B

Teaching assistant: 2021 Fall – Precalculus. 2019 Fall, 2018 Spring, 2017 Fall – Calculus B, Calculus 1, Calculus A