The Buenos Aires Semester in Computability, Complexity and Randomness will be an international gathering of Mathematicians and Computer Scientists from January to June 2013. It will be held at the Departamento de Computación, Facultad de Ciencias Exactas y Naturales de la Universidad de Buenos Aires. We anticipate between eight and ten researchers will be in residence for the entire period, accompanied by a similar number of graduate students. We also expect shorter visits, of two to four weeks, by another eight to ten researchers. There will be an intense and sustained research effort in computability theory, randomness, computable structures and reverse mathematics. The semester will bring together many of the area's most active researchers over an extended interval, allowing for a level of collaboration that is not usually possible and the accelerated progress that arises from such continuous interaction. In addition to the research effort, there will be a focus on training graduate students and disseminating recent research. We will organize a graduate-level course on Combinatorics, Complexity and Logic taught by Ted Slaman; a topics seminar in which all of the long term participants, including the graduate students, will take turns presenting advanced material; a weekly seminar on individual research interests and related open problems; and a regional seminar that will feature South American logicians. The NSF funding will primarily be used to support the participation of junior US researchers: graduate students, postdoctoral fellows, and junior faculty.
was an international gathering of mathematicians and computer scientists that took place from January 8 to June 28, 2013 in Buenos Aires, Argentina. It was hosted by the Departartment of Computer Science at the University of Buenos Aires. The focus was on topics in computability theory, randomness, computable structures, and reverse mathematics, with an eye towards conceptual and practical computational applications. It counted a total of 45 participants from 15 countries. Activities consisted of a graduate-level course on Combinatorics, Complexity, and Logic taught by Ted Slaman (UC Berkeley); a twice weekly topics seminar, which allowed speakers to go in-depth over several sessions; and a weekly seminar on individual research interests and related open problems. Most of the schedule was open for small-group research. Twelve graduate students participated in the semester, almost all for a significant portion of the program. At any given time, they made up about half of the participants. In addition to the graduate course, the graduate students attended both seminars, and in fact, most of them spoke in the individual seminar. The program gave them a great deal of exposure to established researchers and active research. This grant allowed several people to participate who would not otherwise have been able to, which was important to the success of the semester. It gave substantial support to four of the graduate students who participated in the program, and minor support to two others. It also supported the travel of eight of the short term participants, four of whom were postdoctoral fellows at the time.
