#### Filter Results:

- Full text PDF available (39)

#### Publication Year

2002

2017

- This year (4)
- Last 5 years (19)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Santiago Figueira, André Nies, Frank Stephan
- Electr. Notes Theor. Comput. Sci.
- 2006

We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceab-ility and super-lowness for sets of natural numbers. A computable non-decreasing unbounded function h is called an order function. Informally, a set A is strongly jump-traceable if for each order… (More)

- Sergio Abriola, Santiago Figueira, Gabriel Senno
- WoLLIC
- 2012

Well quasi-orders (wqo's) are an important mathematical tool for proving termination of many algorithms. Under some assumptions upper bounds for the computational complexity of such algorithms can be extracted by analyzing the length of controlled bad sequences. We develop a new, self-contained study of the length of bad sequences over the product ordering… (More)

Consider a Martin-Löf random ∆ 0 2 set Z. We give lower bounds for the number of changes of Zs n for computable approximations of Z. We show that each nonempty Π 0 1 class has a low member Z with a computable approximation that changes only o(2 n) times. We prove that each superlow ML-random set already satisfies a stronger randomness notion called balanced… (More)

- Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen
- 2011 IEEE 26th Annual Symposium on Logic in…
- 2011

Dickson's Lemma is a simple yet powerful tool widely used in decidability proofs, especially when dealing with counters or related data structures in algorithmics, verification and model-checking, constraint solving, logic, etc. While Dickson's Lemma is well-known, most computer scientists are not aware of the complexity upper bounds that are entailed by… (More)

- Santiago Figueira, Frank Stephan, Guohua Wu
- CCA
- 2005

The present work investigates several questions from a recent survey of Miller and Nies related to Chaitin's Ω numbers and their dependence on the underlying universal machine. It is shown that there are universal machines for which Ω U is just x 2 1−H(x). For such a universal machine there exists a co-r.e. set X such that Ω U [X] = p:U (p)↓∈X 2 −|p| is… (More)

- Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller
- J. Symb. Log.
- 2006

We consider the question of randomness of the probability Ω U [X] that an optimal Turing machine U halts and outputs a string in a fixed set X.

- Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi
- Notre Dame Journal of Formal Logic
- 2005

We define a program size complexity function H ∞ as a variant of the prefix-free Kolmogorov complexity, based on Turing monotone machines performing possibly unending computations. We consider definitions of randomness and triviality for sequences in {0, 1} ω relative to the H ∞ complexity. We prove that the classes of Martin-Löf random sequences and H… (More)

- Santiago Figueira, Joseph S. Miller, André Nies
- J. Log. Comput.
- 2009

We define the notion of indifferent set with respect to a given class of {0, 1}-sequences. Roughly, for a set A in the class, a set of natural numbers I is indifferent for A with respect to the class if it does not matter how we change A at the positions in I: the new sequence continues to be in the given class. We are especially interested in studying… (More)

- Benjamín R. C. Bedregal, Santiago Figueira
- Fuzzy Sets and Systems
- 2008

We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively enumerable (r.e.) sets and universality. FTMs are first regarded as acceptors. It has recently been shown by J. Wiedermann that these machines have more computational power than… (More)

- Verónica Becher, Santiago Figueira
- Theor. Comput. Sci.
- 2002

The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive reformulation of Sierpinski's construction which produces a computable absolutely normal number.