On the public citation graph

A thesis in inductive inference

0 signed · 99 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19820282708openalex-snapshot

Inductive Inference and Computable One‐One Numberings

inferredcites →https://doi.org/10.1002/malq.19840300904openalex-snapshot

CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS

inferredcites →https://doi.org/10.1002/malq.19880340605openalex-snapshot

Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings

inferredcites →https://doi.org/10.1007/3-540-08353-7_182openalex-snapshot

Identification of formal languages

inferredcites →https://doi.org/10.1007/3-540-08860-1_37openalex-snapshot

Characterization problems in the theory of inductive inference

inferredcites →https://doi.org/10.1007/3-540-16444-8_22openalex-snapshot

How fast is program synthesis from examples

inferredcites →https://doi.org/10.1007/3-540-18253-5openalex-snapshot

A Connotational Theory of Program Structure

inferredcites →https://doi.org/10.1007/3-540-51734-0_49openalex-snapshot

Inductive inference from good examples

inferredcites →https://doi.org/10.1007/bf03037092openalex-snapshot

Monotonic and non-monotonic inductive inference

inferredcites →https://doi.org/10.1016/0020-0190(87)90114-1openalex-snapshot

Occam's Razor

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/b978-0-08-094829-4.50024-6openalex-snapshot

On the Role of Search for Learning

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(80)90285-5openalex-snapshot

Inductive inference of formal languages from positive data

inferredcites →https://doi.org/10.1016/s0020-0255(80)80006-5openalex-snapshot

Research in the theory of inductive inference by GDR mathematicians—A survey

inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot

Theory of Recursive Functions and Effective Computability

inferredcites →https://doi.org/10.1145/100216.100223openalex-snapshot

On the necessity of Occam algorithms

inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot

Inductive Inference: Theory and Methods

inferredcites →https://doi.org/10.2307/2316720openalex-snapshot

Theory of Recursive Functions and Effective Computability.

inferredcites →https://doi.org/10.5555/93335.93369openalex-snapshot

On the role of search for learning

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.1995.1107openalex-snapshot

Characterizations of Monotonic and Dual Monotonic Language Learning

inferred← citeshttps://doi.org/10.1006/inco.1996.0064openalex-snapshot

Machine Induction without Revolutionary Changes in Hypothesis Size

inferred← citeshttps://doi.org/10.1007/11776420_20openalex-snapshot

Memory-Limited U-Shaped Learning

inferred← citeshttps://doi.org/10.1007/3-540-49730-7_23openalex-snapshot

Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity Constraints

inferred← citeshttps://doi.org/10.1007/3-540-56004-1_17openalex-snapshot

A unifying approach to monotonic language learning on informant

inferred← citeshttps://doi.org/10.1007/3-540-57369-0_35openalex-snapshot

Monotonic language learning

inferred← citeshttps://doi.org/10.1007/3-540-57370-4_48openalex-snapshot

Uniform characterizations of various kinds of language learning

inferred← citeshttps://doi.org/10.1007/3-540-58520-6_76openalex-snapshot

On monotonic strategies for learning r.e. languages

inferred← citeshttps://doi.org/10.1007/3-540-58520-6_77openalex-snapshot

Language learning under various types of constraint combinations

inferred← citeshttps://doi.org/10.1007/3-540-58520-6_83openalex-snapshot

Set-driven and rearrangement-independent learning of recursive languages

inferred← citeshttps://doi.org/10.1007/3-540-59119-2_173openalex-snapshot

Trading monotonicity demands versus mind changes

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_11openalex-snapshot

Classifying recursive predicates and languages

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_12openalex-snapshot

A guided tour across the boundaries of learning recursive languages

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_14openalex-snapshot

Inductive learning of recurrence-term languages from positive data

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_2openalex-snapshot

Error detecting in inductive inference

inferred← citeshttps://doi.org/10.1007/3-540-62685-9_7openalex-snapshot

Monotonic and dual-monotonic probabilistic language learning of indexed families with high probability

inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_134-1openalex-snapshot

Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_134openalex-snapshot

Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_13openalex-snapshot

Mapping Monotonic Restrictions in Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_14openalex-snapshot

Normal Forms for Semantically Witness-Based Learners in Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_25openalex-snapshot

Towards a Map for Incremental Learning in the Limit from Positive and Negative Information

inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_29openalex-snapshot

Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes

inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_9openalex-snapshot

Maps of Restrictions for Behaviourally Correct Learning

inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_4openalex-snapshot

A Map of Update Constraints in Inductive Inference

inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_5openalex-snapshot

On the Role of Update Constraints and Text-Types in Iterative Learning

inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_13openalex-snapshot

Learners Based on Transducers

inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_10openalex-snapshot

Learning in Friedberg Numberings

inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_9openalex-snapshot

Prescribed Learning of R.E. Classes

inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_34openalex-snapshot

Optimal Language Learning

inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_4openalex-snapshot

Hypothesis Spaces for Learning

inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_25openalex-snapshot

Learning without Coding

inferred← citeshttps://doi.org/10.1007/978-3-642-34106-9_9openalex-snapshot

Automatic Learning from Positive Data and Negative Counterexamples

inferred← citeshttps://doi.org/10.1007/bf01301967openalex-snapshot

Set-driven and rearrangement-independent learning of recursive languages

inferred← citeshttps://doi.org/10.1007/bfb0030395openalex-snapshot

Dual types of hypotheses in inductive inference

inferred← citeshttps://doi.org/10.1007/bfb0030397openalex-snapshot

Monotonic versus non-monotonic language learning

inferred← citeshttps://doi.org/10.1007/bfb0033340openalex-snapshot

Inductive inference from positive data: from heuristic to characterizing methods

inferred← citeshttps://doi.org/10.1007/s00224-016-9678-0openalex-snapshot

A Solution to Wiehagen’s Thesis

inferred← citeshttps://doi.org/10.1007/s00236-017-0294-5openalex-snapshot

A theory of formal synthesis via inductive learning

inferred← citeshttps://doi.org/10.1007/s10994-012-5301-zopenalex-snapshot

Learning figures with the Hausdorff metric by fractals—towards computable binary classification

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00284-7openalex-snapshot

Monotonic and dual monotonic language learning

inferred← citeshttps://doi.org/10.1016/j.ic.2003.11.001openalex-snapshot

Generalized notions of mind change complexity

inferred← citeshttps://doi.org/10.1016/j.ic.2007.04.001openalex-snapshot

Results on memory-limited U-shaped learning

inferred← citeshttps://doi.org/10.1016/j.ic.2007.09.001openalex-snapshot

Iterative learning from positive data and negative counterexamples

inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.001openalex-snapshot

Learning in Friedberg numberings

inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.016openalex-snapshot

Hypothesis spaces for learning

inferred← citeshttps://doi.org/10.1016/j.ic.2011.07.003openalex-snapshot

Optimal language learning from positive data

inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.005openalex-snapshot

On the role of update constraints and text-types in iterative learning

inferred← citeshttps://doi.org/10.1016/j.ic.2016.06.015openalex-snapshot

Strongly non-U-shaped language learning results by general techniques

inferred← citeshttps://doi.org/10.1016/j.ic.2022.104913openalex-snapshot

Learnability and positive equivalence relations

inferred← citeshttps://doi.org/10.1016/j.jcss.2003.08.001openalex-snapshot

Trees and learning

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.021openalex-snapshot

Learning recursive functions: A survey

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.030openalex-snapshot

Learning indexed families of recursive languages from positive data: A survey

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.031openalex-snapshot

Learning and extending sublanguages

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.011openalex-snapshot

Prescribed learning of r.e. classes

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.010openalex-snapshot

Memory-limited non-U-shaped learning with solved open problems

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.011openalex-snapshot

Learning without coding

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.036openalex-snapshot

Topological separations in inductive inference

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.028openalex-snapshot

A map of update constraints in inductive inference

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00273-5openalex-snapshot

Aspects of complexity of probabilistic learning under monotonicity constraints

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00405-4openalex-snapshot

Learning classes of approximations to non-recursive functions

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00017-0openalex-snapshot

Probabilistic language learning under monotonicity constraints

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00018-2openalex-snapshot

Noisy inference and oracles

inferred← citeshttps://doi.org/10.1023/a:1018903922049openalex-snapshot

Generalization and specialization strategies for learning r.e. languages

inferred← citeshttps://doi.org/10.1080/09528130119716openalex-snapshot

On the role of search for learning from examples

inferred← citeshttps://doi.org/10.1080/09528139408953782openalex-snapshot

Characterization of language learning front informant under various monotonicity constraints

inferred← citeshttps://doi.org/10.1111/tops.12002openalex-snapshot

On the Necessity of U‐Shaped Learning

inferred← citeshttps://doi.org/10.1145/130385.130427openalex-snapshot

Types of monotonic language learning and their characterization

inferred← citeshttps://doi.org/10.1145/168304.168320openalex-snapshot

Language learning in dependence on the space of hypotheses

inferred← citeshttps://doi.org/10.1145/238061.238090openalex-snapshot

Synthesizing enumeration techniques for language learning

inferred← citeshttps://doi.org/10.1145/238061.238118openalex-snapshot

Trees and learning

inferred← citeshttps://doi.org/10.1145/267460.267485openalex-snapshot

Generalized notions of mind change complexity

inferred← citeshttps://doi.org/10.3233/com-220421openalex-snapshot

Maps for learning indexable classes

inferred← citeshttps://doi.org/10.4204/eptcs.157.10openalex-snapshot

Are There Good Mistakes? A Theoretical Analysis of CEGIS

inferred← citeshttps://doi.org/10.48550/arxiv.1404.7527openalex-snapshot

A Map of Update Constraints in Inductive Inference

inferred← citeshttps://doi.org/10.48550/arxiv.1505.03953openalex-snapshot

A Theory of Formal Synthesis via Inductive Learning

inferred← citeshttps://doi.org/10.48550/arxiv.1801.10502openalex-snapshot

Learning from Informants: Relations between Learning Success Criteria

inferred← citeshttps://doi.org/10.48550/arxiv.2010.03227openalex-snapshot

Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners

inferred← citeshttps://doi.org/10.5109/13443openalex-snapshot

TRADING MONOTONICITY DEMANDS VERSUS EFFICIENCY

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.