Case-based learning in inductive inference. COLT '92: Proceedings of the fifth annual workshop on Computational learning theory.

ANOMALY HIERARCHIES ... *-identification appears to be an upper bound on the strength of potentially practically relevant mechanized inductive inference.

An inductive inference machine is defined to be an algorithmic device with no bounds on how much time and memory resource it shall use, which takes as its ...

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...

We obtain a general characterization for the classes of recursive functions which can be synthesized by inferring nearly minimal size programs with anomalies.

Case, J., Smith, C.H.: Anomaly hierarchies of mechanized inductive inference. In: Proceedings of the 10th Symposium on the Theory of Computing, pp. 314–319 ...

Research paper thumbnail of Anomaly hierarchies of mechanized inductive inference · Anomaly hierarchies of mechanized inductive inference. BookmarkEditCompare ...

Case J., Smith C. Anomaly hierarchies of mechanized inductive inference. Proceedings, 10th Annual ACM Symposium on Theory of Computing (1978), pp. 314-319.

Case, J. and Smith, C., "Anomaly hierarchies of mechanized inductive infer- ence," Proceedings of the 10th Symposium on the Theory of Computing,.

Anomaly Hierarchies of Mechanized Inductive Inference. Conference Paper. Jan 1978. John William Case · Carl Smith · View · Language Learning from ...