| [spanish] | |
|
Office 14 |
 |
Research
Director of GLyC - Logic, Language and Computability Research Group.
Research interests:
- Algorithmic randomness
- Kolmogorov complexity
- Computability theory
- Algorithmic information theory
- Modal logics
Publications
- 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.
- Santiago Figueira, Daniel Gorín and Rafael Grimson. On the formal semantics of IF-like logics. In WoLLIC 2008 (Workshop of Logic, Languages, Information and Computation), volume 5110 of Lecture Notes in Computer Science, pages 164-178, 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
Adviser: Verónica Becher (Department of Computer Science, University of Buenos Aires)
Co-adviser: 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
- Class slides on Logic and Computability, Computer Science Department, 2nd semester 2009.
- Class slides on Algorithms and Data Structures I, Computer Science Department, 2008.