A new analysis of the length of bad sequences over $(\mathbb{N}^k,\leq)$, improving on earlier results and providing upper bounds that are essentially tight.Expand

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.Expand

We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump in terms of Kolmogorov complexity for sets of natural numbers.Expand

We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump- traceability and @w-r.Expand

Many experimental setups in quantum physics use pseudorandomness in places where the theory requires randomness. In this Letter we show that the use of pseudorandomness instead of proper randomness… Expand

The present work investigates several questions from a recent survey of Miller and Nies related to Chaitin's @W numbers and their dependence on the underlying universal machine.Expand

We investigate the expressive power of memory logics. These are modal logics extended with the possibility to store (or remove) the current node of evaluation in (or from) a memory, and to perform… Expand