Title: Comparison of identification criteria for machine inductive inference
Abstract: A natural ωpLω+1 hierarchy of successively more general criteria of success for inductive inference machines is described based on the size of sets of anomalies in programs synthesized by such machines. These criteria are compared to others in the literature. Some of our results are interpreted as tradeoff results or as showing the inherent relative-computational complexity of certain processes and others are interpreted from a positivistic, mechanistic philosophical stance as theorems in philosophy of science. The techniques of recursive function theory are employed including ordinary and infinitary recursion theorems.
Publication Year: 1983
Publication Date: 1983-03-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 415
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot