• Publications
  • Influence
An example of a computable absolutely normal number
TLDR
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability. Expand
  • 67
  • 9
  • PDF
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
TLDR
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
  • 113
  • 8
  • PDF
On the computing power of fuzzy Turing machines
TLDR
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
  • 28
  • 6
  • PDF
Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable.
TLDR
We study pairs of nonlocal boxes that produce their outputs deterministically. Expand
  • 12
  • 5
  • PDF
Lowness properties and approximations of the jump
TLDR
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
  • 29
  • 4
  • PDF
Lowness Properties and Approximations of the Jump
TLDR
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
  • 22
  • 3
  • PDF
Feasible Analysis, Randomness, and Base Invariance
TLDR
We show that polynomial time randomness of a real number does not depend on the choice of a base for representing it. Expand
  • 18
  • 3
  • PDF
Algorithmic Pseudorandomness in Quantum Setups.
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 randomnessExpand
  • 8
  • 3
  • PDF
Randomness and universal machines
TLDR
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
  • 26
  • 2
  • PDF
The Expressive Power of Memory Logics
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 performExpand
  • 22
  • 2
  • PDF
...
1
2
3
4
5
...