| 2009 |
|---|
| 12 | EE | Carlos Areces,
Santiago Figueira,
Sergio Mera:
Completeness Results for Memory Logics.
LFCS 2009: 16-30 |
| 2008 |
|---|
| 11 | EE | Santiago Figueira,
Daniel Gorín,
Rafael Grimson:
On the Formal Semantics of IF-Like Logics.
WoLLIC 2008: 164-178 |
| 10 | EE | Carlos Areces,
Diego Figueira,
Santiago Figueira,
Sergio Mera:
Expressive Power and Decidability for Memory Logics.
WoLLIC 2008: 56-68 |
| 9 | EE | Santiago Figueira,
André Nies,
Frank Stephan:
Lowness properties and approximations of the jump.
Ann. Pure Appl. Logic 152(1-3): 51-66 (2008) |
| 8 | EE | Benjamín René Callejas Bedregal,
Santiago Figueira:
On the computing power of fuzzy Turing machines.
Fuzzy Sets and Systems 159(9): 1072-1083 (2008) |
| 2007 |
|---|
| 7 | EE | Verónica Becher,
Santiago Figueira,
Rafael Picchi:
Turing's unpublished algorithm for normal numbers.
Theor. Comput. Sci. 377(1-3): 126-138 (2007) |
| 2006 |
|---|
| 6 | EE | Benjamín René Callejas Bedregal,
Santiago Figueira:
Classical Computability and Fuzzy Turing Machines.
LATIN 2006: 154-165 |
| 5 | EE | Santiago Figueira,
André Nies,
Frank Stephan:
Lowness Properties and Approximations of the Jump.
Electr. Notes Theor. Comput. Sci. 143: 45-57 (2006) |
| 4 | EE | Santiago Figueira,
Frank Stephan,
Guohua Wu:
Randomness and universal machines.
J. Complexity 22(6): 738-751 (2006) |
| 2005 |
|---|
| 3 | | Santiago Figueira,
Frank Stephan,
Guohua Wu:
Randomness and Universal Machines.
CCA 2005: 103-116 |
| 2 | EE | Verónica Becher,
Santiago Figueira:
Kolmogorov Complexity for Possibly Infinite Computations.
Journal of Logic, Language and Information 14(2): 133-148 (2005) |
| 2002 |
|---|
| 1 | EE | Verónica Becher,
Santiago Figueira:
An example of a computable absolutely normal number.
Theor. Comput. Sci. 270(1-2): 947-958 (2002) |
