Research

Director of GLyC - Logic, Language and Computability Research Group.

Research interests:

• Algorithmic randomness
• Computability theory
• Kolmogorov complexity
• Algorithmic information theory
• Modal logics

Publications

• Carlos Areces, Diego Figueira, Santiago Figueira and Sergio Mera. The Expressive Power of Memory Logics. The Review of Symbolic Logic. 4(2), 290-318, 2011
• Carlos Areces, Santiago Figueira and Daniel Gorín. Using Logic in the Generation of Referring Expressions. In LACL 2011 (Logical Aspects of Computational Linguistics), volume 6736 of Lecture Notes in Artificial Intelligence, pages 17-32, 2011.
• Diego Figueira, Santiago Figueira, Sylvain Schmitz and Philippe Schnoebelen. Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. LICS (Logic in Computer Science), 269-278, 2011.
• Carlos Areces, Facundo Carreiro, Santiago Figueira and Sergio Mera. Basic Model Theory for Memory Logics. In WoLLIC 2011 (Workshop of Logic, Languages, Information and Computation, volume 6642 of Lecture Notes in Computer Science, pages 20-34, 2011.
• Santiago Figueira, Daniel Gorín and Rafael Grimson. On the Expressive Power of IF-Logic with Classical Negation. In WoLLIC 2011 (Workshop of Logic, Languages, Information and Computation), volume 6642 of Lecture Notes in Computer Science, pages 135-145, 2011.
• Santiago Figueira and Daniel Gorín. On the size of shortest modal descriptions. Advances in Modal Logic 8:114-132, 2010.
• Santiago Figueira, Denis Hirschfeldt, Joseph S. Miller, Keng Meng Ng and André Nies. Counting the Changes of Random Δ⁰₂ Sets. In CiE 2010 (Computability in Europe), volume 6158 of Lecture Notes in Computer Science, pages 162-171, 2010.
• Santiago Figueira, Daniel Gorín and Rafael Grimson. On the formal semantics of IF-like logics. Journal of Computer and System Sciences, 76(5):333-436, 2010.
• Santiago Figueira, Joseph S. Miller and André Nies. Indifferent sets. Journal of Logic and Computation, 19(2):425-443, 2009.
• Carlos Areces, Santiago Figueira and Sergio Mera. Completeness results for Memory Logics. In LFCS 2009 (Symposium on Logical Foundations of Computer Science), volume 5407 of Lecture Notes in Computer Science, pages 16-30, 2009.
• Carlos Areces, Diego Figueira, Santiago Figueira and Sergio Mera. Expressive power and decidability for memory logics. In WoLLIC 2008 (Workshop of Logic, Languages, Information and Computation), volume 5110 of Lecture Notes in Computer Science, pages 56-68, 2008.
• Benjamín René Callejas Bedregal and Santiago Figueira. On the computing power of fuzzy Turing machines. Fuzzy Sets and Systems, 159(9):1072-1083, 2008.
• Santiago Figueira, André Nies and Frank Stephan. Lowness properties and approximations of the jump. Annals of Pure and Applied Logic, 152(1-3):51-66, 2008.
• Verónica Becher, Santiago Figueira and Rafael Picchi. Turing's unpublished algorithm for normal numbers. Theoretical Computer Science, 377(1-3):126-138, 2007.
• Santiago Figueira, Frank Stephan and Guohua Wu. Randomness and universal machines. Journal of Complexity, 22(6):738-751, 2006.
• Verónica Becher, Santiago Figueira, Serge Grigorieff and Joseph S. Miller. Randomness and halting probabilities. The Journal of Symbolic Logic, 71(4):1411-1430, 2006.
• Benjamín René Callejas Bedregal and Santiago Figueira. Classical computability and fuzzy Turing machines. In LATIN 2006 (Theoretical Informatics: 7th Latin American Symposium), volume 3887 of Lecture Notes in Computer Science, pages 154-165, 2006.
• Verónica Becher, Santiago Figueira, André Nies and Silvana Picchi. Program size complexity for possibly infinite computations. Notre Dame Journal of Formal Logic, 46(1):51-64, 2005.
• Verónica Becher and Santiago Figueira. Kolmogorov complexity for possibly infinite computations. Journal of Logic, Language and Information, 14(2):133-148, 2005.
• Verónica Becher and Santiago Figueira. An example of a computable absolutely normal number. Theoretical Computer Science, 270:947-958, 2002.

PhD thesis

Aspects of Randomness
Advisor: Verónica Becher (Department of Computer Science, University of Buenos Aires)
Co-advisor: André Nies (Department of Computer Science, The University of Auckland)

Science popularization talks (in Spanish)

• Aleatoriedad y Computabilidad, VI Jornadas de Ciencias de la Computación, Universidad Nacional de Rosario, 2008.
• Computando lo Áspero. ¿Por qué se cuelgan las computadoras?, semana de la computación, Departamento de Computación, FCEyN, Universidad de Buenos Aires, 2007.
• Aleatoriedad y anti-aleatoriedad, ciclo de charlas almorzando con, Departamento de Computación, FCEyN, Universidad de Buenos Aires, 2006.
• Problemas fáciles, difíciles y muy difíciles, semana de la computación, Departamento de Computación, FCEyN, Universidad de Buenos Aires, 2006.
• El método infalible para ganar a la ruleta, charla de borrachos, Departamento de Computación, FCEyN, Universidad de Buenos Aires, 2005.

Notes

• Lecture slides of Computability Theory, Computer Science Department, 1st semester 2010.
• Lecture slides of Logic and Computability, Computer Science Department, 2nd semester 2010.
• Lecture slides of Algorithms and Data Structures I, Computer Science Department, 2008.

Links

• European Masters Program in Language and Communication Technologies (LCT)
• Course on Computability Theory, Department of Computer Science, University of Buenos Aires, 2011