COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Generalization versus classification
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Journal of the ACM (JACM)
On the structure of degrees of inferability
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
The strength of noninclusions for teams of finite learners (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Inclusion problems in parallel learning and games (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning via queries and oracles
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Inductive inference of functions on the rationals
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Aspects of complexity of conservative probabilistic learning
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Extensional set learning (extended abstract)
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Synthesizing noise-tolerant language learners
Theoretical Computer Science
Hierarchies of probabilistic and team FIN -learning
Theoretical Computer Science
Learning algebraic structures from text
Theoretical Computer Science - Algorithmic learning theory
Aspects of complexity of probabilistic learning under monotonicity constraints
Theoretical Computer Science - Algorithmic learning theory
A characterization of c.e. random reals
Theoretical Computer Science
Minds and Machines
Effectively closed sets and graphs of computable real functions
Theoretical Computer Science
The closure properties on real numbers under limits and computable operators
Theoretical Computer Science
Presentations of computably enumerable reals
Theoretical Computer Science
Degrees of Dowd-type generic oracles
Information and Computation
Cellular automata and intermediate reachability problems
Fundamenta Informaticae - Special issue on cellular automata
Inductive inference with additional information
Journal of Computer and System Sciences
Journal of Computer Science and Technology
The Arithmetical Hierarchy of Real Numbers
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Hierarchy of Monotonically Computable Real Numbers
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Construction of Effective Random Sets
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Closure Properties of Real Number Classes under Limits and Computable Operators
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Degree of Unsolvability of a Real Number
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Synthesizing Learners Tolerating Computable Noisy Data
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learning Algebraic Structures from Text Using Semantical Knowledge
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
On the Learnability of Vector Spaces
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Classes with Easily Learnable Subclasses
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Random elements in effective topological spaces with measure
Information and Computation
Entropic measures, Markov information sources and complexity
Applied Mathematics and Computation
Cellular automata and intermediate degrees
Theoretical Computer Science
On algebraic and logical specifications of classes of regular languages
Theoretical Computer Science - Australasian computer science
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Undecidability Results For Low Complexity Degree Structures
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some connections between bounded query classes and non-uniform complexity
Information and Computation
The dimensions of individual strings and sequences
Information and Computation
Counting extensional differences in BC-learning
Information and Computation
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Classes with easily learnable subclasses
Information and Computation
A complexity-theoretic proof of a Recursion-Theoretic Theorem
ACM SIGACT News
Almost periodic configurations on linear cellular automata
Fundamenta Informaticae - Special issue on cellular automata
On the classification of recursive languages
Information and Computation
Learning all subfunctions of a function
Information and Computation
Toward an intutive and interesting theory course: the first step of a road map
Journal of Computing Sciences in Colleges
Theoretical Computer Science
The complexity of reversible cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Logic programming with infinite sets
Annals of Mathematics and Artificial Intelligence
Learning via finitely many queries
Annals of Mathematics and Artificial Intelligence
Three concepts of decidability for general subsets of uncountable spaces
Theoretical Computer Science - Real numbers and computers
Divergence bounded computable real numbers
Theoretical Computer Science - Real numbers and computers
On the learnability of vector spaces
Journal of Computer and System Sciences
Randomness and universal machines
Journal of Complexity
A sequentially computable function that is not effectively continuous at any point
Journal of Complexity
Computability and the Implicit Function Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
Electronic Notes in Theoretical Computer Science (ENTCS)
Medvedev Degrees of Generalized R.E. separating Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
Enumerations of Π10 Classes: Acceptability and Decidable Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of the structure of the Solovay degrees of c.e. reals
Journal of Computer and System Sciences
Results on memory-limited U-shaped learning
Information and Computation
International Journal of Robotics Research
An explicit solution to Post's Problem over the reals
Journal of Complexity
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems
Singular Coverings and Non-Uniform Notions of Closed Set Computability
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Computer and System Sciences
Computability Theoretic Properties of the Entropy of Gap Shifts
Fundamenta Informaticae
A Hierarchy of Computably Enumerable Reals
Fundamenta Informaticae
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Turing degrees of reals of positive effective packing dimension
Information Processing Letters
A Minimal Pair in the Quotient Structure M/NCup
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Constructive Dimension and Weak Truth-Table Degrees
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Pseudojump Operators and $\Pi^0_1$ Classes
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Comparing C.E. Sets Based on Their Settling Times
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Post's Problem for Ordinal Register Machines
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Input-Dependence in Function-Learning
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Enumerations and Torsion Free Abelian Groups
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Computability and Incomputability
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Cupping $\Delta_2^0$ Enumeration Degrees to 0e'
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Prescribed Learning of R.E. Classes
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Perfect Local Computability and Computable Simulations
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Numberings Optimal for Learning
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
When Is Reachability Intrinsically Decidable?
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On some open problems in reflective inductive inference
Information Processing Letters
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Elementary differences among jump classes
Theoretical Computer Science
Prescribed learning of r.e. classes
Theoretical Computer Science
Non-cupping, measure and computably enumerable splittings
Mathematical Structures in Computer Science
Principal filters definable by parameters in bt†
Mathematical Structures in Computer Science
Cupping Δ20 enumeration degrees to 0e′†
Mathematical Structures in Computer Science
The method of the yu–ding theorem and its application
Mathematical Structures in Computer Science
Complexity Oscillations in Random Reals
IEICE - Transactions on Information and Systems
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Constructive reduction: understanding uncomputability through programming
ACM SIGCSE Bulletin
$\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Computable Exchangeable Sequences Have Computable de Finetti Measures
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Spectra of Algebraic Fields and Subfields
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Index Sets and Universal Numberings
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
0˝-Categorical Completely Decomposable Torsion-Free Abelian Groups
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Real Computable Manifolds and Homotopy Groups
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Dominance and equivalence for sensor-based agents
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Lowness Properties and Approximations of the Jump
Electronic Notes in Theoretical Computer Science (ENTCS)
First Steps in Synthetic Computability Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
On the divergence bounded computable real numbers
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Binary enumerability of real numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Numberings optimal for learning
Journal of Computer and System Sciences
Elementary differences among jump hierarchies
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
The strongest nonsplitting theorem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
There is an sw-cuppable strongly c.e. real
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
COLT'07 Proceedings of the 20th annual conference on Learning theory
On the monotonic computability of semi-computable real numbers
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Definable filters in the structure of bounded turing reductions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Extensions of embeddings in the computably enumerable degrees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Degrees with almost universal cupping property
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Computable ordered abelian groups and fields
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Computable fields and weak truth-table reducibility
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Diamond embeddings into the enumeration degrees
Mathematical Structures in Computer Science
Computability of Digital Input Output Models
Computational Economics
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
A superhigh diamond in the c.e. tt-degrees
Archive for Mathematical Logic
Index sets and universal numberings
Journal of Computer and System Sciences
Immunity properties and strong positive reducibilities
Archive for Mathematical Logic
Topological aspects of the Medvedev lattice
Archive for Mathematical Logic
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Effective categoricity of injection structures
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Cupping and diamond embeddings: a unifying approach
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Adapting Rabin's theorem for differential fields
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
On a hierarchy of plus-cupping degrees
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
The complexity of learning SUBSEQ (A)
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Every sequence is decompressible from a random one
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Degrees of weakly computable reals
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Totally ω computably enumerable and m-topped degrees
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A tree construction of the preferable answer sets for prioritized basic disjunctive logic programs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Immunity properties and the n-C.E. hierarchy
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Enumeration degrees of the bounded total sets
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A generic set that does not bound a minimal pair
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Lowness for weakly 1-generic and kurtz-random
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On differences among elementary theories of finite levels of ershov hierarchies
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Bounded enumeration reducibility and its degree structure
Archive for Mathematical Logic
Universality and cellular automata
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On approximating real-world halting problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An explicit solution to post's problem over the reals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Effectively approximating measurable sets by open sets
Theoretical Computer Science
Computably enumerable sets in the solovay and the strong weak truth table degrees
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The complexity of inductive definability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Symmetric enumeration reducibility
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The low splitting theorem in the difference hierarchy
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
FM-Representability and beyond
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Presentations of K-trivial reals and kolmogorov complexity
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Classical computability and fuzzy turing machines
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Learning families of closed sets in matroids
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Badness and jump inversion in the enumeration degrees
Archive for Mathematical Logic
Motivation for a new semantics for vagueness
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
Arithmetic complexity via effective names for random sequences
ACM Transactions on Computational Logic (TOCL)
Annals of Mathematics and Artificial Intelligence
Computability Theoretic Properties of the Entropy of Gap Shifts
Fundamenta Informaticae
A Hierarchy of Computably Enumerable Reals
Fundamenta Informaticae
Highness and local noncappability
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Effective strong nullness and effectively closed sets
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
A hierarchy of immunity and density for sets of reals
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Almost Periodic Configurations on Linear Cellular Automata
Fundamenta Informaticae - Cellular Automata
Cellular Automata and Intermediate Reachability Problems
Fundamenta Informaticae - Cellular Automata
Asking Questions versus Verifiability
Fundamenta Informaticae
ON A QUANTITATIVE NOTION OF UNIFORMITY
Fundamenta Informaticae
Bounded computable enumerability and hierarchy of computably enumerable reals
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Archive for Mathematical Logic
International Journal of Information Technology and Web Engineering
Archive for Mathematical Logic
Initial segment complexities of randomness notions
Information and Computation
Domatic partitions of computable graphs
Archive for Mathematical Logic
| Hi-index | 0.02 |