On the public citation graph
Language learning by a “team”
0 signed · 35 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.1007/bf01761704openalex-snapshot
Periodicity in generations of automata
inferredcites →https://doi.org/10.1007/bfb0012761openalex-snapshot
Machine inductive inference and language identification
inferredcites →https://doi.org/10.1016/0010-0277(79)90001-5openalex-snapshot
Formal models of language learning
inferredcites →https://doi.org/10.1016/0010-0277(82)90005-1openalex-snapshot
A note on formal learning theory
inferredcites →https://doi.org/10.1016/0010-0277(82)90006-3openalex-snapshot
On extensional learnability
inferredcites →https://doi.org/10.1016/0304-3975(83)90061-0openalex-snapshot
Comparison of identification criteria for machine inductive inference
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/0890-5401(88)90046-6openalex-snapshot
Probability and plurality for aggregations of learning machines
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(75)90261-2openalex-snapshot
Toward a mathematical theory of inductive inference
inferredcites →https://doi.org/10.1016/s0019-9958(82)80025-9openalex-snapshot
Criteria of language learning
inferredcites →https://doi.org/10.1109/sfcs.1984.715951openalex-snapshot
A Characterization Of Probabilistic Inference
inferredcites →https://doi.org/10.1145/321386.321395openalex-snapshot
A Machine-Independent Theory of the Complexity of Recursive Functions
inferredcites →https://doi.org/10.1145/322344.322356openalex-snapshot
The Power of Pluralism for Automatic Program Synthesis
inferredcites →https://doi.org/10.1145/62044.62053openalex-snapshot
Probabilistic inductive inference
inferredcites →https://doi.org/10.2307/2964292openalex-snapshot
Gödel numberings of partial recursive functions
inferredcites →https://doi.org/10.2307/414105openalex-snapshot
Formal principles of language acquisition . By Kenneth Wexler and Peter W. Culicover. Cambridge, MA: MIT Press, 1980. Pp. xvii, 647. $35.00.
inferredcites →https://doi.org/10.5555/93335.93358openalex-snapshot
Learning via queries to an oracle
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1993.1005openalex-snapshot
Learning with the Knowledge of an Upper Bound on Program Size
inferred← citeshttps://doi.org/10.1006/inco.1995.1133openalex-snapshot
Finite Identification of Functions by Teams with Success Ratio and Above
inferred← citeshttps://doi.org/10.1006/inco.1996.0081openalex-snapshot
Computational Limits on Team Identification of Languages
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_44openalex-snapshot
On aggregating teams of learning machines
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_66openalex-snapshot
Three decades of team learning
inferred← citeshttps://doi.org/10.1007/3-540-60217-8_7openalex-snapshot
On identification by teams and probabilistic machines
inferred← citeshttps://doi.org/10.1007/3-540-60923-7_16openalex-snapshot
Adaptation and learning in multi-agent systems: Some remarks and a bibliography
inferred← citeshttps://doi.org/10.1007/3-540-61532-6_28openalex-snapshot
Team learning of recursive languages
inferred← citeshttps://doi.org/10.1007/bfb0030397openalex-snapshot
Monotonic versus non-monotonic language learning
inferred← citeshttps://doi.org/10.1007/s002249910003openalex-snapshot
Team Learning of Computable Languages
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00162-copenalex-snapshot
On aggregating teams of learning machines
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90043-2openalex-snapshot
Learning in the presence of partial explanations
inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50017-5openalex-snapshot
Formal Learning Theory*
inferred← citeshttps://doi.org/10.1016/b978-1-55860-146-8.50016-3openalex-snapshot
Finite Learning by a “Team”
inferred← citeshttps://doi.org/10.1080/09528139408953778openalex-snapshot
Infinitary self-reference in learning theory
inferred← citeshttps://doi.org/10.1145/168304.168331openalex-snapshot
Probability is more powerful than team for language identification from positive data
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.