Machine learning of higher-order programs
From MaRDI portal
Publication:4302347
DOI10.2307/2275402zbMath0814.03034OpenAlexW2106556776MaRDI QIDQ4302347
Sanjay Jain, Mandayam Suraj, John Case, Ganesh R. Baliga
Publication date: 15 August 1994
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275402
identificationcomputable functionsrecursive functionslearning machinelearning powergenerator programshigher- order programslimiting programs
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
On the classification of recursive languages ⋮ Machine induction without revolutionary paradigm shifts ⋮ Inferring answers to queries ⋮ Vacillatory and BC learning on noisy data ⋮ Learning correction grammars
Cites Work
- Comparison of identification criteria for machine inductive inference
- Research in the theory of inductive inference by GDR mathematicians - A survey
- On degrees of unsolvability
- ON LEARNING LIMITING PROGRAMS
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Machine learning of higher-order programs
