On the public citation graph
Inductive inference of recursive functions: Qualitative theory
0 signed · 49 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/3-540-08353-7_182openalex-snapshot
Identification of formal languages
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1145/322344.322356openalex-snapshot
The Power of Pluralism for Automatic Program Synthesis
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
inferredcites →https://doi.org/10.2307/2964292openalex-snapshot
Gödel numberings of partial recursive functions
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.1999.2805openalex-snapshot
Robust Behaviorally Correct Learning
inferred← citeshttps://doi.org/10.1006/inco.2001.2922openalex-snapshot
Learning by the Process of Elimination
inferred← citeshttps://doi.org/10.1006/jcss.1997.1508openalex-snapshot
Learning Recursive Functions from Approximations
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/3-540-44581-1_10openalex-snapshot
Robust Learning — Rich and Poor
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_1openalex-snapshot
Towards Axiomatic Basis of Inductive Inference
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_22openalex-snapshot
Learning Recursive Functions Refutably
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_35openalex-snapshot
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_23openalex-snapshot
On the Uniform Learnability of Approximations to Non-recursive Functions
inferred← citeshttps://doi.org/10.1007/3-540-56004-1_7openalex-snapshot
Unions of identifiable classes of total recursive functions
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_37openalex-snapshot
Towards efficient inductive synthesis of expressions from input/output examples
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_56openalex-snapshot
Identifying nearly minimal Gödel numbers from additional information
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_175openalex-snapshot
On the intrinsic complexity of learning
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_176openalex-snapshot
The structure of intrinsic complexity of learning
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_177openalex-snapshot
Kolmogorov numberings and minimal identification
inferred← citeshttps://doi.org/10.1007/3-540-60217-8_6openalex-snapshot
Optimization problem in inductive inference
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_21openalex-snapshot
General inductive inference types based on linearly-ordered sets
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_50openalex-snapshot
On learning and co-learning of minimal programs
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_6openalex-snapshot
Structured Frequency Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_9openalex-snapshot
Changing the Inference Type – Keeping the Hypothesis Space
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_33openalex-snapshot
On the Amount of Nonconstructivity in Learning Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-25929-6_7openalex-snapshot
Frequency Prediction of Functions
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.10.005openalex-snapshot
Robust learning—rich and poor
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.007openalex-snapshot
Learning with belief levels
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.023openalex-snapshot
Quantum inductive inference by finite automata
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(02)00421-8openalex-snapshot
On learning of functions refutably
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00295-2openalex-snapshot
Kolmogorov numberings and minimal identification
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00269-8openalex-snapshot
Learning languages and functions by erasing
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.1023/a:1018920425684openalex-snapshot
Identifying nearly minimal Gödel numbers from additional information
inferred← citeshttps://doi.org/10.1142/s012905419500007xopenalex-snapshot
AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
inferred← citeshttps://doi.org/10.1142/s0129626414400039openalex-snapshot
On the Influence of Technology on Learning Processes
inferred← citeshttps://doi.org/10.1145/130385.130426openalex-snapshot
On the role of procrastination for machine learning
inferred← citeshttps://doi.org/10.1145/180139.181098openalex-snapshot
Co-learning of total recursive functions
inferred← citeshttps://doi.org/10.1145/180139.181150openalex-snapshot
On the intrinsic complexity of language identification
inferred← citeshttps://doi.org/10.1145/279943.279982openalex-snapshot
On the power of learning robustly
inferred← citeshttps://doi.org/10.1145/307400.307465openalex-snapshot
On the intrinsic complexity of learning recursive functions
inferred← citeshttps://doi.org/10.22364/bjmc.2016.4.4.02openalex-snapshot
Rūsiņš Mārtiņš Freivalds: Academic Genealogy and Selected Publications
inferred← citeshttps://doi.org/10.22364/bjmc.2016.4.4.04openalex-snapshot
Four Collaborations with Rūsiņš Freivalds
inferred← citeshttps://doi.org/10.2307/2275636openalex-snapshot
The structure of intrinsic complexity of learning
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.