Journal of Symbolic Logic 74 (3):939-975 (2009)
AbstractHigman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the standard lexicographic enumeration of all strings over some finite alphabet. We consider the following inductive inference problem: given A(s1), A(s2), A(s3), . . . . learn, in the limit, a DFA for SUBSEQU). We consider this model of learning and the variants of it that are usually studied in Inductive Inference: anomalies, mind-changes, teams, and combinations thereof. This paper is a significant revision and expansion of an earlier conference version 
Added to PP
Historical graph of downloads
Similar books and articles
Learning-in-Practise: The Social Complexity of Learning in Working Life.Elena P. Antonacopoulou - unknown
Spontaneous Coordination and Evolutionary Learning Processes in an Agent-Based Model.Pierre Barbaroux & Gilles Enée - 2005 - Mind and Society 4 (2):179-195.
What Complexity Differences Reveal About Domains in Language.Jeffrey Heinz & William Idsardi - 2013 - Topics in Cognitive Science 5 (1):111-131.
Beyond "Mutual Constitution" : Looking at Learning and Context From the Perspective of Complexity Theory.Tamsin Haggis - 2009 - In Richard Edwards, Gert Biesta & Mary Thorpe (eds.), Rethinking Contexts for Learning and Teaching. Routledge. pp. 44.
The Complexity of Moral Learning: Diversity, Deprovincialisation and Privilege.Gay Garland Reed - 2011 - Journal of Moral Education 40 (3):359-367.
Editors' Introduction: Why Formal Learning Theory Matters for Cognitive Science.Sean Fulop & Nick Chater - 2013 - Topics in Cognitive Science 5 (1):3-12.
Complexity in Language Acquisition.Alexander Clark & Shalom Lappin - 2013 - Topics in Cognitive Science 5 (1):89-110.
Extending Bayesian Concept Learning to Deal with Representational Complexity and Adaptation.Michael D. Lee - 2001 - Behavioral and Brain Sciences 24 (4):685-686.
Categorical Invariance and Structural Complexity in Human Concept Learning.Professor Ronaldo Vigo - unknown
Reducing Problem Complexity by Analogical Transfer.Peter F. Dominey - 1997 - Behavioral and Brain Sciences 20 (1):71-72.
Complexity and Postmodernism: Understanding Complex Systems.Paul Cilliers - 1998 - Routledge.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1987 - MIT Press.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Extremes in the Degrees of Inferability.Lance Fortnow, William Gasarch, Sanjay Jain, Efim Kinber, Martin Kummer, Stuart Kurtz, Mark Pleszkovich, Theodore Slaman, Robert Solovay & Frank Stephan - 1994 - Annals of Pure and Applied Logic 66 (3):231-276.
Citations of this work
No citations found.