On the public citation graph
Inductive inference of recursive functions: Complexity bounds
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/bf01078744openalex-snapshot
Asymptotic estimates of the number of finite automata
inferredcites →https://doi.org/10.1016/0004-3702(72)90048-3openalex-snapshot
On the inference of Turing machines from sample computations
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines
inferredcites →https://doi.org/10.1515/9781400882618-010openalex-snapshot
Computability by Probabilistic Machines
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.1007/3-540-44581-1_10openalex-snapshot
Robust Learning — Rich and Poor
inferred← citeshttps://doi.org/10.1007/3-540-56004-1_13openalex-snapshot
An inductive inference approach to classification
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_50openalex-snapshot
Enumerable classes of total recursive functions: Complexity of inductive inference
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_47openalex-snapshot
Effects of Kolmogorov complexity present in inductive inference as well
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_2openalex-snapshot
Learning Omega-Regular Languages: A Tour of Learning Results and Canonical Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_22openalex-snapshot
Active Learning of Recursive Functions by Ultrametric Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-45167-9_52openalex-snapshot
Learning All Subfunctions of a Function
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_26openalex-snapshot
Amount of Nonconstructivity in Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-25929-6_7openalex-snapshot
Frequency Prediction of Functions
inferred← citeshttps://doi.org/10.1016/j.ic.2004.03.003openalex-snapshot
Learning all subfunctions of a function
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.021openalex-snapshot
Learning recursive functions: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.038openalex-snapshot
Amount of nonconstructivity in deterministic finite automata
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/s0304-3975(02)00421-8openalex-snapshot
On learning of functions refutably
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.1080/09528139408953781openalex-snapshot
An inductive inference approach to classification
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814606openalex-snapshot
A better lower bound for quantum algorithms searching an ordered list
inferred← citeshttps://doi.org/10.1145/267460.267509openalex-snapshot
Resource bounded next value and explanatory identification
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.26226/morressier.604907f51a80aac83ca25d95openalex-snapshot
Polynomial Identification of $\omega$-Automata
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:10)2024openalex-snapshot
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
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.