| Publication | Date of Publication | Type |
|---|
A bisection approach to subcubic maximum induced matching
| 2024-07-19 | Paper |
Pumping, with or without choice
| 2024-04-19 | Paper |
Learnability and positive equivalence relations
Information and Computation | 2024-02-02 | Paper |
Word automatic groups of nilpotency class 2
Information Processing Letters | 2023-10-12 | Paper |
Alternating automatic register machines
Lecture Notes in Computer Science | 2023-07-28 | Paper |
Addition machines, automatic functions and open problems of Floyd and Knuth
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Languages given by Finite Automata over the Unary Alphabet
| 2023-02-13 | Paper |
scientific article; zbMATH DE number 7650940 (Why is no real title available?)
| 2023-02-07 | Paper |
Measure and Conquer for Max Hamming Distance XSAT
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650314 (Why is no real title available?)
| 2023-02-03 | Paper |
String compression in FA-presentable structures
Theoretical Computer Science | 2023-02-01 | Paper |
On the classification of computable languages
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Lamplighter groups and automata
Acta Informatica | 2022-08-30 | Paper |
Random Subgroups of Rationals
| 2022-07-21 | Paper |
Members of thin \(\Pi_1^0\) classes and generic degrees
Proceedings of the American Mathematical Society | 2022-06-15 | Paper |
A computation model with automatic functions and relations as primitive operations
Theoretical Computer Science | 2022-06-13 | Paper |
Deciding Parity Games in Quasi-polynomial Time
SIAM Journal on Computing | 2022-05-03 | Paper |
Learners based on transducers
Information and Computation | 2022-03-14 | Paper |
An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs
| 2022-01-10 | Paper |
Randomness and initial segment complexity for measures
Theoretical Computer Science | 2021-12-22 | Paper |
On the amount of nonconstructivity in learning formal languages from text
Information and Computation | 2021-11-25 | Paper |
Bi-immunity over different size alphabets
Theoretical Computer Science | 2021-11-11 | Paper |
Improved algorithms for the general exact satisfiability problem
Theoretical Computer Science | 2021-10-06 | Paper |
Learnability and positive equivalence relations
| 2021-10-04 | Paper |
members of thin $\Pi_1^0$ classes and generic degrees
| 2020-08-11 | Paper |
Closure of resource-bounded randomness notions under polynomial-time permutations
| 2020-08-05 | Paper |
Ordered semiautomatic rings with applications to geometry
| 2020-07-27 | Paper |
On the order dimension of locally countable partial orderings
Proceedings of the American Mathematical Society | 2020-05-27 | Paper |
Chaitin's \(\Omega\) as a continuous function
Journal of Symbolic Logic | 2020-04-17 | Paper |
Searching for shortest and least programs
Theoretical Computer Science | 2020-01-22 | Paper |
Exact satisfiabitity with jokers
| 2019-10-15 | Paper |
Reductions between types of numberings
Annals of Pure and Applied Logic | 2019-10-07 | Paper |
The isomorphism problem for tree-automatic ordinals with addition
Information Processing Letters | 2019-09-20 | Paper |
Randomness and initial segment complexity for probability measures
| 2019-02-21 | Paper |
On the help of bounded shot verifiers, comparators and standardisers for learnability in inductive inference
| 2019-02-06 | Paper |
The complexity of verbal languages over groups
Journal of Computer and System Sciences | 2019-01-25 | Paper |
Automatic learning from repetitive texts
| 2019-01-10 | Paper |
Measure, category and learning theory
Automata, Languages and Programming | 2019-01-10 | Paper |
Depth, highness and DNR degrees
| 2018-12-10 | Paper |
On the values for factor complexity
| 2018-11-07 | Paper |
Implementing fragments of ZFC within an r.e. Universe
Journal Of Logic And Computation | 2018-09-28 | Paper |
Equivalences between learning of data and probability distributions, and their applications
Information and Computation | 2018-09-27 | Paper |
Finitely generated semiautomatic groups
Computability | 2018-09-20 | Paper |
Learning pattern languages over groups
Theoretical Computer Science | 2018-08-22 | Paper |
Learners based on transducers
Language and Automata Theory and Applications | 2018-06-26 | Paper |
Effectivity questions for Kleene's recursion theorem
Theoretical Computer Science | 2018-06-05 | Paper |
Randomness and Solovay degrees
Journal of Logic and Analysis | 2018-05-04 | Paper |
Subrecursive Approximations of Irrational Numbers by Variable Base Sums
| 2018-04-15 | Paper |
Limit-depth and DNR degrees
Information Processing Letters | 2018-04-05 | Paper |
Semiautomatic structures
Theory of Computing Systems | 2018-02-01 | Paper |
Regular patterns, regular languages and context-free languages
Information Processing Letters | 2017-11-03 | Paper |
Boolean algebras realized by c.e. equivalence relations
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-11 | Paper |
Deciding parity games in quasipolynomial time
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Automatic learning from positive data and negative counterexamples
Information and Computation | 2017-08-08 | Paper |
Automatic linear orders and trees
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
A survey on recent results on partial learning
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
The complexity of verbal languages over groups
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Weakly represented families in reverse mathematics
Computability and Complexity | 2017-04-04 | Paper |
Closed left-r.e. sets
Computability | 2017-02-23 | Paper |
Covering the recursive sets
Annals of Pure and Applied Logic | 2017-02-08 | Paper |
Inductive Inference and Reverse Mathematics
| 2017-01-24 | Paper |
Combining models of approximation with partial learning
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Priced learning
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Enlarging learnable classes
Information and Computation | 2016-11-18 | Paper |
Learning pattern languages over groups
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Inductive inference and reverse mathematics
Annals of Pure and Applied Logic | 2016-10-10 | Paper |
Finitely generated semiautomatic groups
Pursuit of the Universal | 2016-08-17 | Paper |
On Martin’s pointed tree theorem
Computability | 2016-07-25 | Paper |
Tree-automatic scattered linear orders
Theoretical Computer Science | 2016-03-31 | Paper |
Finite state incompressible infinite sequences
Information and Computation | 2016-03-10 | Paper |
On the role of update constraints and text-types in iterative learning
Information and Computation | 2016-03-10 | Paper |
Learning automatic families of languages
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Partial learning of recursively enumerable languages
Theoretical Computer Science | 2016-02-26 | Paper |
Reducibilities among equivalence relations induced by recursively enumerable structures
Theoretical Computer Science | 2015-12-15 | Paper |
Effectivity questions for Kleene's recursion theorem
Logical Foundations of Computer Science | 2015-12-11 | Paper |
On block pumpable languages
Theoretical Computer Science | 2015-12-08 | Paper |
Covering the Recursive Sets
Evolving Computability | 2015-10-20 | Paper |
Depth, highness and DNR degrees
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Arithmetic complexity via effective names for random sequences
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Graphs realised by r.e. equivalence relations
Annals of Pure and Applied Logic | 2015-06-17 | Paper |
A reducibility related to being hyperimmune-free
Annals of Pure and Applied Logic | 2015-06-17 | Paper |
Cone avoidance and randomness preservation
Annals of Pure and Applied Logic | 2015-05-15 | Paper |
On the role of update constraints and text-types in iterative learning
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Confident and consistent partial learning of recursive functions
Theoretical Computer Science | 2014-10-31 | Paper |
Things that can be made into themselves
Information and Computation | 2014-07-18 | Paper |
Semiautomatic structures
Computer Science - Theory and Applications | 2014-06-24 | Paper |
The complexity of recursive splittings of random sets
Computability | 2014-06-19 | Paper |
Algorithmic aspects of Lipschitz functions
Computability | 2014-06-19 | Paper |
Finite State Incompressible Infinite Sequences
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Anti-complex sets and reducibilities with tiny use
Journal of Symbolic Logic | 2014-04-04 | Paper |
Robust learning of automatic classes of languages
Journal of Computer and System Sciences | 2014-02-13 | Paper |
Automatic learners with feedback queries
Journal of Computer and System Sciences | 2014-02-13 | Paper |
Initial segment complexities of randomness notions
Information and Computation | 2014-02-11 | Paper |
Learning and classifying
Theoretical Computer Science | 2014-01-09 | Paper |
Automatic models of first order theories
Annals of Pure and Applied Logic | 2013-12-11 | Paper |
Editors' introduction
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Partial learning of recursively enumerable languages
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Automatic functions, linear time and learning
Logical Methods in Computer Science | 2013-09-26 | Paper |
On conservative learning of recursively enumerable languages
Lecture Notes in Computer Science | 2013-08-05 | Paper |
On automatic families
Proceedings of the 11th Asian Logic Conference | 2013-06-03 | Paper |
Selection by recursively enumerable sets
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Trivial Reals
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Automata on ordinals and automaticity of linear orders
Annals of Pure and Applied Logic | 2013-04-05 | Paper |
Highness, locally noncappability and nonboundings
Annals of Pure and Applied Logic | 2013-04-05 | Paper |
The Discrete Time Behaviour of Restricted Linear Hybrid Automata
Modern Applications of Automata Theory | 2013-02-26 | Paper |
How powerful are integer-valued martingales?
Theory of Computing Systems | 2012-12-07 | Paper |
Automatic learning of subclasses of pattern languages
Information and Computation | 2012-11-27 | Paper |
Learnability of automatic classes
Journal of Computer and System Sciences | 2012-11-06 | Paper |
Enlarging learnable classes
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Confident and Consistent Partial Learning of Recursive Functions
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Learning with ordinal-bounded memory from positive data
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Automatic functions, linear time and learning
Lecture Notes in Computer Science | 2012-08-14 | Paper |
On the amount of nonconstructivity in learning formal languages from positive data
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Learning families of closed sets in matroids
Computation, Physics and Beyond | 2012-06-15 | Paper |
Learnability of co-r.e. classes
Language and Automata Theory and Applications | 2012-06-08 | Paper |
An incomplete set of shortest descriptions
Journal of Symbolic Logic | 2012-04-19 | Paper |
Robust learning of automatic classes of languages
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Learning and classifying
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Kolmogorov complexity and the recursion theorem
Transactions of the American Mathematical Society | 2011-10-17 | Paper |
Automata on Ordinals and Linear Orders
Models of Computation in Context | 2011-09-09 | Paper |
Automatic Learners with Feedback Queries
Models of Computation in Context | 2011-09-09 | Paper |
Higher Kurtz randomness
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Relativizations of randomness and genericity notions
Bulletin of the London Mathematical Society | 2011-08-16 | Paper |
Closed left-r.e. sets
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Van Lambalgen's theorem and high degrees
Notre Dame Journal of Formal Logic | 2011-06-03 | Paper |
Automatic learning of subclasses of pattern languages
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Universal recursively enumerable sets of strings
Theoretical Computer Science | 2011-05-10 | Paper |
Representation of left-computable \(\varepsilon \)-random reals
Journal of Computer and System Sciences | 2011-04-28 | Paper |
Index sets and universal numberings
Journal of Computer and System Sciences | 2011-04-28 | Paper |
Uncountable automatic classes and learning
Theoretical Computer Science | 2011-04-14 | Paper |
Initial segment complexities of randomness notions
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
Splitting of learnable classes
Grammatical Inference: Theoretical Results and Applications | 2010-09-10 | Paper |
How powerful are integer-valued martingales?
Lecture Notes in Computer Science | 2010-07-29 | Paper |
Index sets and universal numberings
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Iterative learning of simple external contextual languages
Theoretical Computer Science | 2010-07-07 | Paper |
Schnorr trivial sets and truth-table reducibility
Journal of Symbolic Logic | 2010-06-24 | Paper |
Topological aspects of poset spaces
Michigan Mathematical Journal | 2010-06-17 | Paper |
Turing degrees and the Ershov hierarchy
| 2010-06-17 | Paper |
Learnability of automatic classes
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Numberings optimal for learning
Journal of Computer and System Sciences | 2010-05-25 | Paper |
Vacillatory and BC learning on noisy data
Lecture Notes in Computer Science | 2010-04-27 | Paper |
On ordinal VC-dimension and some notions of complexity
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Learning a subclass of regular patterns in polynomial time
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Uncountable automatic classes and learning
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Learning from streams
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Constructive dimension and Turing degrees
Theory of Computing Systems | 2009-10-19 | Paper |
Input-dependence in function-learning
Theory of Computing Systems | 2009-10-19 | Paper |
Mitotic Classes in Inductive Inference
SIAM Journal on Computing | 2009-08-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Prescribed learning of r.e. classes
Theoretical Computer Science | 2009-05-12 | Paper |
On the structure of degrees of inferability.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
\(\Pi_1^0 \) classes, LR degrees and Turing degrees
Annals of Pure and Applied Logic | 2008-12-05 | Paper |
Computable categoricity and the Ershov hierarchy
Annals of Pure and Applied Logic | 2008-12-05 | Paper |
Universal Recursively Enumerable Sets of Strings
Developments in Language Theory | 2008-10-30 | Paper |
scientific article; zbMATH DE number 5354053 (Why is no real title available?)
| 2008-10-20 | Paper |
Numberings Optimal for Learning
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Iterative Learning of Simple External Contextual Languages
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Editors’ Introduction
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Learning in Friedberg numberings
Information and Computation | 2008-08-22 | Paper |
Prescribed Learning of R.E. Classes
Lecture Notes in Computer Science | 2008-08-19 | Paper |
Learning in Friedberg Numberings
Lecture Notes in Computer Science | 2008-08-19 | Paper |
Immunity and hyperimmunity for sets of minimal indices
Notre Dame Journal of Formal Logic | 2008-06-18 | Paper |
Prescribed learning of indexed families
| 2008-06-11 | Paper |
Non-U-shaped vacillatory and team learning
Journal of Computer and System Sciences | 2008-06-10 | Paper |
Absolute versus probabilistic classification in a logical setting
Theoretical Computer Science | 2008-05-28 | Paper |
When unlearning helps
Information and Computation | 2008-05-19 | Paper |
Deduction, induction, and beyond in parametric logic
| 2008-04-29 | Paper |
Hausdorff-dimension and weak truth-table reducibility
| 2008-04-14 | Paper |
Lowness properties and approximations of the jump
Annals of Pure and Applied Logic | 2008-03-28 | Paper |
The complexity of the set of nonrandom numbers
| 2008-03-20 | Paper |
Kolmogorov complexity and the recursion theorem
Lecture Notes in Computer Science | 2008-03-19 | Paper |
Post's Programme for the Ershov Hierarchy
Journal Of Logic And Computation | 2008-02-07 | Paper |
Mitotic Classes
Learning Theory | 2008-01-03 | Paper |
Constructive Dimension and Weak Truth-Table Degrees
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Input-Dependence in Function-Learning
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Applications of Kolmogorov complexity to computable model theory
Journal of Symbolic Logic | 2007-10-17 | Paper |
Automatic Structures: Richness and Limitations
Logical Methods in Computer Science | 2007-10-11 | Paper |
Results on memory-limited U-shaped learning
Information and Computation | 2007-10-10 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Invertible classes
Theoretical Computer Science | 2007-09-28 | Paper |
Using random sets as oracles
Journal of the London Mathematical Society | 2007-09-27 | Paper |
On the data consumption benefits of accepting increased uncertainty
Theoretical Computer Science | 2007-09-18 | Paper |
Memory-Limited U-Shaped Learning
Learning Theory | 2007-09-14 | Paper |
Infinitely‐Often Autoreducible Sets
SIAM Journal on Computing | 2007-06-26 | Paper |
Hierarchies of randomness tests
| 2007-05-02 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Randomness and universal machines
Journal of Complexity | 2007-02-08 | Paper |
On the learnability of vector spaces
Journal of Computer and System Sciences | 2007-01-22 | Paper |
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science | 2007-01-09 | Paper |
On ordinal VC-dimension and some notions of complexity
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Grammatical Inference: Algorithms and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
scientific article; zbMATH DE number 5064956 (Why is no real title available?)
| 2006-10-17 | Paper |
Variations on U-shaped learning
Information and Computation | 2006-08-17 | Paper |
Enumerations of the Kolmogorov function
Journal of Symbolic Logic | 2006-08-03 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Lowness for the Class of Schnorr Random Reals
SIAM Journal on Computing | 2006-06-01 | Paper |
Identifying Clusters from Positive Data
SIAM Journal on Computing | 2006-06-01 | Paper |
Unifying logic, topology and learning in parametric logic
Theoretical Computer Science | 2006-03-20 | Paper |
Randomness, relativization and Turing degrees
Journal of Symbolic Logic | 2006-01-16 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Kolmogorov-Loveland randomness and stochasticity
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
scientific article; zbMATH DE number 2222024 (Why is no real title available?)
| 2005-11-02 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
scientific article; zbMATH DE number 2152685 (Why is no real title available?)
| 2005-04-05 | Paper |
Counting extensional differences in BC-learning
Information and Computation | 2004-11-23 | Paper |
Generalized notions of mind change complexity
Information and Computation | 2004-10-04 | Paper |
Robust learning -- rich and poor
Journal of Computer and System Sciences | 2004-10-01 | Paper |
Trees and learning
Journal of Computer and System Sciences | 2004-09-08 | Paper |
scientific article; zbMATH DE number 2084839 (Why is no real title available?)
| 2004-08-09 | Paper |
On the classification of recursive languages
Information and Computation | 2004-08-06 | Paper |
Classes with easily learnable subclasses
Information and Computation | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080659 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080665 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080660 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2063218 (Why is no real title available?)
| 2004-03-29 | Paper |
Learning by switching type of information.
Information and Computation | 2004-03-14 | Paper |
Learning how to separate.
Theoretical Computer Science | 2004-03-14 | Paper |
On one-sided versus two-sided classification
Archive for Mathematical Logic | 2003-09-16 | Paper |
scientific article; zbMATH DE number 1966621 (Why is no real title available?)
| 2003-08-18 | Paper |
scientific article; zbMATH DE number 1966619 (Why is no real title available?)
| 2003-08-18 | Paper |
scientific article; zbMATH DE number 1966620 (Why is no real title available?)
| 2003-08-18 | Paper |
scientific article; zbMATH DE number 1962844 (Why is no real title available?)
| 2003-08-11 | Paper |
Learning power and language expressiveness.
Theoretical Computer Science | 2003-05-25 | Paper |
Refuting learning revisited.
Theoretical Computer Science | 2003-05-22 | Paper |
Topological aspects of numberings
Mathematical Logic Quarterly | 2003-04-10 | Paper |
On the structures inside truth-table degrees
The Journal of Symbolic Logic | 2003-02-06 | Paper |
Learning classes of approximations to non-recursive functions.
Theoretical Computer Science | 2003-01-21 | Paper |
Learning to win process-control games watching game-masters
Information and Computation | 2003-01-14 | Paper |
The complexity of universal text-learners.
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1804101 (Why is no real title available?)
| 2002-09-22 | Paper |
Avoiding coding tricks by hyperrobust learning
Theoretical Computer Science | 2002-07-15 | Paper |
Classes bounded by incomplete sets
Annals of Pure and Applied Logic | 2002-06-24 | Paper |
Predictive learning models for concept drift
Theoretical Computer Science | 2002-03-03 | Paper |
Learning algebraic structures from text
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1678392 (Why is no real title available?)
| 2001-12-04 | Paper |
scientific article; zbMATH DE number 1670728 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1670875 (Why is no real title available?)
| 2001-11-11 | Paper |
Robust learning with infinite additional information
Theoretical Computer Science | 2001-08-20 | Paper |
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
| 2001-07-16 | Paper |
On Existentially First-Order Definable Languages and Their Relation to NP
RAIRO - Theoretical Informatics and Applications | 2000-12-06 | Paper |
scientific article; zbMATH DE number 1453045 (Why is no real title available?)
| 2000-11-07 | Paper |
scientific article; zbMATH DE number 1405575 (Why is no real title available?)
| 2000-09-20 | Paper |
Structural measures for games and process control in the branch learning model
Theoretical Computer Science | 2000-08-21 | Paper |
Vacillatory and BC learning on noisy data
Theoretical Computer Science | 2000-08-21 | Paper |
Robust learning aided by context
Journal of Computer and System Sciences | 2000-07-24 | Paper |
The complexity of ODDnA
Journal of Symbolic Logic | 2000-06-22 | Paper |
scientific article; zbMATH DE number 1400024 (Why is no real title available?)
| 2000-06-13 | Paper |
scientific article; zbMATH DE number 1453031 (Why is no real title available?)
| 2000-05-25 | Paper |
scientific article; zbMATH DE number 1420830 (Why is no real title available?)
| 2000-03-22 | Paper |
scientific article; zbMATH DE number 1301796 (Why is no real title available?)
| 2000-03-13 | Paper |
scientific article; zbMATH DE number 1301784 (Why is no real title available?)
| 2000-03-13 | Paper |
Learning via queries and oracles
Annals of Pure and Applied Logic | 2000-02-15 | Paper |
scientific article; zbMATH DE number 1301799 (Why is no real title available?)
| 1999-06-16 | Paper |
scientific article; zbMATH DE number 1261672 (Why is no real title available?)
| 1999-03-15 | Paper |
Classification using information
Annals of Mathematics and Artificial Intelligence | 1999-01-06 | Paper |
scientific article; zbMATH DE number 1088195 (Why is no real title available?)
| 1998-08-13 | Paper |
Noisy inference and oracles
Theoretical Computer Science | 1998-07-22 | Paper |
scientific article; zbMATH DE number 1114037 (Why is no real title available?)
| 1998-05-10 | Paper |
scientific article; zbMATH DE number 1104336 (Why is no real title available?)
| 1998-01-14 | Paper |
Inclusion problems in parallel learning and games
Journal of Computer and System Sciences | 1996-11-26 | Paper |
Approximable sets
Information and Computation | 1996-04-16 | Paper |
Language learning from texts: Mindchanges, limited memory and monotonicity
Information and Computation | 1996-02-26 | Paper |
Recursion theoretic properties of frequency computation and bounded queries
Information and Computation | 1995-10-29 | Paper |
Quantifying the amount of verboseness
Information and Computation | 1995-05-28 | Paper |
Effective Search Problems
Mathematical Logic Quarterly | 1995-02-16 | Paper |
Extremes in the degrees of inferability
Annals of Pure and Applied Logic | 1994-05-03 | Paper |
scientific article; zbMATH DE number 517081 (Why is no real title available?)
| 1994-03-17 | Paper |
Weakly semirecursive sets and r.e. orderings
Annals of Pure and Applied Logic | 1993-05-16 | Paper |
A cohesive set which is not high
Mathematical Logic Quarterly | 1993-01-01 | Paper |
scientific article; zbMATH DE number 49287 (Why is no real title available?)
| 1992-09-17 | Paper |
Randomness versus superspeedability
| N/A | Paper |
