#### Filter Results:

- Full text PDF available (45)

#### Publication Year

1981

2017

- This year (4)
- Last 5 years (9)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
- STACS
- 2006

Several classes of diagonally non-recursive (DNR) functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of the initial segments of A. Furthermore, A can Turing compute a DNR function iff there is a… (More)

- Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan
- IEEE Conference on Computational Complexity
- 2001

In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in linear exponential time. We determine the dimension of various classes related to fundamental structural properties including different types of autoreducibility and immunity. By a new… (More)

- Laurent Bienvenu, Wolfgang Merkle
- ICALP
- 2007

While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor, for short, has to map a word to a unique code for this word in one shot, whereas with the standard notions of Kolmogorov complexity a word has many different codes and the minimum… (More)

- Wolfgang Merkle
- IEEE Conference on Computational Complexity
- 2003

We observe that known results on the Kolmogorov complexity of prefixes of effectively stochastic sequences extend to corresponding random sequences. First, there are recursively random random sequences such that for any nondecreasing and unbounded computable function f and for almost all n, the uniform complexity of the length n prefix of the sequence is… (More)

- Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan
- Ann. Pure Appl. Logic
- 2005

An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounded gain in the limit while betting successively on bits of X . A sequence X is KL-stochastic if there is no computable non-monotonic selection rule that selects from X an infinite,… (More)

- Wolfgang Merkle
- J. Symb. Log.
- 2002

- Wolfgang Merkle, Nenad Mihailovic
- MFCS
- 2002

- Todd Ebert, Wolfgang Merkle, Heribert Vollmer
- Electronic Colloquium on Computational Complexity
- 2000

A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries its oracle at the current input, outputs either A(x) or a don’t-know symbol on any given input x, and outputs A(x) for infinitely many x. If in addition the oracle Turing machine terminates… (More)

- Laurent Bienvenu, Wolfgang Merkle
- Electr. Notes Theor. Comput. Sci.
- 2007

Any notion of effective randomness that is defined with respect to arbitrary computable probability measures canonically induces an equivalence relation on such measures for which two measures are considered equivalent if their respective classes of random elements coincide. Elaborating on work of Bienvenu [1], we determine all the implications that hold… (More)

- Rupert Hölzl, Wolfgang Merkle
- IFIP TCS
- 2010

We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncomputable sets or complex and autocomplex sets. We review known notions and results that appear in the literature in different contexts, put them into perspective and provide simplified or at… (More)