
Search the dblp DataBase
Santiago Figueira:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Santiago Figueira, Frank Stephan, Guohua Wu
Randomness and Universal Machines. [Citation Graph (0, 0)][DBLP] CCA, 2005, pp:103116 [Conf]
 Benjamín René Callejas Bedregal, Santiago Figueira
Classical Computability and Fuzzy Turing Machines. [Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:154165 [Conf]
 Santiago Figueira, André Nies, Frank Stephan
Lowness Properties and Approximations of the Jump. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:4557 [Journal]
 Santiago Figueira, Frank Stephan, Guohua Wu
Randomness and universal machines. [Citation Graph (0, 0)][DBLP] J. Complexity, 2006, v:22, n:6, pp:738751 [Journal]
 Verónica Becher, Santiago Figueira
Kolmogorov Complexity for Possibly Infinite Computations. [Citation Graph (0, 0)][DBLP] Journal of Logic, Language and Information, 2005, v:14, n:2, pp:133148 [Journal]
 Verónica Becher, Santiago Figueira
An example of a computable absolutely normal number. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:270, n:12, pp:947958 [Journal]
 Verónica Becher, Santiago Figueira, Rafael Picchi
Turing's unpublished algorithm for normal numbers. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:377, n:13, pp:126138 [Journal]
Counting the Changes of Random D^{0}_{2}{\Delta^0_2} Sets. [Citation Graph (, )][DBLP]
Completeness Results for Memory Logics. [Citation Graph (, )][DBLP]
On the Formal Semantics of IFLike Logics. [Citation Graph (, )][DBLP]
Expressive Power and Decidability for Memory Logics. [Citation Graph (, )][DBLP]
Lowness properties and approximations of the jump. [Citation Graph (, )][DBLP]
The Question of Expressiveness in the Generation of Referring Expressions [Citation Graph (, )][DBLP]
Ackermann and PrimitiveRecursive Bounds with Dickson's Lemma [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs
