Other Conference Presentations

  • Orbits of maximal vector spaces, SouthEastern Logic Symposium, Gainesville, Florida, February-March 2015.
  • Maximal vector spaces, Knot Theory and Its Applications to Physics and Quantum Computing, Dallas, Texas, January 2015 (invited).
  • Interaction of computability theory and computable algebra, special session Computability Theory, 2014 Canadian Mathematical Society Winter Meeting, Hamilton, Ontario, December 2014 (invited).
  • Coding information into orders on groups, Meeting of the American Mathematical Society, special session Inverse Problem and Other Mathematical Methods Applied in Physics and Related sciences, April 2014 (invited).
  • Notions of degree spectra, Joint Math Meetings, American Mathematical Society special session Computability in Geometry and Topology, Baltimore, January 2014 (plenary - double time).
  • Sigma-0-1 an Pi-0-1 equivalence structures, Meeting of the American Mathematical Society, special session Computability across Mathematics, St. Louis, Missouri, October 2013 (invited).
  • Effective categoricity of injection structures, Sy Friedman Symposium, Kurt Goedel Research Center for Mathematical Logic, University of Vienna, Austria, July 2013 (invited).
  • Complexity of orders on residually nilpotent groups, Meeting of the American Mathematical Society, special session Computability in Discrete and Continuous Worlds, Ames, Iowa, April 2013 (invited).
  • Application of computability theory to a problem in topology, Meeting of the American Mathematical Society, special session Themes in Applied Mathematics, Boulder, Colorado, April 2013 (invited).
  • Complexity of orders on algebraic structures, joint American Mathematical Society/Association for Symbolic Logic special session Effective Algebra and Model Theory, Annual Joint Mathematics Meetings, San Diego, January 2013 (invited).
  • Injections, orbits, and complexity, Isaac Newton Institute Workshop on the Incomputable, Kavli Royal Society International Centre, Chichley Hall, United Kingdom, June 2012 (invited).
  • Structures, theories, and diagrams, conference Definability in Computable Structures, University of Chicago, May 2012 (plenary).
  • Different approaches to orders on groups, Meeting of the American Mathematical Society, special session Mathematics Applied in the Sciences: From Statistics to Topology, Washington DC, March 2012 (invited).
  • Pi-0-1 equivalence structures and their isomorphisms,
    international meeting on Computability Theory, Oberwolfach Mathematical Institute, Germany, February 2012 (invited).
  • Computability theoretic complexity of isomorphisms of countable structures, Meeting of the American Mathematical Society, special session Category Theory in Graphs, Geometry and Inverse Problems, Salt Lake City, Utah, October 2011 (invited).
  • Delta-0-2 isomorphisms of effective equivalence structures, Mal'tsev meeting, international conference on algebra, mathematical logic and applications, Novosibirsk, Russia, October 2011 (plenary).
  • When orders on a group form the Cantor set, Workshop on Computability Theory, Centre de Recerca Matematica, Barcelona, Spain, July 2011 (invited).
  • Orders on structures and structure of orders, special session Computability in Analysis, Algebra and Geometry, Computability in Europe, Sofia, Bulgaria, June  2011 (invited).
  • Computably enumerable and co-computably enumerable equivalence structures, international Workshop on Computability Theory, Paris, France, July 2010 (invited).
  • Degree spectra and the jump hierarchy, SouthEastern Logic Symposium (SEALS), University of Florida, Gainesville, February 2010 (invited).
  • Four notions of degree spectra, European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium, Sofia, Bulgaria, August 2009 (plenary).
  • Computability and orders on structures, Workshop on Computability, Reverse Mathematics and Combinatorics, Banff International Research Station, Alberta, Canada, December 2008 (invited).
  • Computable properties of abelian p-groups, Meeting of the American Mathematical Society, special session Computability Theory and Effective Algebra, Wesleyan University, October 2008 (invited).
  • Effective categoricity of equivalence structures and abelian p-groups, Abstract, Annual Meeting of the Association for Symbolic Logic, University of California-Irvine, March 2008 (invited)
  • Spaces of orders, Abstract, NSF-funded Workshop on Knots and Quantum Computing, University of Texas at Dallas, December 2007 (invited). 
  • Computable algebra, Abstract, Meeting of the American Mathematical Society, special session Advances of Algorithmic Methods for Algebraic Structures, Murfreesboro, Tennessee, November 2007 (invited).
  • Back and forth through computability theory, Abstract, Winter Meeting of the Association for Symbolic Logic, New Orleans, January 2007 (plenary).
  • Coding structures into structures, Abstract,  Meeting of the American Mathematical Society, special session Computability Theory in Honor of Manuel Lerman's Retirement, University of Connecticut, Storrs, October 2006 (invited).
  •  Strong degree spectra of relations, Abstract, Meeting of the American Mathematical Society, special session Model Theory and Computability, Notre Dame, IN, April 2006 (invited).
  • Orders on computable groups, 12th SouthEastern Logic Symposium (SEALS), University of Florida, Gainesville, March 2006 (invited).
  •  Computable models, computability, and enumerations, NSF-funded Workshop on Classification of Countable Models, University of Notre Dame, May 2005 (invited).
  •  Degrees of structures, 11th SouthEastern Logic Symposium (SEALS), University of Florida, Gainesville, April 2005 (invited).
  • Effectively and relatively effectively categorical structures, special session Computability Theory and Applications, Meeting of the American Mathematical Society, Evanston, Illinois, October 2004 (invited).
  • Effectiveness in algebraic structures, Annual Meeting of the Association for Symbolic Logic, Carnegie Mellon University, Pittsburgh, May 2004 (plenary).
  • Kleene's O, Harrison orderings, and Turing degree spectra, 10th SouthEastern Logic Symposium (SEALS), University of Florida, Gainesville, March 2004 (invited).
  • Inductive inference machines for mathematical structures, 12th International Congress of Logic, Methodology, and Philosophy of  Mathematics, Oviedo, Spain August, 2003.
  • Degrees of the isomorphism types of countable structures, Annual Meeting of the Association for Symbolic Logic, special session Computability Theory and Effective Mathematics, Chicago, 2003 (invited).
  • On the learnability of vector spaces, 13th International Conference on Algorithmic Learning Theory, Loubeck, Germany, 2002 (refereed).
  • Principal filters of the lattice of computably enumerable vector spaces, special session Effectiveness Questions in Model Theory, Meeting of the American Mathematical Society, Madison, Wisconsin, 2002 (invited).
  • Complexity of diagrams of countable structures, Annual Meeting of the American Mathematical Society, special session Computability Theory with Applications, San Diego, California, 2002 (invited).
  • Immune relations on computable structures, Annual Meeting of the Association for Symbolic Logic, special session Computability Theory, Urbana-Champaign, 2000 (invited).
  • Definability and algorithmic properties of structures, Mid-Atlantic Mathematical Logic Symposium, College Park, Maryland, 2000 (invited).
  • Computably enumerable relations on computable structures, American Mathematical Society Meeting, special session Computability, Gainesville, Florida, 1999 (invited).
  • Nowhere simplicity, Turing degrees, and splittings, Mid-Atlantic Mathematical Logic Symposium, Washington, D.C., 1998 (invited).
  • Uncountably many isomorphic copies of a computable relation, International Workshop on Recursion Theory and Complexity Theory, Kazan, Russia, 1997 (invited).
  • Intrinsically D02 relations in computable structures, Logic Colloquium - European Summer Meeting of the Association for Symbolic Logic, Leeds, England, 1997.
  • Nowhere simple sets, International Recursion Theory Meeting, Mathematisches Forschungsinstitut Oberwolfach, Germany, 1996 (invited).
  • Turing degrees of certain isomorphic images of recursive relations, Annual Meeting of the American Mathematical Society, special session Recursive and Feasible Mathematics, Orlando, Florida, 1996 (invited).
  • Frequency computable sets, their classes, and generalizations, Logic Colloquium - European Summer Meeting of the Association for Symbolic Logic, special session on Computability Theory, Haifa, Israel, 1995 (invited).
  • Recursive model theory: Examining computability in the theory of theories, Winter Meeting of the Association for Symbolic Logic, San Francisco, 1995 (plenary).
  • Frequency computations, Annual Meeting of the Association for Symbolic Logic, Duke University, 1992.
  • Two-element Turing degree spectrum, Logic Colloquium - European Summer Meeting of the Association for Symbolic Logic, West Berlin, Germany, 1989.
  • Some cardinality and complexity properties of a Turing degree spectrum, Annual Meeting of the American Mathematical Society, Atlanta, Georgia, 1988.
  • Los's theorem for ultraproducts of models with monotone quantifiers, Logic Colloquium - European Summer Meeting of the Association for Symbolic Logic, Marseille, France, 1981.

Invited Lectures at Other Universities

  • Structure and complexity of orders on structures, Mathematics Colloquium, Southern Illinois University, April 2018.
  • Maximal computably enumerable sets and vector spaces, Research Seminar of the Kurt Goedel Research Center for Mathematical Logic, University of Vienna, Austria, December 2014
  • Orders on groups, their spaces, and complexity, Research Seminar of the Kurt Goedel Research Center for Mathematical Logic, University of Vienna, Austria, March 2014.
  • Recursive mathematics, Mathematics Colloquium, University of Sofia, Bulgaria, July 2013.
  • Effective structures and complexity of their isomorphisms, Mathematics Colloquium, University of Florida, Gainesville, October, 2012.
  • Turing and beyond, Applied Information Sciences Lecture Series, Johns Hopkins University, Applied Physics Lab, February 2012.
  • Computably enumerable and co-computably enumerable equivalence structures, Research Seminar of the Kurt Goedel Research Center for Mathematical Logic, University of Vienna Austria, November 2011.
  • Groups, orders, trees and paths Logic Seminar, University of Maryland, College Park, April 2011.
  • Orders on structures, Mathematics Colloquium, George Mason University, College Park, April 2011.
  • Effective equivalence structures and their isomorphisms, Connecticut Logic Seminar, Welseyan Univeristy, November 2010.
  • Orders on groups, Logic Seminar, University of Maryland, College Park, April 2010.
  • Constructions of modern computability theory, Mathematics Colloquium, University of Texas at Dallas, March 2010.
  • Computable structures, effective categoricity, and Scott families, Logic Seminar, MIT, October 2009.
  • Priority Methods, Women in Mathematics Lecture Series, Department of Mathematics, MIT, October 2009.
  • Orderable groups, Logic Workshop, CUNY Graduate Center, New York, May 2009.
  • Effectve Scott families of Abelian p-groups, Logic Seminar, University of Maryland, College Park, November 18, 2008.
  • Effective categoricity of strucutres, Logic Seminar, University of Florida, Gainesville, November 10, 2008.
  • Orderable groups and their spaces of orders, Mathematics Colloquium, University of Florida, Gainesville, November 7, 2008
  • From algorisms to computability theory, Mathematics Colloquium, University of Texas at Dallas, September 2008
  • Turing, Goedel, and the algorithmic method, Mathematics Colloquium, East Carolina University, April 2008.
  • Effective categoricity of equivalence structures, Logic Seminar, University of Maryland, College Park, April 2008.
  • Algorithms, undecidability, and incompleteness, Mathematics Colloquium, Howard University, November 2007.
  • Turing computability in theories and structures, Mathematics Colloquium, Department of Pure Mathematics, University of Waterloo, Canada, November  2006.
  • Embedding fields into nilpotent groups,  Logic Workshop, CUNY Graduate Center, New York, October 27, 2006.
  • Inductive inference of classes of computably enumerable vector spaces, Logic Seminar, Cornell University, December 2004.
  • Intrinsically S0a relations on computable structures, Logic Seminar, Cornell University, November 2004.
  • Scott families and complexity of isomorphisms, Logic Seminar, Western Illinois University, October 2004.
  • Systems that learn algorithmically generated languages and structures, Mathematics Colloquium, Western Illinois University, October 2004.
  • Computable model theory, Logic Seminar, University of Chicago, May 2004.
  • Using computable algebra in theoretical computer science, University of Notre Dame, April 2004.
  • Computable algebra and algorithmic learning theory, Mathematics Colloquium, East Carolina University, March 2004.
  • Isomorphic images of relations on countable structures, Logic Seminar, University of Maryland, College Park, March 2004.
  • Learning classes of algebraic structures from positive and negative information, Computer Science Colloquium, University of Delaware, 2003.
  • Algorithmic complexity of countable models, Mathematical Logic and Theoretical Computer Science Seminar, Heidelberg University, Germany, 2002.  
  • Post-type properties of relations on structures, Logic Seminar, Western Illinois University, Macomb, October 2002.
  • Computability-theoretic complexity of theories, structures, and relations, Mathematics Colloquium, Western Illinois University, Macomb, 2002.
  • Turing degrees of structure, Logic Seminar, Sobolev Institute of Mathematics, Novosibirsk State University, Novosibirsk, Russia, 2002.
  • Hyperarithmetical and nonhyperarithmetical relations on structures, Logic Seminar, University of Chicago, 2002.
  • Intrinsic complexity of relations on structures, Southern Wisconsin Logic Colloquium, University of Wisconsin, Madison, 2002.
  • Turing complexity of mathematical structures and their relations, Complexity Theory Seminar, Computer Science Department, University of Maryland, College Park, 2001.
  • Turing degrees of hypersimple relations on computable structures, Southern Wisconsin Logic Colloquium, University of Wisconsin, Madison, 2000.
  • Simplicity and nowhere simplicity of relations on structures, Logic Seminar, University of Notre Dame, 2000.
  • Computably enumerable relations on computable models, Southern Wisconsin Logic Colloquium, University of Wisconsin, Madison, 1999.
  • Computability-theoretic properties of relations on computable models, Logic Seminar, Cornell University, 1998.
  • Algorithmic properties of models, Mathematics Colloquium, East Carolina University, 1997.
  • Computability in mathematical structures, Logic Seminar, Institut fur Logik, Komplexitat und Deduktionssysteme, Karlsruhe University, Germany, 1996.
  • Algorithmic properties of mathematical structures, Mathematics and Statistics Colloquium, University of Maryland Baltimore County, 1996.
  • Hilbert's tenth problem, Mathematics Faculty/Student Colloquium, University of Maryland, College Park, 1995.
  • Recursive homogeneous structures, Logic Seminar, University of Maryland, College Park, 1991.
  • Turing degrees of computational difficulty, Mathematics Colloquium, George Mason University, 1990.
  • Effective mathematics, Mathematics Colloquium, University of Maryland, College Park, 1990.
  • An introduction to recursive model theory, Logic Seminar, University of Maryland, College Park, 1988.
  • Degree spectrum of a recursive relation on a recursive structure, Logic Seminar, University of Illinois, Urbana-Champaign, 1987.

Selected Presentations at George Washington

  • Turing Computability, guest lecture in Math 2020: Joint Math and Physics Seminar, November 2013.
  • Computable structure theory, GW Research Showcase poster, March 2012.
  • Constructing computable linear orderings with non-computable properties, Mathematics Graduate Student Seminar, October 2009.
  • Turing degrees of complexity, Mathematics Graduate Student Seminar, December 2008.
  • Computable mathematics, Research Gallery: President Knapp Inauguration Week Research Day, November 2007.
  • Quantum computing, Mathematics Initiative Spring Symposium, January 2007.
  • Formal learning theory based on inductive inference, jointly with Michele Friend (Philosophy), Summary, Columbian College of Arts and Sciences Colloquium  to launch the mathematics across disciplines initiative, May 2006.
  • Algorithms and oracles in mathematical theories and models, Columbian Research Fellows Lecture, Columbian College of Arts and Sciences, April 2005.
  • Hilbert's Tenth Problem: from Diophantus to Matiyasevich, Summer Program for Women in Mathematics, July 2002.
  • Quantum computing, Summer Program for Women in Mathematics, July 2000.
  • Effectiveness in mathematical structures, Summer Program for Women in Mathematics, July 1997.