On the public citation graph
The structure of intrinsic complexity of learning
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1996.0030openalex-snapshot
The Intrinsic Complexity of Language Identification
inferredcites →https://doi.org/10.1007/3-540-59119-2_175openalex-snapshot
On the intrinsic complexity of learning
inferredcites →https://doi.org/10.1007/bf01761704openalex-snapshot
Periodicity in generations of automata
inferredcites →https://doi.org/10.1007/bfb0019357openalex-snapshot
Inductive inference of recursive functions: Qualitative theory
inferredcites →https://doi.org/10.1016/0022-0000(80)90041-0openalex-snapshot
Finding patterns common to a set of strings
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(79)90040-5openalex-snapshot
An introduction to the general theory of algorithms
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0019-9958(80)90285-5openalex-snapshot
Inductive inference of formal languages from positive data
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1145/180139.181150openalex-snapshot
On the intrinsic complexity of language identification
inferredcites →https://doi.org/10.1145/321386.321395openalex-snapshot
A Machine-Independent Theory of the Complexity of Recursive Functions
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.2001.1759openalex-snapshot
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations
inferred← citeshttps://doi.org/10.1007/11894841_13openalex-snapshot
Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_12openalex-snapshot
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_25openalex-snapshot
Ordinal mind change complexity of language identification
inferred← citeshttps://doi.org/10.1007/978-0-387-30164-8_149openalex-snapshot
Complexity of Inductive Inference
inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_46-1openalex-snapshot
Complexity of Inductive Inference
inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_46openalex-snapshot
Complexity of Inductive Inference
inferred← citeshttps://doi.org/10.1007/978-3-319-46379-7_12openalex-snapshot
Intrinsic Complexity of Partial Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_6openalex-snapshot
Intrinsic Complexity of Uniform Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_10openalex-snapshot
Splitting of Learnable Classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.040openalex-snapshot
An approach to intrinsic complexity of uniform learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.004openalex-snapshot
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.009openalex-snapshot
Mind change speed-up for learning languages from positive data
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.022openalex-snapshot
Intrinsic complexity of partial learning
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00085-5openalex-snapshot
How rich is the structure of the intrinsic complexity of learning
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00067-9openalex-snapshot
Intrinsic complexity of learning geometrical concepts from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00005-5openalex-snapshot
Ordinal mind change complexity of language identification
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00059-2openalex-snapshot
On the intrinsic complexity of learning recursive functions
inferred← citeshttps://doi.org/10.1137/070700577openalex-snapshot
Mitotic Classes in Inductive Inference
inferred← citeshttps://doi.org/10.1145/238061.238093openalex-snapshot
Elementary formal systems, intrinsic complexity, and procrastination
inferred← citeshttps://doi.org/10.1145/307400.307465openalex-snapshot
On the intrinsic complexity of learning recursive functions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.