scientific article; zbMATH DE number 3515457
From MaRDI portal
Publication:4094858
zbMATH Open0329.02016MaRDI QIDQ4094858FDOQ4094858
Authors: Rūsiņš Freivalds 
Publication date: 1975
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)
Cited In (11)
- Kolmogorov numberings and minimal identification
- Characterizing language identification by standardizing operations
- Secretive interaction. Players and strategies
- On the amount of nonconstructivity in learning recursive functions
- Machine induction without revolutionary paradigm shifts
- Comparison of identification criteria for machine inductive inference
- Learning with belief levels
- Closedness properties in ex-identification
- Learning languages and functions by erasing
- Anomalous learning helps succinctness
- On a question about learning nearly minimal programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094858)
