Journal of the ACM (JACM) - The MIT Press scientific computation series
Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Constructive real interpretation of numerical programs
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Completeness of rewrite rules and rewrite strategies for FP
Journal of the ACM (JACM)
An abstract theory of computer viruses (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
Optimizing programs over the constructive reals
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hamiltonian paths in infinite graphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The benefits of relaxing punctuality
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Reliability, sampling, and algorithmic randomness
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Theory of computation: how to start
ACM SIGACT News
Asymptomatic conditional probabilities for first-order logic
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
On the role of procrastination for machine learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Progress measures and stack assertions for fair termination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Constant time factors do matter
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the impact of forgetting on learning machines
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
On learning multiple concepts in parallel
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Probability is more powerful than team for language identification from positive data
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Co-learning of total recursive functions
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On the intrinsic complexity of language identification
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
The isomorphism conjecture fails relative to a random oracle
Journal of the ACM (JACM)
The benefits of relaxing punctuality
Journal of the ACM (JACM)
On the impact of forgetting on learning machines
Journal of the ACM (JACM)
Fundamentals of computing (a cheatlist)
ACM SIGACT News
Topological queries in spatial databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Probabilistic and team PFIN-type learning: general properties
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Synthesizing enumeration techniques for language learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Elementary formal systems, intrinsic complexity, and procrastination
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Angluin's theorem for indexed families of r.e. sets and applications
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Robust learning aided by context
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
On the power of learning robustly
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Safe stratified Datalog with integer order does not have syntax
ACM Transactions on Database Systems (TODS)
Foundation of a computable solid modeling
Proceedings of the fifth ACM symposium on Solid modeling and applications
On a generalized notion of mistake bounds
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
On the intrinsic complexity of learning recursive functions
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Denotational semantics and rewrite rules for FP
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Exact real arithmetic: a case study in higher order programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Monogenic Post Normal Systems of Arbitrary Degree
Journal of the ACM (JACM)
Toward a Theory of Enumerations
Journal of the ACM (JACM)
On Effective Procedures for Speeding Up Algorithms
Journal of the ACM (JACM)
A Note on Degrees of Self-Describing Turing Machines
Journal of the ACM (JACM)
Simple Computation-Universal Cellular Spaces
Journal of the ACM (JACM)
Computational Complexity and the Existence of Complexity Gaps
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Toward Abstract Numerical Analysis
Journal of the ACM (JACM)
Ordinal Hierarchies and Naming Complexity Classes
Journal of the ACM (JACM)
An Example of Information and Computation Resource Trade-Off
Journal of the ACM (JACM)
On Almost Everywhere Complex Recursive Functions
Journal of the ACM (JACM)
Simple Representations of Certain Classes of Languages
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
Complex Properties of Grammars
Journal of the ACM (JACM)
New Real-Time Simulations of Multihead Tape Units
Journal of the ACM (JACM)
A Morphic Representation of Complements of Recursively Enumerable Sets
Journal of the ACM (JACM)
The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
Journal of the ACM (JACM)
The Power of Pluralism for Automatic Program Synthesis
Journal of the ACM (JACM)
What Machines Can and Cannot Do
ACM Computing Surveys (CSUR)
An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
Communications of the ACM
An abstract Monte-Carlo method for the analysis of probabilistic programs
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program
Communications of the ACM
Technical correspondence: performance of the simplex algorithm in real-world linear programming
Communications of the ACM
Technical communications: Critiquing a critique of Hoare's programming logics
Communications of the ACM
Technical communications: Critiquing a critique of Hoare's programming logics. author's response
Communications of the ACM
Technical communications: Critiquing a critique of Hoare's programming logics. author's response
Communications of the ACM
Probabilistic inductive inference: a survey
Theoretical Computer Science
On the learnability of recursively enumerable languages from good examples
Theoretical Computer Science
Predictive learning models for concept drift
Theoretical Computer Science - Algorithmic learning theory
Closedness properties in ex-identification
Theoretical Computer Science - Algorithmic learning theory
On the asymptotic behaviour of primitive recursive algorithms
Theoretical Computer Science
Predicting zero coefficients in formal power series computations
Journal of Symbolic Computation
Control structures in hypothesis spaces: the influence on learning
Theoretical Computer Science
Expressiveness of the operation set of a data abstraction
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Suboptimal measures of predictive complexity for absolute loss function
Information and Computation
Equational theory of context unification is undecidable
Theoretical Computer Science
Modelization of deterministic rational relations
Theoretical Computer Science
The undecidability of associativity and commutativity analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data-Flow Frameworks for Worst-Case Execution Time Analysis
Real-Time Systems
Analytic sets in descriptive set theory and NP sets in complexity theory
Fundamenta Informaticae
A continuum of discrete systems
Annals of Mathematics and Artificial Intelligence
Generalization and specialization strategies for learning r.e. languages
Annals of Mathematics and Artificial Intelligence
Learning recursive languages from good examples
Annals of Mathematics and Artificial Intelligence
Identifying nearly minimal Gödel numbers from additional information
Annals of Mathematics and Artificial Intelligence
Macrotransducers and Applicative Systems for Partially Continuous Functions
Cybernetics and Systems Analysis
Applicative Compositions of Partial Predicates
Cybernetics and Systems Analysis
Formalizing Synthetic Domain Theory
Journal of Automated Reasoning
An Algebraic Approach to Propositional Fuzzy Logic
Journal of Logic, Language and Information
Reflections on Gödel's and Gandy's Reflections on Turing's Thesis
Minds and Machines
Is There a Nonrecursive Decidable Equational Theory?
Minds and Machines
Nonrobustness Property of the Individual Ergodic Theorem
Problems of Information Transmission
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
On complexity of easy predictable sequences
Information and Computation
Alan Turing and the Mathematical Objection
Minds and Machines
Learning classes of approximations to non-recursive functions
Theoretical Computer Science
Effective metric spaces and representations of the reals
Theoretical Computer Science
Effective simultaneous approximability of reals
Theoretical Computer Science
IEEE Transactions on Knowledge and Data Engineering
Mind change complexity of learning logic programs
Theoretical Computer Science
Learning by the process of elimination
Information and Computation
Degrees of Dowd-type generic oracles
Information and Computation
Completeness of the Owicki-Gries System for Parameterized Parallel Programs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On the Autoreducibility of Random Sequences
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Wadge Degrees of omega-Languages of Deterministic Turing Machines
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Approaches to Effective Semi-continuity of Real Functions
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Mind Change Complexity of Learning Logic Programs
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Closedness Properties in EX-Identification of Recursive Functions
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Towards the Validation of Inductive Learning Systems
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Predictive Learning Models for Concept Drift
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
On the Uniform Learnability of Approximations to Non-Recursive Functions
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Erasing Pattern Languages with Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning by Switching Type of Information
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Extending Elementary Formal Systems
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Refutable Language Learning with a Neighbor System
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Learning Recursive Functions Refutably
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Non-linear Inequalities between Predictive and Kolmogorov Complexities
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
Consistency Queries in Information Extraction
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Reflective Inductive Inference of Recursive Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Negative Result on Inductive Inference of Extended Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Minimal Covers of Formal Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Synthesis of Strategies Identifying Recursive Functions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Robust Learning - Rich and Poor
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Merging Uniform Inductive Learners
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Predictive Complexity and Information
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Banach-Mazur Computable Functions on Metric Spaces
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Random elements in effective topological spaces with measure
Information and Computation
Advanced elementary formal systems
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Decision lists over regular patterns
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Refutable language learning with a neighbor system
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
On learning of functions refutably
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Borel hierarchy and omega context free languages
Theoretical Computer Science
Computability theory of generalized functions
Journal of the ACM (JACM)
Decidability results for primitive recursive algorithms
Theoretical Computer Science
Highlights of the history of the lambda-calculus
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
New real-time simulations of multihead tape units
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Computability and completeness in logics of programs (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Computability concepts for programming language semantics
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
The optimal fixedpoint of recursive programs
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Polynomial and abstract subrecursive classes
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Comparison of polynomial-time reducibilities
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Type two computational complexity
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Computer Science And Recursion Theory
ACM '78 Proceedings of the 1978 annual conference
The subgraph homeomorphism problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Computability theory in admissible domains
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Indexing of subrecursive classes
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Anomaly hierarchies of mechanized inductive inference
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The nested rectangular array as a model of data
APL '79 Proceedings of the international conference on APL: part 1
APL and the Grzegorczyk hierarchy
APL '79 Proceedings of the international conference on APL: part 1
On the distribution of independent formulae of number theory
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Independence results in Computer Science? (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The complexity of the equivalence problem for straight-line programs
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Program size and economy of descriptions: Preliminary Report
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity classes of partial recursive functions (Preliminary Version)
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the size of programs in subrecursive formalisms
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
The degree hierarchy of undecidable problems of formal grammars
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Unsolvability considerations in computational complexity
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Tree-manipulating systems and Church-Rosser Theorems
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Three theorems on abstract families of languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
The inherent ambiguity partial algorithm problem for context free languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
On effective procedures for speeding up algorithms
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
On classes of computable functions
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Speed-ups by changing the order in which sets are enumerated (Preliminary Version)
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Towards a theory of semantics and compilers for programming languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Decision problems in computational models
Proceedings of ACM conference on Proving assertions about programs
SIGCSE '73 Proceedings of the third SIGCSE technical symposium on Computer science education
A general result on infinite trees and its applications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Some structural properties of polynomial reducibilities and sets in NP
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
P-immune sets with holes lack self-reducibility properties
Theoretical Computer Science
On the intrinsic complexity of learning recursive functions
Information and Computation
Learning by switching type of information
Information and Computation
Guarded Quantification in Least Fixed Point Logic
Journal of Logic, Language and Information
Gödel numbers: a new approach to structured programming
ACM SIGPLAN Notices
Watson-Crick D0L systems: generative power and undecidable problems
Theoretical Computer Science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Journal of Automated Reasoning
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
Intrinsic complexity of learning geometrical concepts from positive data
Journal of Computer and System Sciences
The dimensions of individual strings and sequences
Information and Computation
Appraising two decades of distributed computing theory research
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A simple proof of the undecidability of strong normalisation
Mathematical Structures in Computer Science
Variations on realizability: realizing the propositional axiom of choice
Mathematical Structures in Computer Science
On the number of fixed points of a combinator in lambda calculus
Mathematical Structures in Computer Science
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Applications of Plotkin-terms: partitions and morphisms for closed terms
Journal of Functional Programming
Computational Linguistics
Natural languages and the Chomsky hierarchy
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Theoretical Computer Science - Special issue: Algorithmic learning theory
Separation of uniform learning classes
Theoretical Computer Science - Special issue: Algorithmic learning theory
Separability and one-way functions
Computational Complexity
Independence results in computer science
ACM SIGACT News
A language construct for "Dovetailing"
ACM SIGACT News
On a class of independent problems related to Rice theorem
ACM SIGACT News
On formal specifications and completeness: reply to Farshid Nourani
ACM SIGSOFT Software Engineering Notes
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Experience, generations, and limits in machine learning
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
On the classification of recursive languages
Information and Computation
On the computational complexity of Longeley's H functional
Theoretical Computer Science - Implicit computational complexity
Learning all subfunctions of a function
Information and Computation
Hypothesis formation and language acquisition with an infinitely-often correct teacher
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Robust learning: rich and poor
Journal of Computer and System Sciences
Formal language identification: query learning vs. gold-style learning
Information Processing Letters
On the non-sequential nature of the interval-domain model of real-number computation
Mathematical Structures in Computer Science
Toward an intutive and interesting theory course: the first step of a road map
Journal of Computing Sciences in Colleges
Some notes on the representation of the user's conceptual model
ACM SIGCHI Bulletin
A theorem about automatic programming
ACM SIGART Bulletin
Information and Computation
Encyclopedia of Computer Science
Minds and Machines
Learning via finitely many queries
Annals of Mathematics and Artificial Intelligence
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Justification as truth-finding efficiency: how Ockham's Razor works
Minds and Machines - Machine learning as experimental philosophy of science
All superlinear inverse schemes are coNP-hard
Theoretical Computer Science - Mathematical foundations of computer science 2004
Relations between gold-style learning and query learning
Information and Computation
A non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Learning languages from positive data and a finite number of queries
Information and Computation
Subdomain testing of units and systems with state
Proceedings of the 2006 international symposium on Software testing and analysis
Equality of streams is a Π0 over 2-complete problem
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
On the computational content of the Lawson topology
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Learning erasing pattern languages with queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Variations on U-shaped learning
Information and Computation
Sound and complete models of contracts
Journal of Functional Programming
Marginalia to a Theorem of Jacopini
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Skeptical Reasoning in FC-Normal Logic Programs is Π^1_1-complete
Fundamenta Informaticae
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
On the learnability of vector spaces
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
Revising Type-2 Computation and Degrees of Discontinuity
Electronic Notes in Theoretical Computer Science (ENTCS)
Enumerations of Π10 Classes: Acceptability and Decidable Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
A note on discreteness and virtuality in analog computing
Theoretical Computer Science
An approach to intrinsic complexity of uniform learning
Theoretical Computer Science - Algorithmic learning theory
From learning in the limit to stochastic finite learning
Theoretical Computer Science - Algorithmic learning theory
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
The arithmetical complexity of dimension and randomness
ACM Transactions on Computational Logic (TOCL)
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Cautious virus detection in the extreme
Proceedings of the 2007 workshop on Programming languages and analysis for security
Algorithmic complexity as a criterion of unsolvability
Theoretical Computer Science
The Kolmogorov complexity of infinite words
Theoretical Computer Science
Results on memory-limited U-shaped learning
Information and Computation
A general comparison of language learning from examples and from queries
Theoretical Computer Science
Learning multiple languages in groups
Theoretical Computer Science
The size of Higman-Haines sets
Theoretical Computer Science
Iterative learning from positive data and negative counterexamples
Information and Computation
Learning languages from positive data and a limited number of short counterexamples
Theoretical Computer Science
The intensional content of Rice's theorem
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The pitfalls of verifying floating-point computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation
Computability and information in models of randomness and chaos†
Mathematical Structures in Computer Science
Non-U-shaped vacillatory and team learning
Journal of Computer and System Sciences
Learning languages from positive data and negative counterexamples
Journal of Computer and System Sciences
Probabilistic and team PFIN-type learning: General properties
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Discontinuities in pattern inference
Theoretical Computer Science
Learning and extending sublanguages
Theoretical Computer Science
Learning recursive functions: A survey
Theoretical Computer Science
Reflective inductive inference of recursive functions
Theoretical Computer Science
Quantum inductive inference by finite automata
Theoretical Computer Science
Absolute versus probabilistic classification in a logical setting
Theoretical Computer Science
Compactness Properties for Stable Semantics of Logic Programs
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Computability and the morphological complexity of some dynamics on continuous domains
Theoretical Computer Science
Learning in Friedberg numberings
Information and Computation
Turing's Responses to Two Objections
Minds and Machines
Prescribed Learning of Indexed Families
Fundamenta Informaticae
U-shaped, iterative, and iterative-with-counter learning
Machine Learning
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Characterizing Programming Systems Allowing Program Self-reference
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Complexity of Quickly ORM-Decidable Sets
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
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Feasible Iteration of Feasible Learning Functionals
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Parallelism Increases Iterative Learning Power
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Learning in Friedberg Numberings
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
On Calibration Error of Randomized Forecasting Algorithms
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
The Shrinking Property for NP and coNP
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
Persistent Computations of Turing Machines
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Back to the Complexity of Universal Programs
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Dynamically Delayed Postdictive Completeness and Consistency in Learning
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Dynamic Modeling in Inductive Inference
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning with Temporary Memory
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Fixed Point and Aperiodic Tilings
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Consistent and coherent learning with δ-delay
Information and Computation
Enumeration of context-free languages and related structures
Journal of Automata, Languages and Combinatorics
On some open problems in reflective inductive inference
Information Processing Letters
On the complexity of proving functions
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Towards Computability over Effectively Enumerable Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Difference Hierarchy in Countably Based T0-Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational virtuality in biological systems
Theoretical Computer Science
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
On calibration error of randomized forecasting algorithms
Theoretical Computer Science
Parallelism increases iterative learning power
Theoretical Computer Science
A Recursive Padding Technique on Nondeterministic Cellular Automata
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Hypothesis Spaces for Learning
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
One-shot learners using negative counterexamples and nearest positive examples
Theoretical Computer Science
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Strong Positive Reducibilities
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On some open problems in monotonic and conservative learning
Information Processing Letters
On Implementability of the Formal Specifications
Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata
Theoretical Computer Science
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
High Complexity Tilings with Sparse Errors
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Code growth in genetic programming
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Program Self-reference in Constructive Scott Subdomains
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Equivalence Relations on Classes of Computable Structures
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
The First Order Theories of the Medvedev and Muchnik Lattices
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
On the solution of trivalent decision problems by quantum state identification
Natural Computing: an international journal
The dedekind reals in abstract stone duality
Mathematical Structures in Computer Science
Decision problems for Turing machines
Information Processing Letters
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Information and Computation
Triangular norm based predicate fuzzy logics
Fuzzy Sets and Systems
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchies of Function Classes Defined by the First-Value Operator
Electronic Notes in Theoretical Computer Science (ENTCS)
First Steps in Synthetic Computability Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Relations between Gold-style learning and query learning
Information and Computation
Learning languages from positive data and a finite number of queries
Information and Computation
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Tiling systems over infinite pictures and their acceptance conditions
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Eliminating redundant range checks in GNAT using symbolic evaluation
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Consistency conditions for inductive inference of recursive functions
JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Costs of general purpose learning
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A time hierarchy theorem for nondeterministic cellular automata
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
The undecidability of the generalized Collatz problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
U-shaped, iterative, and iterative-with-counter learning
COLT'07 Proceedings of the 20th annual conference on Learning theory
COLT'07 Proceedings of the 20th annual conference on Learning theory
The omega rule is Π11-complete in the λβ-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
The diagonalization method in quantum recursion theory
Quantum Information Processing
Universality, reducibility, and completeness
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Independence results for n-ary recursion theorems
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Parametrized regular infinite games and higher-order pushdown strategies
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Degrees of undecidability in term rewriting
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Iterative learning of simple external contextual languages
Theoretical Computer Science
Incremental learning with temporary memory
Theoretical Computer Science
Difficulties in forcing fairness of polynomial time inductive inference
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Iterative learning from texts and counterexamples using additional information
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Incremental learning with ordinal bounded example memory
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
On sequences with non-learnable subsequences
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Independence from obfuscation: A semantic framework for diversity
Journal of Computer Security
Electronic Notes in Theoretical Computer Science (ENTCS)
The complexity of propositional default logics
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
The strength of the Besicovitch-Davies theorem
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Solutions to open questions for non-u-shaped learning with memory limitations
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Inductive inference of languages from samplings
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Event-related outputs of computations in P systems
Journal of Automata, Languages and Combinatorics
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On the amount of nonconstructivity in learning recursive functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Iterative learning from positive data and counters
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
The MovieOracle - Content Based Movie Recommendations
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
The complexity of learning SUBSEQ (A)
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Learning and extending sublanguages
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Iterative learning from positive data and negative counterexamples
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Invariance of function complexity under primitive recursive functions
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Gold-style and query learning under various constraints on the target class
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Non U-shaped vacillatory and team learning
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Learning multiple languages in groups
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
On learning languages from positive data and a limited number of short counterexamples
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Some recent results in u-shaped learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Variations on u-shaped learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
On beta-shifts having arithmetical languages
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Learning languages from positive data and a finite number of queries
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fixed-point tile sets and their applications
Journal of Computer and System Sciences
Effectively approximating measurable sets by open sets
Theoretical Computer Science
String extension learning using lattices
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Least upper bounds on the size of church-rosser diagrams in term rewriting and λ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Frequency prediction of functions
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Learnability of co-r.e. classes
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the amount of nonconstructivity in learning formal languages from positive data
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Properties Complementary to Program Self-Reference
Fundamenta Informaticae
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Prescribed Learning of Indexed Families
Fundamenta Informaticae
Characteristics of minimal effective programming systems
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
The Intrinsic Complexity of Learning: A Survey
Fundamenta Informaticae
Properties complementary to program self-reference
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Integrating linear arithmetic into superposition calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Confident and consistent partial learning of recursive functions
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
ACM Transactions on Computational Logic (TOCL)
Theories of Programming and Formal Methods
Domatic partitions of computable graphs
Archive for Mathematical Logic
| Hi-index | 0.16 |