| 63 |
A. Nies, J. Reimann:
A lower cone in the wtt degrees of non-integral effective dimension
Download PDF-File
Abstract |
| 62 |
R. Beigel, L. Fortnow, F. Stephan:
Infinitely-Often Autoreducible Sets
Download PS-File
Abstract |
| 61 |
K. Ambos-Spies, E. Busse:
Automatic Forcing and Genericity:On the Diagonalization Strength of Finite Automata
Download PS-File
Abstract |
| 60 |
R.G. Downey, D.R. Hirschfeldt, A. Nies, F. Stephan:
Trivial Reals
Download PS-File
Abstract |
| 59 |
S. Jain, W. Menzel, F. Stephan:
Classes with Easily Learnable Subclasses
Download PS-File
Abstract |
| 58 |
F. Stephan:
Martin-Löf Random and PA-complete Sets
Download PS-File
Abstract |
| 57 |
W. Merkle, F. Stephan:
Trees and Learning
Download PS-File
Abstract |
| 56 |
S. Jain, F. Stephan:
Learning by Switching Type of Information
Download PS-File
Abstract |
| 55 |
V.S. Harizanov, F. Stephan:
On the Learnability of Vector Spaces
Download PS-File
Abstract |
| 54 |
S. Jain, F. Stephan, S.A. Terwijn:
Counting Extensional Differences in BC-Learning
Download PS-File
Abstract |
| 53 |
S. Jain, F. Stephan:
A Tour of Robust Learning
Download PS-File
Abstract |
| 52 |
W. Merkle, F. Stephan:
Refuting Learning Revisited
Download PS-File
Abstract |
| 51 |
S. Jain, F. Stephan:
Learning How to Separate
Download PS-File
Abstract |
| 50 |
K. Ambos-Spies, J. Reimann (Hg.):
Workshop Computability and Models, Heidelberg, 18.-20.
Januar 2001
Download PS-File
Download PDF-File
Abstract
|
| 49 |
E. Martin, A. Sharma, F. Stephan:
Learning Power and Language Expressiveness
Download PS-File
Abstract |
| 48 |
K. Ambos-Spies, W. Merkle, J. Reimann, S.A. Terwijn:
Almost Complete Sets
Download PS-File
Abstract |
| 47 |
K. Ambos-Spies, A. Kucera:
Randomness in Computability Theory
Download PS-File
Abstract |
| 46 |
F. Stephan:
Degrees of Computing and Learning (Habilitationsschrift)
Download PS-File
Abstract |
| 45 |
K. Ho, F. Stephan:
Simple sets and strong reducibilities
Download PS-File
Abstract |
| 44 |
K. Ambos-Spies, B. Borchert, W. Merkle, J. Reimann,
F. Stephan:
38.
Workshop über Komplexitätstheorie, Datenstrukturen und effiziente
Algorithmen
Download PS-File
Abstract |
| 43 |
B. Borchert, R. Silverstri:
Dot
Operators
Download PS-File
Abstract |
| 42 |
W. Merkle, Y. Wang:
Separation by Random Oracles and Almost Classes for
Generalized Reducibilities
Download PS-File
Abstract |
| 41 |
K. Ambos-Spies, L. Bentzien, P. A. Fejer, W. Merkle,
F. Stephan:
Collapsing Polynomial-Time Degrees
Download PS-File
Abstract |
| 40 |
J. Case, S. Jain, S. Kaufmann, A. Sharma, F.
Stephan:
Predictive Learning Models for Concept Drift
Download PS-File
Abstract |
| 39 |
F. Stephan, S. A. Terwijn:
The
Complexity of Universal Text-Learners
Download PS-File
Abstract |
| 38 |
K. Ambos-Spies:
A
Note on recursively Approximable Real Numbers
Download PS-File
Abstract |
| 37 |
A. Morozov:
On
Sigma-definability of admissible sets
Download PS-File
Abstract |
| 36 |
A. Morozov:
Groups of Sigma-permuations of Admissible Ordinals
Download PS-File
Abstract |
| 35 |
A. Nies:
Coding Methods in Computability Theory and Complexity
Theory (Habilitationsschrift)
Download PS-File
Abstract |
| 34 |
F. Stephan, Y. Ventsov:
Learning Algebraic Structures from Text
Download PS-File
Abstract |
| 33 |
W. Merkle:
Lattice Embeddings for Bounded Reducibilities
Download PS-File
Abstract |
| 32 |
W. Gasarch, F. Stephan:
A
Techniques-Oriented Survey of Bounded Queries
Download PS-File
Abstract |
| 31 |
A. Morozov:
On
Recovering Turing Degrees from Quotients of their Permutation Groups
Download PS-File
Abstract |
| 30 |
K. Ambos-Spies, L. Bentzien:
Separating NP-Completeness Notions under Strong
Hypotheses
Download PS-File
Abstract |
| 29 |
F. Stephan:
On
the Structures Inside Truth-Table Degrees
Download PS-File
Abstract |
| 28 |
K. Ambos-Spies, J. Reimann:
Effective Baire Category Concepts
Download PS-File
Abstract |
| 27 |
W. Merkle:
Structural Properties of Bounded Relations with an
Application to NP Optimization Problems
Download PS-File
Abstract |
| 26 |
S. Kaufmann, F. Stephan:
Robust Learning with Infinite Additional Information
Download PS-File
Abstract |
| 25 |
F. Stephan:
On
One-Sided Versus Two-Sided Classification
Download PS-File
Abstract |
| 24 |
W. Merkle:
Exact Pairs for Bounded Reducibilities
Download PS-File
Abstract |
| 23 |
B. Borchert, F. Stephan:
Looking for an Analogue of Rice's Theorem in Complexity
Theory
Download PS-File
Abstract |
| 22 |
K. Ambos-Spies, E. Mayordomo:
Resource-Bounded Measure and Randomness
Download PS-File
Abstract |
| 20 |
F. Stephan:
Learning via Queries and Oracles
Download PS-File
Abstract |
| 19 |
F. Stephan:
Noisy Inference and Oracles
Download PS-File
Abstract |
| 18 |
B. Borchert, D. Ranjan, F. Stephan:
On
the Computational Complexity of some Classical Equivalence Relations on
Boolean Functions
Download PS-File
Abstract |
| 17 |
B. Borchert, A. Lozano:
Succinct Circuit Representations and Leaf Languages are
Basically the same Concept
Download PS-File
Abstract |
| 16 |
K. Ambos-Spies:
Resource Bounded Genericity
Abstract |
| 15 |
K. Ambos-Spies, S. A. Terwijn, X. Zheng:
Resource Bounded Randomness and Weakly Complete Problems
Abstract |
| 14 |
V. Selivanov:
Fine
Hierarchy of Regular omega-Languages
Abstract |
| 13 |
V. Selivanov:
Precomplete Numerations with Applications
Abstract |
| 12 |
K. Ambos-Spies:
On
Optimal Polynomial Time Approximations
Abstract |
| 11 |
K. Ambos-Spies, H.-C. Neis, S. A. Terwijn:
Genericity and Measure for Exponential Time
Abstract |
| 10 |
V. Selivanov:
On
Recursively Enumerable Structures
Abstract |
| 9 |
V. Selivanov:
Refining the Polynomial Hierarchy
Abstract |
| 8 |
S. Lempp, A. Nies:
The
Undecidability of the Pi-4-theory for the r.e. wtt- and Turing-degrees
Abstract |
| 7 |
B. Borchert:
Predicate Classes and Promise Classes
Download PS-File
Abstract |
| 6 |
B. Borchert:
On
the Acceptance Power of Regular Languages
Download PS-File
Abstract |
| 5 |
V. Selivanov:
Fine
Hierarchies and Boolean Terms
Abstract |
| 4 |
A. Nies:
Undecidable Fragments of Elementary Theories
Abstract |
| 3 |
B. Borchert:
The Complexity of Mind Changes
Download PS-File
Abstract |
| 2 |
A. Nies:
The
Model Theory of the Structure of Recursively Enumerable Many-One Degrees
Abstract |
| 1 |
K. Ambos-Spies, D. Ding:
Discontinuity of Cappings in the Recursively Enumerable
Degrees and Strongly Nonbranching Degrees
Abstract |
