Most of my research is in computable (recursive)
algebra and computable model theory (see Chapter 5 by
Fokina, Harizanov and Melnikov, in Turing's Legacy
volume), and in computability (recursion)
theory, which are subfields of mathematical
logic (see Crossley's
tutorial).

Computability theory is the mathematical theory of
algorithms. (See computability
theory home page) Problems which can be solved
algorithmically are called decidable. Undecidable
problems can be more precisely classified by
considering generalized algorithms, which require
external knowledge. Turing degrees provide an
important measure of the level of such knowledge
needed. Computable model theory explores algorithmic
properties of objects and constructions arising within
mathematics.

I am especially interested in computability theoretic
complexity of relations (see Hirschfeldt's paper
in the Bulletin of Symbolic Logic) and structures (see
Harizanov's paper
in the Bulletin of Symbolic Logic), including their
Turing degrees. I am also interested in quantum
computing and in theoretical computer science, in
particular, complexity theory, frequency computations,
and inductive inference and algorithmic learning
theory. My other interests include natural language
semantics and philosophy of mathematics.

Knot Theory and Quantum Computing, January 6-9,
2015, University of Texas at Dallas, co-organizer
(with M. Dabkowski, T.
Hagge, V. Ramakrishna, R.
Sazdanovic and A.
Sikora).

Logic
Colloquium, European Summer Meeting of the
Association for Symbolic Logic, Evora, Portugal,
July 2227, 2013. Member of the Program Committee.
Co-organizer (with Felix
Costa) of the Special Session on
Computability.

Model Theory and Computable Model Theory,
University of Florida Special Year in Logic,
February 5–10, 2007. Organizing Committee: Doug
Cenzer, Valentina Harizanov, David
Marker and Carol Wood