jennifer chubb reimann


talks

  • AMS = American Mathematical Society
  • ASL = Association for Symbolic Logic
  • JMM = Joint Mathematics Meetings (annual joint meeting of the AMS and the Mathematical Association of America)
  • CiE = Computability in Europe
Click on list items or markers for details and links, or click here for a full-screen version. (Or scroll down to view a list.)
  • Decision problems in recursively presented groups, CUNY Logic Workshop, CUNY Graduate Center, November, 2017.
  • Trees of orderings, George Washington University Seminar: Logic Across Disciplines, October, 2017.
  • Orderings of Algebraic Structures, George Washington University Logic Seminar, October 2017.
  • Distance functions on computable graphs, Bay Area Discrete Math Day, St. Mary's University of California, October, 2017.
  • Detecting properties of groups, Special session on Computable Structure Theory, ASL North American Annual Meeting, March 2017.
  • Quantum Algorithms, USF Mathematics Colloquium, October 2016.
  • Survey of quantum computation & applications, Sonoma State University Computer Science Colloquium, February 2016
  • Complexity of the distance function on computable graphs, George Mason University Mathematics Colloquium, November 2015.
  • Spectra of describable relations, Special session on Computable Structure Theory, AMS Eastern Sectional Meeting, March 14, 2015.
  • Algorithmic complexity of orderings of groups, Conference on Knot Theory and Its Applications to Physics and Quantum Computing, January, 2015.
  • Understanding unsolvability: Impossible questions about simple structures, USF Faculty Seminar Series, April 24, 2014.
  • Short course on algorithmic learning theory, at Two weeks at Waterloo, a summer school for women in math, August, 2014.
  • Special Session on Computability & Complexity at the AMS Spring Sectional Meeting, University of Hawaii, March, 2012.
  • Special Session on Algebraic Structures and Computability at the Asian Logic Conference, Victoria University of Wellington, December 2011.
  • Logic Seminar, Penn State University, November, 2011.
  • Algorithmic properties of orderings on groups, Workshop on Computability Theory 2010, Ponta Delgada, Portugal, July 5–6, 2010.
  • Quantum computing today, Special Lecture Series in Computer Science, University of San Francisco, April 29, 2010.
  • Unsolvability in mathematics, USF Mathematics Colloquium, University of San Francisco, March 31, 2010.
  • Basic notions in quantum computing, guest lecture in Computational Complexity course/seminar, George Washington University, Washington, D.C., March 24, 2010.
  • Computability and ordered groups, SouthEastern Atlantic Logic Symposium, University of Florida, Gainesville, February 27–28, 2010.
  • Degree spectra of relations, Berkeley Logic Colloquium, February 12, 2010.
  • Unsolvability in mathematics, Sonoma State University Colloquium, November 4, 2009.
  • Computability, topology, and ordered groups, Mathematics Colloquium at the University of Texas at Dallas, October 13, 2009.
  • Recursive model theory and degree spectra of relations (in two parts), University of California, Berkeley, Recursion Theory Seminar, September 28 and October 5, 2009.
  • Computable partitions of trees, ASL Logic Colloquium, July 31–August 5, 2009, Sofia, Bulgaria.
  • Ordered structures and computability, Dissertation defense, GWU Math Seminar Room, Monroe Hall, Room 267, 2115 G St., NW, Washington D.C., May 7, 2009.
  • Computable groups and their orderings. Special session on Orderings in Logic and Topology at the AMS 2009 National Meeting, Washington D.C., January 8, 2009.
  • Contructing fractals. School Without Walls High School, Washington, D.C., November 24, 2008.
  • Computability theoretic properties of relations on structures. University of Maryland Logic Seminar in College Park, MD, October 21, 2008.
  • Computable partitions of trees. Special Session on Computability Theory and Effective Algebra at the 2008 AMS Eastern Section meeting at Wesleyan College, 11-12 October 2008.
  • Algorithmic properties of relations on structures. Model Theory Seminar at CUNY, New York, NY, October 10, 2008.
  • Computability, topology, and ordered groups (in several parts). GWU Logic Seminar, September 11, 25, and October 2, 2008.
  • Turing and strong degree spectra of relations. Southern Wisconsin Logic Colloquium at University of Wisconsin, Madison, September 15, 2008.
  • Computability and model theory. GWU Graduate Student Seminar, September 12, 2008.
  • Degree spectra of successor in linear orderings (poster). Conference for Women in Mathematics at the City University of New York, May 2, 2008.
  • Computability and the successor relation in linear orderings.  George Mason University Colloquium, Friday, February 22, 2008, 3:30-4:30pm.
  • Computability and Buttsworth's group I and II. Logic/Topology Seminar, Thursday, February 7 and 21, 2008, 4-5pm, Seminar Room.
  • Effectively closed sets in Cantor space. NSF workshop on knots and quantum computing at University of Texas, Dallas, December 18-20, 2007.
  • Effectively closed sets and orderings of groups. Knots in Washington XXV at George Washington University, December 7-9, 2007.
  • Computability and spaces of orderings of groups. Howard University Graduate Student Seminar, November 19, 2007.
  • Degree spectra of successor in linear orderings. Special Session on Advances in Algorithmic Methods for Algebraic Structures, 2007 Fall Southeastern AMS Sectional Meeting at Middle Tennessee State University, November 3-4, 2007.
  • An algorithmic approach to linear orderings. GWU Graduate Student Seminar, October 25, 2007.
  • Degree spectra of the successor relation, September 7, 2007. Logic Seminar at George Washington University.
  • Strong degree spectra of initial segments of scattered linear orderings, June 21, 2007.Computablility in Europe 2007, Siena, Italy.
  • An introduction to Kolmogorov complexity, April 20, 2007. Logic Seminar at George Washington University.
  • Solvability and tractability, April 10, 2007.  Dean's Seminar for freshman at George Washington University.
  • Strong reducibilities, scattered linear orders, ranked sets, and Kolmogorov complexity, March 17, 2007. Second Graduate Student Logic Conference at St. John's University, New York, NY.
  • An application of algorithmic information theory, March 9, 2007.  Graduate Student Seminar at George Washington University.
  • The infinitely complex, November 14 and 29, 2006.  Dean's Seminar at George Washington University.  
  • Computability and Vaughtian models, September 28, 2006.  Logic Seminar at George Washington University.
  • Continuous logic, September 22, 2006. Logic Seminar at George Washington University.
  • Uncertain reasoning, September 15, 2006. Logic Seminar at George Washington University.
  • Spaces of orderings of semigroups, March 21, 2006. Joint Logic/Topology Seminar at George Washington University.
  • Recovering structures from their semigroups of partial automorphisms, March 16, 2006. SouthEastern Logic Symposium (SEALS) at the University of Florida, Gainesville.
  • Computational complexity, February 21, 2006.  Dean's Seminar for freshmen at George Washington University.
  • Computability and Ramsey's Theorem on trees, December 14, 2005.  Ph.D. Specialty Exam Lecture at George Washington University.
  • New results on algorithmic degree spectra of relations on structures, October 7, 2005.  Logic Seminar at George Washington University.
  • Maximal sets, February 4, 2005. Logic Seminar at George Washington University.
  • Constructing minimal Turing degrees using function trees, April 23, 2004. Logic Seminar at George Washington University.
  • The priority method, October 24, 2003.  Logic Seminar at George Washington University.
complexification
create 

counter