Selected
Conference Presentations
- "Four
notions of degree spectra," European
Summer Meeting of the Association for Symbolic Logic, Logic Colloquium,
Sofia, Bulgaria, August 2009, plenary speaker.
- “Computability and orders on structures,” Workshop on
Computability, Reverse
Mathematics and Combinatorics, Banff International Research Station,
Alberta, Canada, December 2008.
- “Computable
properties of abelian p-groups,” Meeting
of the
American Mathematical Society, special session Computability Theory and
Effective Algebra, Wesleyan University, October
2008.
- “Effective categoricity of equivalence structures and abelain p-groups,” Abstract,
Annual Meeting of the
Association for Symbolic Logic, University of California-Irvine, March
2008.
- “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, Loübeck,
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.
Selected
Invited Lectures at Other Universities
- “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, Gödel, 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
für
Logik, Komplexität 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.
Special
Presentations at George Washington
- “Turing degrees of complexity,” Mathematics Graduate Student
Seminar, December 5, 2008.
- “Computable mathematics,” Research Gallery: President Knapp
Inauguration Week
Research Day, November 14,
2007.
- “Quantum computing,” Mathematics Initiative Spring Symposium,
January 26, 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 4, 2006.
- “Algorithms and oracles in
mathematical theories and models,”
Columbian Research Fellows Lecture, Columbian College of Arts and
Sciences, April 20, 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.